Contention in shared memory algorithms

Journal of the ACM

Volumn 44, Issue 6, 1997, Pages 779-805

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

^a IBM   (United States)

^b BROWN UNIVERSITY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d Brown Univerity   (United States)

Author keywords

Algorithms; Contention; Counting networks; Mutual exclusion; Theory

Indexed keywords

COMPUTER ARCHITECTURE; CONCURRENCY CONTROL; DATA STORAGE EQUIPMENT; DATA STRUCTURES; MULTIPROCESSING SYSTEMS; STORAGE ALLOCATION (COMPUTER);

ASYNCHRONOUS SHARED MEMORY ALGORITHMS; FORMAL CONTENTION ANALYSIS; SHARED MEMORY MULTIPROCESSORS;

PARALLEL ALGORITHMS;

EID: 0031270779     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/268999.269000     Document Type: Article

References (50)

1. ABRAHAMSON, K. 1988. On achieving consensus using a shared memory. In Proceedings of the 7th ACM Symposium on Principles of Distributed Computing (Toronto, Ont., Canada, Aug. 15-17). ACM, New York, pp. 291-302.
2. AHARONSON, E., AND ATTIYA, H. 1992. Counting networks with arbitrary fan-out. In Proceedings of the 3rd ACM-SIAM Symposium on Discrete Algorithms (Orlando, Fla., Jan. 27-29). ACM, New York, pp. 104-113.
3. AIELLO, W., VENKATESAN, R., AND YUNG, M. 1994. Coins, weights and contention in balancing networks. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing (Los Angeles, Calif., Aug. 14-17). ACM, New York, pp. 193-205.
4. AJTAI, M., J. A., DWORK, C., AND WAARTS, O. 1994. A theory of competitive analysis for distributed algorithms. In Proceedings of the 35th IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 401-411.
5. ANDERSON, T. 1990. The performance of spin lock alternatives for shared-memory multiprocessors. IEEE Trans. Paral. Dist. Syst. 1, 1 (Jan.), 6-16.
6. ASPNES, J. 1990. Time- and space-efficient randomized consensus. In Proceedings of the 9th ACM Symposium on Principles of Distributed Computing (Quebec City, Que. Canada, Aug. 22-24). ACM, New York, pp. 325-332.
7. ASPNES, J., AND HERLIHY, M. 1990. Fast randomized consensus using shared memory. J. Algorithms 11, 3 (Sept.), 441-460.
8. ASPNES, J., HERLIHY, M., AND SHAVIT, N. 1991. Counting networks and multi-processor coordination. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (New Orleans, La., May 6-8). ACM, New York, pp. 348-358.
9. 2n) operations per processor. In Proceedings of the IEEE Symposium on Foundations of Computer Science. IEEE, New York.
10. ASPNES, J., AND WAARTS, O. 1996. Modular competitiveness for distributed algorithms. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing (Philadelphia, Pa., May 22-24). ACM, New York, pp. 237-246.
11. BATCHER, K. 1968. Sorting networks and their applications. In Proceedings of AFIPS Joint Computer Conference AFIPS Press, pp. 338-334.
12. BEN-DOR, A., ISRAELI, A., AND SHIRAZI, A. 1994. Dynamic counting. In Proceedings of the 3rd Israel Symposium on the Theory of Computing and Systems (June 1994).
13. BEN-OR, M. 1983. Another advantage of free choice: Completely asynchronous agreement protocols. In Proceedings of the 2nd Annual ACM Symposium on Principles of Distributed Computing (Montreal, Que., Canada, Aug. 17-19). ACM, New York, pp. 27-30.
14. BUSCH, C., HARDAVELLAS, N., AND MAVRONICOLAS, M. 1994. Contention in counting networks. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing (Los Angeles, Calif., Aug. 14-17). ACM, New York, p. 404.
15. BUSCH, C., AND MAVRONICOLAS, M. 1994. A depth-contention optimal counting network. Manuscript.
16. CHOR, B., ISRAELI, A., AND LI, M. 1987. On processor coordination using asynchronous hardware. In Proceedings of the 6th ACM Symposium on Principles of Distributed Computing, (Vancouver, B.C., Canada, Aug. 10-12). ACM, New York, pp. 86-97.
17. CHOY, M., AND SINGH, A. 1994. Adaptive solutions to the mutual exclusion problem. Dist. Comput. 8, 1, 1-17.
18. COOK, S., DWORK, C., AND REISCHUK, R. 1986. Upper and lower time bounds for parallel random access machines without simultaneous writes. SIAM J. Comput. 15, 1 (Feb.), 87-97.
19. CORMEN, T., LEISERSON, C., AND RIVEST, R. L. 1990. Introduction to Algorithms. MIT Press, Cambridge Mass.
20. CULLER, D., KARP, R., PATTERSON, D., SAHAY, A., SANTOS, E., SCHAUSER, K., SUBRAMONIAN, R., AND VON EICKEN, T. 1996. Logp: A practical model of parallel computation. Commun. ACM 39, 11, 78-85.
21. DIGITAL EQUIPMENT CORPORATION. 1992. The Alpha Architecture Handbook. Digital Press, Maynard, Mass.
22. DOLEV, D., DWORK, C., AND STOCKMEYER, L. 1987. On the minimal synchronism needed for distributed consensus. J. ACM 34, 1 (Jan.), 77-97.
23. DOWD, M., PERL, Y., RUDOLPH, L., AND SAKS, M. 1989. The periodic balanced sorting network. ACM Trans. Prog. Lang. Syst. 36, 4 (Oct.), 738-757.
24. DWORK, C., HERLIHY, M., PLOTKIN, S., AND WAARTS, O. 1992. Time-lapse snapshots. In Proceedings of the 1st Israel Symposium on the Theory of Computing and Systems.
25. DWORK, C., LYNCH, N., AND STOCKMEYER, L. 1988. Consensus in the presence of partial synchrony. J. ACM 35, 2 (April), 228-323.
26. DWORK, C., AND WAARTS, O. 1993. Randomized snapshot in linear time. Unpublished manuscript.
27. ELLIS, C., AND OLSON, T. 1988. Algorithms for parallel memory allocation. J. Paral. Prog. 17, 4 (Aug.), 303-345.
28. FISCHER, M., LYNCH, N., AND PATERSON, M. 1985. Impossibility of distributed commit with one faulty process. J. ACM 32, 2 (Apr.), 74-82.
29. GIBBONS, P., MATIAS, Y., AND RAMACHANDRAN, V. 1993. The queue-read queue-write PRAM model: accounting for contention in parallel algorithms. SIAM J. Comput., to appear.
30. GIBBONS, P., MATIAS, Y., AND RAMACHANDRAN, V. 1994. Efficient low-contention parallel algorithms. J. Comput. Syst. Sci. to appear.
31. GOODMAN, J., VERNON, M., AND WOEST, P. 1989. Efficient synchronization primitives for large-scale cache-coherent multiprocessors. In Proceedings of the 3rd International Conference on Architectural Support for Programming Languages and Operating Systems (Boston, Mass., Apr. 3-6). ACM, New York, pp. 64-75.
32. GOTTLIEB, A., GRISHMAN, R., KRUSKAL, C., MCAULIFFE, K., RUDOLPH, L., AND SNIR, M. 1984. The NYU ultracomputer-designing an MIMD parallel computer. IEEE Trans. Comput. C-32, 2 (Feb.), 175-189.
33. GOTTLIEB, A., LUBACHEVSKY, B., AND RUDOLPH, L. 1983. Basic techniques for the efficient coordination of very large numbers of cooperating sequential processors. ACM Trans. Prog. Lang. Syst. 5, 2 (Apr.), 164-189.
34. GRAUNKE, G., AND THAKKAR, S. 1990. Synchronization algorithms for shared-memory multiprocessors. IEEE Computer 23, 6 (June), 60-70.
35. HARDAVELLAS, N., KARAKOS, D., AND MAVRONICOLAS, M. 1993. Notes on sorting and counting networks. In Proceedings of the 7th International Workshop on Distributed Algorithms (WDAG). In Lecture Notes in Computer Science, Vol. 725. Springer-Verlag, New York, pp. 234-248.
36. HERLIHY, M. 1991. Wait-free synchronization. ACM Trans. Prog. Lang. Syst. 13, 1 (Jan.), 123-149.
37. HERLIHY, M., LIM, B.-H., AND SHAVIT, N. 1992. Low contention load balancing on large-scale multiprocessors. In Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (July 1992).
38. HERLIHY, M., SHAVIT, N., AND WAARTS, O. 1991. Low contention linearizable counting. In Proceedings of the IEEE Symposium on Foundations of Computer Science IEEE, New York.
39. IBM. System/370 principles of operation. Order Number GA22-7000.
40. KLUGERMAN, M., AND PLAXTON, C. 1992. Small-depth counting networks. In Proceedings of the 1992 ACM Symposium on Theory of Computing (Victoria, B.C., Canada, May 4-6). ACM, New York, pp. 417-427.
41. LI, M., TROMP, J., AND VITANYI, P. 1989. How to share concurrent wait-free variables. Tech. Rep. CS-R8916. CWI, Amsterdam.
42. LOUI, M., AND ABU-AMARA, H. 1987. Advances in Computing Research, Volume 4, Chapter Memory Requirements for Agreement Among Unreliable Asynchronous Processes. JAI Press, pp. 163-183.
43. MELLOR-CRUMMEY, J., AND SCOTT, M. 1990. Algorithms for scalable synchronization on shared-memory multiprocessors. Tech. Rep. 342 (April), University of Rochester, Rochester, N.Y.
44. METCALFE, R., AND BOGGS, D. 1976. Ethernet: distributed packet switching for local computer networks. Commun. ACM 19, 7 (July), 395-404.
45. MIPS COMPUTER COMPANY. The MIPS RISC architecture.
46. PFISTER, G., AND NORTON, A. 1985. 'hot spot' contention and combining in multistage interconnection networks. IEEE Transactions on Computers C-34, 11 (Nov.), 933-938.
47. RABIN, M. 1983. Randomized byzantine generals. In Proceedings of the 24th IEEE Symposium on Foundations of Computer Science (May). IEEE, New York. pp. 403-409.
48. RUDOLPH, L. 1983. Decentralized cache scheme for an MIMD parallel processor. In Proceedings of the 11th Annual Computing Architecture Conference, pp. 340-347.
49. SINGH, A., ANDERSON, J., AND GOUDA, M. 1987. The elusive atomic register revisited. In Proceedings of the 6th ACM Symposium on Principles of Distributed Computing (Vancouver, B.C., Canada, Aug. 10-12). ACM, New York, pp. 206-221.
50. YANG, J., AND ANDERSON, J. 1993. Fast, scalable synchronization with minimal hardware support. In Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing (Ithaca, N.Y., Aug. 15-18). ACM, New York, pp. 171-182.