Abstract
We consider the time complexity of adaptive mutual exclusion algorithms, where “time”is measured by counting the number of remote memory references required per critical-section access. We establish a lower bound that precludes a deterministic algorithm with O(log k) time complexity (in fact, any deterministic o(k) algorithm), where k is “point contention.”In contrast, we show that expected O(log k) time is possible using randomization.
Work supported by NSF grants CCR 9732916, CCR 9972211, CCR 9988327, and ITR 0082866.
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.
References
Y. Afek, H. Attiya, A. Fouren, G. Stupp, and D. Touitou. Long-lived renaming made adaptive. In Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing, pages 91–103. May 1999.
Y. Afek, P. Boxer, and D. Touitou. Bounds on the shared memory requirements for long-lived and adaptive objects. In Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, pages 81–89. July 2000.
J. Anderson and Y.-J. Kim. Adaptive mutual exclusion with local spinning. In Proceedings of the 14th International Symposium on Distributed Computing, pages 29–43, October 2000.
J. Anderson and Y.-J. Kim. An improved lower bound for the time complexity of mutual exclusion. To be presented at the 20th Annual ACM Symposium on Principles of Distributed Computing, August 2001.
J. Anderson and J.-H. Yang. Time/contention tradeoffs for multiprocessor synchronization. Information and Computation, 124(1):68–84, January 1996.
H. Attiya and V. Bortnikov. Adaptive and efficient mutual exclusion. In Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, pages 91–100. July 2000.
J. Burns and N. Lynch. Mutual exclusion using indivisible reads and writes. In Proceedings of the 18th Annual Allerton Conference on Communication,Control, and Computing, pages 833–842, 1980.
M. Choy and A. Singh. Adaptive solutions to the mutual exclusion problem. Distributed Computing, 8(1):1–17, 1994.
L. Lamport. A fast mutual exclusion algorithm. ACM Transactions on Computer Systems, 5(1):1–11, February 1987.
M. Merritt and G. Taubenfeld. Speeding Lamport’s fast mutual exclusion algorithm. Information Processing Letters, 45:137–142, 1993.
E. Styer. Improving fast mutual exclusion. In Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing, pages 159–168. August 1992.
E. Styer and G. Peterson. Tight bounds for shared memory symmetric mutual exclusion. In Proceedings of the 8th Annual ACM Symposium on Principles of Distributed Computing, pages 177–191. August 1989.
P. Turán. On an extremal problem in graph theory (in Hungarian). Mat. Fiz. Lapok, 48:436–452, 1941.
J.-H. Yang and J. Anderson. A fast, scalable mutual exclusion algorithm. Distributed Computing, 9(1):51–60, August 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, YJ., Anderson, J.H. (2001). A Time Complexity Bound for Adaptive Mutual Exclusion. In: Welch, J. (eds) Distributed Computing. DISC 2001. Lecture Notes in Computer Science, vol 2180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45414-4_1
Download citation
DOI: https://doi.org/10.1007/3-540-45414-4_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42605-9
Online ISBN: 978-3-540-45414-4
eBook Packages: Springer Book Archive