TY - GEN

T1 - An O(1)-Barriers optimal RMRs mutual exclusion algorithm

AU - Attiya, Hagit

AU - Hendler, Danny

AU - Levy, Smadar

PY - 2013/9/11

Y1 - 2013/9/11

N2 - Mutual exclusion is a fundamental coordination problem. Over the last 20 years, shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references (RMRs) metric. To ensure the correctness of concurrent algorithms in general, and mutual exclusion algorithms in particular, it is often required to prohibit certain re-orderings of memory instructions that may compromise correctness, by inserting memory barrier instructions. Memory barriers incur non-negligible overhead and may significantly increase the algorithm's time complexity. This paper presents the first read/write mutual exclusion algorithm with asymptotically optimal complexity under both the RMRs and barriers metrics: each passage through the critical section incurs O(log n) RMRs and a constant number of barriers. The algorithm works in the popular Total Store Ordering model.

AB - Mutual exclusion is a fundamental coordination problem. Over the last 20 years, shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references (RMRs) metric. To ensure the correctness of concurrent algorithms in general, and mutual exclusion algorithms in particular, it is often required to prohibit certain re-orderings of memory instructions that may compromise correctness, by inserting memory barrier instructions. Memory barriers incur non-negligible overhead and may significantly increase the algorithm's time complexity. This paper presents the first read/write mutual exclusion algorithm with asymptotically optimal complexity under both the RMRs and barriers metrics: each passage through the critical section incurs O(log n) RMRs and a constant number of barriers. The algorithm works in the popular Total Store Ordering model.

KW - Mutual exclusion

KW - Shared memory

KW - Total store ordering

UR - http://www.scopus.com/inward/record.url?scp=84883496512&partnerID=8YFLogxK

U2 - 10.1145/2484239.2484255

DO - 10.1145/2484239.2484255

M3 - Conference contribution

AN - SCOPUS:84883496512

SN - 9781450320658

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 220

EP - 229

BT - PODC 2013 - Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing

T2 - 2013 ACM Symposium on Principles of Distributed Computing, PODC 2013

Y2 - 22 July 2013 through 24 July 2013

ER -