Abstract
We present an N-process algorithm for mutual exclusion under 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 algorithm is obtained by combining a new “fast-path” mechanism with an arbitration-tree algorithm presented previously by Yang and Anderson.
Cite
CITATION STYLE
Anderson, J. H., & Kim, Y. J. (1999). Fast and scalable mutual exclusion. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1693, pp. 180–195). Springer Verlag. https://doi.org/10.1007/3-540-48169-9_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
