TY - GEN
T1 - Tight RMR lower bounds for mutual exclusion and other problems
AU - Attiya, Hagit
AU - Hendler, Danny
AU - Woelfel, Philipp
PY - 2008/1/1
Y1 - 2008/1/1
N2 - We investigate the remote memory references (RMRs) complexity of deterministic processes that communicate by reading and writing shared memory in asynchronous cache-coherent and distributed shared-memory multiprocessors. We define a class of algorithms that we call order encoding. By applying information-theoretic arguments, we prove that every order encoding algorithm, shared by n processes, has an execution that incurs ω(n log n) RMRs. From this we derive the same lower bound for the mutual exclusion, bounded counter and store/collect synchronization problems. The bounds we obtain for these problems are tight. It follows from the results of [10] that our lower bounds hold also for algorithms that can use comparison primitives and load-linked/store-conditional in addition to reads and writes. Our mutual exclusion lower bound proves a longstanding conjecture of Anderson and Kim.
AB - We investigate the remote memory references (RMRs) complexity of deterministic processes that communicate by reading and writing shared memory in asynchronous cache-coherent and distributed shared-memory multiprocessors. We define a class of algorithms that we call order encoding. By applying information-theoretic arguments, we prove that every order encoding algorithm, shared by n processes, has an execution that incurs ω(n log n) RMRs. From this we derive the same lower bound for the mutual exclusion, bounded counter and store/collect synchronization problems. The bounds we obtain for these problems are tight. It follows from the results of [10] that our lower bounds hold also for algorithms that can use comparison primitives and load-linked/store-conditional in addition to reads and writes. Our mutual exclusion lower bound proves a longstanding conjecture of Anderson and Kim.
KW - Bounded counter
KW - Information theory
KW - Lower bound techniques
KW - Mutual exclusion
KW - Shared-memory
KW - Store/collect object
UR - http://www.scopus.com/inward/record.url?scp=57049142196&partnerID=8YFLogxK
U2 - 10.1145/1374376.1374410
DO - 10.1145/1374376.1374410
M3 - Conference contribution
AN - SCOPUS:57049142196
SN - 9781605580470
T3 - Proceedings of the Annual ACM Symposium on Theory of Computing
SP - 217
EP - 226
BT - STOC'08
PB - Association for Computing Machinery
T2 - 40th Annual ACM Symposium on Theory of Computing, STOC 2008
Y2 - 17 May 2008 through 20 May 2008
ER -