Abstract
We present an N-process algorithm for mutual exclusion un- der read/write atomicity that has O(1) time complexity in the absence of contention and Θ(log N) time complexity under contention, where “time” is measured by counting remote memory references. This is the first such algorithm to achieve these time complexity bounds. Our algo- rithm is obtained by combining a new “fast-path” mechanism with an arbitration-tree algorithm presented previously by Yang and Anderson.
Abstract
Work supported by NSF grant CCR 9732916. The first author was also supported by an Alfred P. Sloan Research Fellowship.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
T. Anderson. The performance of spin lock alternatives for shared-memory multi-processors. IEEE Trans. on Parallel and Distributed Sys., 1(1):6–16, 1990.
R. Cypher. The communication requirements of mutual exclusion. In Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures, pages 147–156, 1995.
E. Dijkstra. Solution of a problem in concurrent programming control. Communications of the ACM, 8(9):569, 1965.
G. Graunke and S. Thakkar. Synchronization algorithms for shared-memory multi-processors. IEEE Computer, 23:60–69, 1990.
L. Lamport. A fast mutual exclusion algorithm. ACM Trans. on Computer Sys., 5(1):1–11, 1987.
J. Mellor-Crummey and M. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Trans. on Computer Sys., 9(1):21–65, 1991.
M. Moir and J. Anderson. Wait-free algorithms for fast, long-lived renaming. Science of Computer Programming, 25(1):1–39, 1995.
J.-H. Yang and J. Anderson. Fast, scalable synchronization with minimal hardware support. In Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing, pages 171–182. 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Anderson, J.H., Kim, YJ. (1999). Fast and Scalable Mutual Exclusion. In: Jayanti, P. (eds) Distributed Computing. DISC 1999. Lecture Notes in Computer Science, vol 1693. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48169-9_13
Download citation
DOI: https://doi.org/10.1007/3-540-48169-9_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66531-1
Online ISBN: 978-3-540-48169-0
eBook Packages: Springer Book Archive