Skip to main content
Springer Nature Link
Log in

Coping with contention

Extended abstract

  • Conference paper
  • First Online:
Distributed Algorithms (WDAG 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 857))

Included in the following conference series:

  • 128 Accesses

Abstract

Contention in multiprocessor systems is considered. A randomized algorithm for mutual exclusion is presented that achieves a constant average response time under varying degrees of contention. The use of randomization does not affect the safety or progress conditions, only the performance of the algorithm.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Abrahamson. On achieving consensus using a shared memory. In Proceedings of the 7th Annual ACM Symposium on the Principles of Distributed Computing, pages 291–302, 1988.

    Google Scholar 

  2. Y. Afek, E. Gafni, Tromp J., and Vitanyi P. Wait-free test-and-set. In Proceedings of the 6th International Workshop on Distributed Algorithms, pages 85–94, 1992.

    Google Scholar 

  3. T. E. Anderson. The performance of spin-lock alternatives for sharedmemory multiprocessors. IEEE Transactions on Parallel and Distributed Systems, 1(1):6–16, 1990.

    Article  Google Scholar 

  4. J. Aspnes and M. Herlihy. Fast randomized consensus using shared memory. Journal of Algorithms, 11(3):441–461, 1990.

    Article  Google Scholar 

  5. J. Aspnes, M. Herlihy, and N. Shavit. Counting networks and multiprocessor coordination. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991.

    Google Scholar 

  6. M. Choy and A. K. Singh. Adaptive solutions to the mutual exclusion problem. In Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing, August 1993.

    Google Scholar 

  7. E. W. Dijkstra. Solution of a problem in concurrent program control. Communications of the ACM, 8(9):569, Sept. 1965.

    Article  Google Scholar 

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

    Google Scholar 

  9. P. B. Gibbons, Y. Matias, and V. Ramachandran. The QRQW PRAM: Accounting for contention in parallel algorithms. In Proceedings of Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 638–648, 1994.

    Google Scholar 

  10. A. Gottlieb, R. Grishman, C. P. Kruskal, K. M. McAuliffe, L. Rudolph, and M. Snir. The NYU ultracomputer — designing an mimd shared memory parallel computer. IEEE Transactions on Computers, C-32(2), 1983.

    Google Scholar 

  11. M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1):124–149, 1991.

    Article  Google Scholar 

  12. M. Herlihy, B. H. Lim, and N. Shavit. Low contention load balancing on large-scale multiprocessors. In Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1992.

    Google Scholar 

  13. J. M. Mellor-Crummey and M. S. Scott. Synchronization without contention. In Proceedings of the 4th International Conference on Architectural Support for Programming Languages and Systems, pages 269–278, April 1991.

    Google Scholar 

  14. Shavit N. and Zemach A. Diffracting trees. In Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 167–176, 1994.

    Google Scholar 

  15. M. Rabin. The choice coordination problem. Acta Informatica, 17:121–134, 1982.

    Article  Google Scholar 

  16. M. Rabin and D. Lehmann. On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem. In Proceedings of the 8th Annual ACM Symposium on the Principles of Programming Languages, pages 133–138, 1981.

    Google Scholar 

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

    Google Scholar 

  18. J. Yang and J. H. Adderson. Fast, scalable synchronization with minimal hardware support. In Proceedings of the Twelfth Annual ACM Symposium on Principles of Distributed Computing, pages 171–182, 1993.

    Google Scholar 

  19. J. Yang and J. H. Adderson. Time bounds for mutual exclusion and related problems. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    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

Editor information

Gerard Tel Paul Vitányi

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Choy, M., Singh, A.K. (1994). Coping with contention. In: Tel, G., Vitányi, P. (eds) Distributed Algorithms. WDAG 1994. Lecture Notes in Computer Science, vol 857. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020426

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58449-0

  • Online ISBN: 978-3-540-48799-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation