Abstract
We consider the time complexity of shared-memory mutual exclusion algorithms based on reads, writes, and comparison primitives under the remote-memory-reference (RMR) time measure. For asynchronous systems, a lower bound of Ω(log N/log log N) RMRs per critical-section entry has been established in previous work, where N is the number of processes. In this paper, we show that lower RMR time complexity is attainable in semi-synchronous systems in which processes may execute delay statements. When assessing the time complexity of delay-based algorithms, the question of whether delays should be counted arises. We consider both possibilities. Also of relevance is whether delay durations are upper-bounded. (They are lower-bounded by definition.) Again, we consider both possibilities. For each of these possibilities, we present an algorithm with either Θ(1) or Θ(log log N) time complexity. For the cases in which a Ω(log log N) algorithm is given, we establish matching Ω(log log N) lower bounds.
Work supported by NSF grant CCR 0208289.
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
Afek, Y., Boxer, P., Touitou, D.: 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, July 2000, pp. 81–89. ACM, New York (2000)
Alur, R., Attiya, H., Taubenfeld, G.: Time-adaptive algorithms for synchronization. In: Proceedings of the 26th Annual ACM Symposium on Theory of Computing, May 1994, pp. 800–809. ACM, New York (1994)
Alur, R., Taubenfeld, G.: How to share an object: A fast timing-based solution. In: Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing, pp. 470–477. IEEE, Los Alamitos (1993)
Alur, R., Taubenfeld, G.: Fast timing-based algorithms. Distributed Computing 10(1), 1–10 (1996)
Anderson, J., Kim, Y.-J.: An improved lower bound for the time complexity of mutual exclusion. In: Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing, August 2001, pp. 90–99. ACM, New York (2001)
Anderson, J., Kim, Y.-J.: Local-spin mutual exclusion using fetch-and-φ primitives. In: Proceedings of the 23rd IEEE International Conference on Distributed Computing Systems, May 2003, pp. 538–547. IEEE, Los Alamitos (2003)
Anderson, J., Kim, Y.-J., Herman, T.: Shared-memory mutual exclusion: Major research trends since 1986. Distributed Computing (2003) (to appear)
Anderson, J., Yang, J.-H.: Time/contention tradeoffs for multiprocessor synchronization. Information and Computation 124(l), 68–84 (1996)
Anderson, T.: The performance of spin lock alternatives for shared-memory multiprocessors. IEEE Transactions on Parallel and Distributed Systems 1(1), 6–16 (1990)
Burns, J., Lynch, N.: Mutual exclusion using indivisible reads and writes. In: Proceedings of the 18th Annual Allerton Conference on Communication, Control, and Computing, pp. 833–842 (1980)
Cypher, R.: The communication requirements of mutual exclusion. In: Proceedings of the Seventh Annual Symposium on Parallel Algorithms and Architectures, June 1995, pp. 147–156 (1995)
Graunke, G., Thakkar, S.: Synchronization algorithms for shared-memory multiprocessors. IEEE Computer 23, 60–69 (1990)
Kessels, J.: Arbitration without common modifiable variables. Acta Informatica 17, 135–141 (1982)
Kim, Y.-J., Anderson, J.: Timing-based mutual exclusion with local spinning. Manuscript (July 2003), Available from http: http://www.cs.unc.edu/~anderson/papers.html
Kim, Y.-J., Anderson, J.: A time complexity bound for adaptive mutual exclusion. In: Proceedings of the 15th International Symposium on Distributed Computing (October 2001)
Lamport, L.: A fast mutual exclusion algorithm. ACM Transactions on Computer Systems 5(1), 1–11 (1987)
Lynch, N., Shavit, N.: Timing based mutual exclusion. In: Proceedings of the 13th IEEE Real-Time Systems Symposium, December 1992, pp. 2–11. IEEE, Los Alamitos (1992)
Mellor-Crummey, J., Scott, M.: Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Transactions on Computer Systems 9(1), 21–65 (1991)
Ramamurthy, S., Moir, M., Anderson, J.: Real-time object sharing with minimal support. In: Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, May 1996, pp. 233–242. ACM, New York (1996)
Styer, E., Peterson, G.: Tight bounds for shared memory symmetric mutual exclusion. In: Proceedings of the 8th Annual ACM Symposium on Principles of Distributed Computing, August 1989, pp. 177–191. ACM, New York (1989)
van Emde Boas, P.: Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters 6(3), 80–82 (1977)
Yang, J.-H., Anderson, J.: A fast, scalable mutual exclusion algorithm. Distributed Computing 9(l), 51–60 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, YJ., Anderson, J.H. (2003). Timing-Based Mutual Exclusion with Local Spinning. In: Fich, F.E. (eds) Distributed Computing. DISC 2003. Lecture Notes in Computer Science, vol 2848. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39989-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-39989-6_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20184-7
Online ISBN: 978-3-540-39989-6
eBook Packages: Springer Book Archive