Contention in shared memory algorithms

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129585, Issue , 1993, Pages 174-183

  Dwork, Cynthia ^a   Herlihy, Maurice ^b   Waarts, Orli ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b UK Cambridge Research Institute (CRI)   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; CONCURRENCY CONTROL; MULTIPROCESSING SYSTEMS; NETWORK ARCHITECTURE; ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; COMPUTER NETWORKS; MATHEMATICAL MODELS; STORAGE ALLOCATION (COMPUTER);

ASYNCHRONOUS SHARED MEMORY; COMPLEXITY MEASURES; COMPLEXITY MODELING; CONCURRENT ALGORITHMS; MEMORY CONSUMPTION; MULTI PROCESSOR ARCHITECTURE; PERFORMANCE ANALYSIS; SHARED MEMORY ALGORITHMS;

MEMORY ARCHITECTURE; DATA STORAGE EQUIPMENT;

ASYNCHRONOUS SHARED MEMORY ALGORITHMS; CONTENTION; LATENCY;

EID: 0027266209     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/167088.167145     Document Type: Conference Paper

References (37)

1. K. Abrahamson. On achieving consensus using a shared memory. In Proceedings of the 7th ACM Symposium on Principles of Distributed Computing, pages 291-302, August 1988.
2. E. Aharonson and H. Attiya. Counting networks with arbitrary fan-out. In Proceedings of the 3rd ACM-SIAM Symposium on Discrete Algorithms, January 1992.
3. T.E. Anderson. The performance of spin lock alternatives for shared-memory multiprocessors. IEEE Transactions on Parallel and Distributed Systems, 1(1):6-16, January 1990.
4. J. Aspnes. Time-And space-efficient randomized consensus. In Proceedings of the 9th ACM Symposium on Principles of Distributed Computing, pages 325-332, August 1990.
5. J. Aspnes and M.P. Herlihy. Fast randomized consensus using shared memory. Journal of Algorithms, 11(3):441-460, September 1990.
6. J. Aspnes, M.P. Herlihy, and N. Shavit. Counting networks and multi-processor coordination. In Proceedings of the 23rd Symposium on Theory of Computing, pages 348-358, May 1991.
7. J. Aspnes and O. Waarts. Randomized consensus in expected 0(n log2 n) operations per processor. In Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, pages 137-146, October 1992.
8. K.E. Batcher. Sorting networks and their applications. In Proceedings of A FIPS Joint Computer Conference, pages 338-334, 1968.
9. B. Chor, A. Israeli, and M. Li. On processor coordination using asynchronous hardware. In Proceedings of the 6th ACM Symposium on Principles of Distributed Computing, pages 86-97, 1987.
10. M. Choy and A.K. Singh. Adaptive solutions to the mutual exclusion problem. Manuscript.
11. MIPS Computer Company. The MIPS RISC architecture.
12. S. Cook, C. Dwork, and R. Reischuk. Upper and lower time bounds for parallel random access machines without simultaneous writes. SIAM Journal, 15(1), February 1986.
13. T.H. Cormen, C.E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge MA, 1990.
14. D.E. Culler, R.M. Karp, D.A. Patterson, A. Sahay, E. Santos, K.E. Schauser, R.M. Subramonian, and T. von Eicken. LogP: Towards a Realistic Model of Parallel Computation. In Proceedings of the 4th ACM SIGPLAN Symposium on Principles and Practices of Parallel Programming, May 1993.
15. D. Dolev, C. Dwork, and L. Stockmeyer. On the minimal synchronism needed for distributed consensus. Journal of the ACM, 34(1):77-97, January 1987.
16. C. Dwork, M.P. Herlihy, S.A. Plotkin, and O. Waarts. Time-lapse snapshots. In Proceedings of the 1st Israel Symposium on the theory of Computing and Systems, May 1992, pages 154-170, Lecture Notes in Computer Science #601, Springer-Verlag.
17. C. Dwork, N. Lynch, and L. Stockmeyer. Consensus in the presence of partial synchrony. Journal of the ACM, 35(2):228-323, April 1988.
18. C. Dwork and O. Waarts. Randomized Snapshot in Linear Time. Manuscript.
19. C.S. Ellis and T.J. Olson. Algorithms for parallel memory allocation. Journal of Parallel programming, 17(4):303-345, August 1988.
20. M. Fischer, N.A. Lynch, and M.S. Paterson. Impossibility of distributed commit with one faulty process. Journal of the ACM, 32(2), April 1985.
21. P.B. Gibbons, Y. Matias, and V. Ramachandran. QRQW: Accounting for concurrency in PRAMs and Asynchronous PRAMs. Technical Report, AT&T Bell Laboratories, Murray Hill, NJ, March 1993.
22. A. Gottlieb, R. Grishman, C.P. Kruskal, K.P. McAulifFe, L. Rudolph, and M. Snir. The NYU ultracomputer - designing an MIMD parallel computer. IEEE Transactions on Computers, C-32(2):175-189, February 1984.
23. A. Gottlieb, B.D. Lubachevsky, and L. Rudolph. Basic techniques for the efficient coordination of very large numbers of cooperating sequential processors. ACM Transactions on Programming Languages and Systems, 5(2): 164-189, April 1983.
24. G. Graunke and S. Thakkar. Synchronization algorithms for shared-memory multiprocessors. IEEE Computer, 23(6):60-70, June 1990.
25. M.P. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1):123-149, January 1991.
26. M.P. Herlihy, B-H. Lim, and N. Shavit. Low contention load balancing on large-scale multiprocessors. In Proceedings of the 3rd ACM Symposium on Parallel Algorithms and Architectures, July 1992.
27. M.P. Herlihy, N. Shavit, and O. Waarts. Low contention linearizable counting. In Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, pages 526-535, October 1991.
28. IBM. System/370 principles of operation. Order Number GA22-7000.
29. M. Klugerman and C.G. Plaxton. Small-depth counting networks. In Proceedings of the 24th ACM Symposium on the Theory of Computing, pages 417-427, May 1992.
30. M. Li, J. Tromp, and P.M.B. Vitanyi. How to share concurrent wait-free variables. CWI Technical Report CS-R8916, 1989.
31. M.C. Loui and H.H. Abu-Amara. Memory Requirements for Agreement Among Unreliable Asynchronous Processes, volume 4, pages 163-183. JAI Press, 1987.
32. J.M. Mellor-Crummey and M.L. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. Technical Report 342, University of Rochester, Rochester, NY 14627, April 1990.
33. R. Metcalfe and D. Boggs. Ethernet: distributed packet switching for local computer networks. Communications of the ACM, 19(7):395-404, July 1976.
34. G.H. Pfister and A. Norton. 'Hot spot' contention and combining in multistage interconnection networks. IEEE Transactions on Computers, C-34(11):933-938, November 1985.
35. L. Rudolph and Z. Segall. Dynamic decentralized cache schemes for MIMD parallel processors. In 11th Annual International Symposium on Computer Architecture, pages 340-347, June 1984.
36. A.K. Singh, J.H. Anderson, and M.G. Gouda. The elusive atomic register revisited. In Proceedings of the 6th ACM Symposium on Principles of Distributed Computing, pages 206-221, August 1987.
37. R.L. Sites. Alpha Architecture Reference Manual. Digital Press, Maynard, MA, 1992.