Summary: A Generic Local­Spin Fetch­and­#­based Mutual
Exclusion Algorithm #
James H. Anderson
Department of Computer Science
University of North Carolina at Chapel Hill
Chapel Hill, NC 27599­3175
Email: anderson@cs.unc.edu
Yong­Jik Kim
Tmax Soft Research Center
272­6 Seohyeon­dong, Seongnam­si
Gyeonggi­do, Korea 463­824
Email: jick@tmax.co.kr
November 2005, Revised November 2006
Abstract
We present a generic fetch­and­#­based local­spin mutual exclusion algorithm, with O(1) time complexity
under the remote­memory­references time measure. This algorithm is ``generic'' in the sense that it can be
implemented using any fetch­and­# primitive of rank 2N , where N is the number of processes. The rank of
a fetch­and­# primitive is a notion introduced herein; informally, it expresses the extent to which processes
may ``order themselves'' using that primitive. This algorithm breaks new ground because it shows that O(1)
time complexity is possible using a wide range of primitives. In addition, by applying our generic algorithm

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

Collections: Computer Technologies and Information Sciences