| | |
Summary: An Improved Lower Bound for the Time Complexity of
Mutual Exclusion
(Extended Abstract)
James H. Anderson and YongJik Kim
Department of Computer Science
University of North Carolina at Chapel Hill
fanderson, kimyg@cs.unc.edu
ABSTRACT
We establish a lower bound
of
19 N= log log N) re-
mote memory references for N-process mutual exclu-
sion algorithms based on reads, writes, or comparison
primitives. Our bound improves an earlier bound of
f 2 log N= log log log N) established by Cypher.
1. INTRODUCTION
Recent work on mutual exclusion [6] has focused on the
design of \scalable" local-spin algorithms. Good scalability
is achieved in such algorithms by using spin loops in which
|
