Summary: Adaptive Mutual Exclusion with Local Spinning #
Yong­Jik Kim
Tmax Soft Research Center
272­6 Seohyeon­dong, Seongnam­si
Gyeonggi­do, Korea 463­824
Email: jick@tmax.co.kr
James H. Anderson
Department of Computer Science
University of North Carolina at Chapel Hill
Chapel Hill, NC 27599­3175
Email: anderson@cs.unc.edu
March 2001, Revised May 2003, January 2005, and July 2006
Abstract
We present an adaptive algorithm for N­process mutual exclusion under read/write atomicity in which
all busy waiting is by local spinning. In our algorithm, each process p performs O(k) remote memory
references to enter and exit its critical section, where k is the maximum ``point contention'' experienced
by p. The space complexity of our algorithm is #(N ), which is clearly optimal. Our algorithm is the
first mutual exclusion algorithm under read/write atomicity that is adaptive when time complexity is
measured by counting remote memory references.
Keywords: Adaptive mutual exclusion, local spinning, read/write atomicity, shared­memory systems,

Source: Anderson, James - Department of Computer Science, University of North Carolina at Chapel Hill

Collections: Computer Technologies and Information Sciences