Timing-Based Mutual Exclusion with Local Spinning

(Extended Abstract)
  • Yong-Jik Kim
  • James H. Anderson
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2848)


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.


Time Complexity Visible Process Critical Event Critical Section Mutual Exclusion 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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)Google Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    Alur, R., Taubenfeld, G.: Fast timing-based algorithms. Distributed Computing 10(1), 1–10 (1996)CrossRefMathSciNetGoogle Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    Anderson, J., Kim, Y.-J., Herman, T.: Shared-memory mutual exclusion: Major research trends since 1986. Distributed Computing (2003) (to appear)Google Scholar
  8. 8.
    Anderson, J., Yang, J.-H.: Time/contention tradeoffs for multiprocessor synchronization. Information and Computation 124(l), 68–84 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Anderson, T.: The performance of spin lock alternatives for shared-memory multiprocessors. IEEE Transactions on Parallel and Distributed Systems 1(1), 6–16 (1990)CrossRefGoogle Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    Graunke, G., Thakkar, S.: Synchronization algorithms for shared-memory multiprocessors. IEEE Computer 23, 60–69 (1990)Google Scholar
  13. 13.
    Kessels, J.: Arbitration without common modifiable variables. Acta Informatica 17, 135–141 (1982)zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Kim, Y.-J., Anderson, J.: Timing-based mutual exclusion with local spinning. Manuscript (July 2003), Available from http:
  15. 15.
    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)Google Scholar
  16. 16.
    Lamport, L.: A fast mutual exclusion algorithm. ACM Transactions on Computer Systems 5(1), 1–11 (1987)CrossRefGoogle Scholar
  17. 17.
    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)Google Scholar
  18. 18.
    Mellor-Crummey, J., Scott, M.: Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Transactions on Computer Systems 9(1), 21–65 (1991)CrossRefGoogle Scholar
  19. 19.
    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)Google Scholar
  20. 20.
    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)CrossRefGoogle Scholar
  21. 21.
    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)zbMATHCrossRefGoogle Scholar
  22. 22.
    Yang, J.-H., Anderson, J.: A fast, scalable mutual exclusion algorithm. Distributed Computing 9(l), 51–60 (1995)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Yong-Jik Kim
    • 1
  • James H. Anderson
    • 1
  1. 1.Department of Computer ScienceUniversity of North Carolina at Chapel Hill 

Personalised recommendations