Advertisement

Coping with contention

Extended abstract
  • Manhoi Choy
  • Ambuj K. Singh
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 857)

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.

Keywords

leader election multiprocessor systems mutual exclusion randomization synchronization 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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. [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. [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.CrossRefGoogle Scholar
  4. [4]
    J. Aspnes and M. Herlihy. Fast randomized consensus using shared memory. Journal of Algorithms, 11(3):441–461, 1990.CrossRefGoogle Scholar
  5. [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. [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. [7]
    E. W. Dijkstra. Solution of a problem in concurrent program control. Communications of the ACM, 8(9):569, Sept. 1965.CrossRefGoogle Scholar
  8. [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. [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. [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. [11]
    M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1):124–149, 1991.CrossRefGoogle Scholar
  12. [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. [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. [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. [15]
    M. Rabin. The choice coordination problem. Acta Informatica, 17:121–134, 1982.CrossRefGoogle Scholar
  16. [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. [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. [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. [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

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Manhoi Choy
    • 1
  • Ambuj K. Singh
    • 1
  1. 1.Department of Computer ScienceUniversity of California at Santa BarbaraSanta Barbara

Personalised recommendations