Skip to main content
Springer Nature Link
Log in

Adaptive solutions to the mutual exclusion problem

  • Published:
Distributed Computing Aims and scope Submit manuscript

Summary

Algorithms for mutual exclusion that adapt to the current degree of contention are developed. Afilter and a leader election algorithm form the basic building blocks. The algorithms achieve system response times that are independent of the total number of processes and governed instead by the current degree of contention. The final algorithm achieves a constant amortized system response time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Afek Y, Gafni E, Merritt M, Taubenfeld G: Contention sensitive mutual exclusion. Presented at the rump session of the 10th Annual ACM Symposium on the Principles of Distributed Computing, August 1991

  2. Alur R, Taubenfeld G: Results about fast mutual exclusion. In: Proceedings of the 13th IEEE Real-Time Systems Symposium, pp 12–21, 1992

  3. Anderson TE: The performance of spin-lock alternatives for shared-memory multi-processors. IEEE Trans Parallel Distrib Syst 1(1): 6–16 (1990)

    Google Scholar 

  4. Chandy KM, Misra J: Parallel program design: a foundation. Addison Wesley, Reading, Mass, 1988

    Google Scholar 

  5. Cole R, Zajicek O: The APRAM: incorporating asynchrony into the PRAM model. In: Proceedings of the First ACM Symposium on Parallel Algorithms and Architectures, pp 169–178, 1989

  6. Dijkstra EW: Solution of a problem in concurrent program control. Commun ACM 8(9): 569 (1965)

    Google Scholar 

  7. Dwork C, Herlihy M, Waarts O: Contention in shared memory algorithms. In: Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pp 174–183, 1993

  8. Gibbons PB, Matias Y, Ramachandran V: The QRQW PRAM: accounting for contention in parallel algorithms. In: Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pp 638–648, 1994

  9. Gottlieb A, Grishman R, Kruskal CP, McAuliffe KM, Rudolph L, Snir M: The NYU ultracomputer — designing an mimd shared memory parallel computer. IEEE Trans Comput C-32(2) (1983)

  10. Knuth DE: Additional comments on a problem in concurrent program control. Commun ACM 9(5): 321–322 (1966)

    Google Scholar 

  11. Lamport L: A new solution of Dijkstra's concurrent programming problem. Commun ACM 17(8): 453–455 (1974)

    Google Scholar 

  12. Lamport L: A fast mutual exclusion algorithm. ACM Trans Comput Syst 5(1): 1–11 (1987)

    Google Scholar 

  13. Lycklama EA, Hadzilacos V: A first-come-first-served mutualexclusion algorithm with small communication variables. ACM Trans Program Languages Syst 13(4): 558–576 (1991)

    Google Scholar 

  14. Lynch N, Shavit N: Timing-based mutual exclusion. In: Proceedings of the 13th IEEE Real-Time Systems Symposium, pp 2–11, 1992

  15. Lynch NA: Fast allocation of nearby resources in a distributed system. In: Proceedings of the 12th Annual ACM Symposium on Theory of Computing, pp 70–81, 1980

  16. Merritt M, Taubenfeld G: Speeding Lamport's fast mutual exclusion algorithm. Inf Process Lett 45: 137–142 (1993)

    Google Scholar 

  17. Michael MM, Scott ML: Fast mutual exclusion, even with contention. Tech Rep TR 460, Computer Science Department, University of Rochester, 1993

  18. Peterson GL: A new solution to Lamport's concurrent programming problem using small shared variables. ACM Trans Program Languages Syst 5(1): 56–65 (1983)

    Google Scholar 

  19. Peterson GL, Fischer M: Economical solutions to the critical section problem in a distributed system. In: Proceedings of the 9th Annual ACM Symposium on Theory of Computing, pp 91–97, 1977

  20. Pnueli A: The temporal logic of programs. In: Proceedings of the 18th Annual IEEE Symposium on Foundations of Computer Science, pp 46–57, 1977

  21. Styer E: Improving fast mutual exclusion. In: Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, pp 159–168, 1992

  22. TUXEDO System Release 4.0 — Product Review. AT&T, 1990

  23. Yang J, Adderson JH: Fast, scalable synchronization with minimal hardware support. In: Proceedings of the Twelfth Annual ACM Symposium on Principles of Distributed Computing, pp 171–182, 1993

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of California at Santa Barbara, 93106, Santa Barbara, CA, USA

    Manhoi Choy & Ambuj K. Singh

Authors
  1. Manhoi Choy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ambuj K. Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Manhoi Choy was born in 1967 in Hong Kong. He received his B.Sc. in Electrical and Electronic Engineerings from the University of Hong Kong in 1989, and his M.Sc. in Computer Science from the University of California at Santa Barbara in 1991. Currently, he is working on his Ph.D. in Computer Science at the University of California at Santa Barbara. His research interests are in the areas of parallel and distributed systems, and distributed algorithms.

Ambuj K. Singh is an Assistant Professor in the Department of Computer Science at the University of California, Santa Barbara. He received a Ph.D. in Computer Science from the University of Texas at Austin in 1989, an M.S. in Computer Science from Iowa State University in 1984, and a B.Tech. from the Indian Institute of Technology at Kharagpur in 1982. His research interests are in the areas of adaptive resource allocation, concurrent program development, and distributed shared memory.

A preliminary version of the paper appeared in the 12th Annual ACM Symposium on Principles of Distributed Computing

Work supported in part by NSF grants CCR-9008628 and CCR-9223094

Rights and permissions

Reprints and permissions

About this article

Cite this article

Choy, M., Singh, A.K. Adaptive solutions to the mutual exclusion problem. Distrib Comput 8, 1–17 (1994). https://doi.org/10.1007/BF02283567

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02283567

Key words

Search

Navigation