What good are shared-memory models?

Proceedings of the International Conference on Parallel Processing Workshops

Volumn , Issue , 1996, Pages 103-114

  Gibbons, Phillip B ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; DECISION SUPPORT SYSTEMS; MESSAGE PASSING;

DECISION SUPPORTS; DESIGN AND ANALYSIS OF PARALLEL ALGORITHMS; DISTRIBUTED MEMORY; FUTURE MODELS; LARGE-SCALE DATA ANALYSIS; LIMITED COMMUNICATION; PARALLEL MACHINE; SHARED MEMORY MODEL;

MEMORY ARCHITECTURE;

EID: 84966610563     PISSN: 15302016     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPPW.1996.538596     Document Type: Conference Paper

References (62)

1. A. Aggarwal, A. K. Chandra, and M. Snir. On communication latency in PRAM computations. In Proc. 1st ACM Symp. on Parallel Algorithms and Architectures, pages 11-21, June 1989.
2. A. Aggarwal, A. K. Chandra, andM. Snir. Communication complexity of PRAMs. Theoretical Computer Science, 71(l):3-28, 1990.
3. A. Alexandrov, M. F. Ionescu, K. E. Schauser, and C. Sheiman. LogGP: Incorporating long messages into the LogP model-one step closer towards a realistic model for parallel computation. In Proc. 7th ACM Symp. on Parallel Algorithms and Architectures, pages 95-105, July 1995.
4. B. Alpern, L. Carter, and E. Feig. Uniform memory hierarchies. In Proc. 31 st IEEE Symp. on Foundations of Computer Science, pages 600-608, October 1990.
5. R. J. Anderson and G. L. Miller. Optical communication for pointer based algorithms. Technical Report CRI 88-14, Computer Science Department, University of Southern California, Los Angeles, CA, 1988.
6. Y. Aumann and M. O. Rabin. Clock construction in fully asynchronous parallel systems and PRAM simulation. In Proc. 3 3rd IEEE Symp. on Foundations of Computer Science, pages 147-156, October 1992.
7. D. H. Bailey, E. Barszcz, L. Dagum, and H. D. Simon. NAS parallel benchmark results 10-94. Technical Report NAS-94-001, NASA Ames Research Center, October 1994.
8. A. Bar-Noy, J. Bruck, C. T. Ho, S. Kipnis, and B. Schieber. Computing global combine operationsin the multi-port postal model. In Proc. 5th IEEE Symp. on Parallel and Distributed Processing, pages 336-343, December 1993.
9. A. Bar-Noy and S. Kipnis. Designing broadcasting algorithms in the postal model for message-passing systems. In Proc. 4th ACM Symp. on Parallel Algorithms and Architectures, pages 13-22, June-July 1992.
10. G. E. Blelloch. Vector Models for Data-Parallel Computing. The MIT Press, Cambridge, MA, 1990.
11. G. E. Blelloch. Programming parallel algorithms. Communications of the ACM, 39(3):85-97, 1996.
12. G. E. Blelloch, P. B. Gibbons, Y. Matias, and M. Za-gha. Accounting for memory bank contention and delay in high-bandwidth multiprocessors. In Proc. 7th ACM Symp. on Parallel Algorithms and Architectures, pages 84-94, July 1995.
13. G. E. Blelloch, C. E. Leiserson, B. M. Maggs, C. G. Plaxton, S. J. Smith, and M. Zagha. A comparison of sorting algorithms for the Connection Machine CM-2. In Proc. 3rd ACM Symp. on Parallel Algorithms and Architectures, pages 3-16, July 1991.
14. Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamas-sia, D. E. Vengroff, and J. S. Vitter. External-memory graph algorithms. In Proc. 6th ACM-SIAM Symp. on Discrete Algorithms, pages 139-149, January 1995.
15. R. Cole and O. Zajicek. The APRAM: Incorporating asynchrony into the PRAM model. In Proc. 1st ACM Symp. on Parallel Algorithms and Architectures, pages 169-178, June 1989.
16. R. Cole and O. Zajicek. The expected advantage of asynchrony. In Proc. 2nd ACM Symp. on Parallel Algorithms and Architectures, pages 85-94, July 1990.
17. D. Culler, R. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, and T. von Eicken. LogP: Towards a realistic model of parallel computation. In Proc. 4th ACM SIGPLAN Symp. on Principles and Practices of Parallel Programming, pages 1-12, May 1993.
18. R. Cypher and S. Konstantinidou. Bounds on the efficiency of message-passing protocols for parallel computers. In Proc. 5th ACM Symp. on Parallel Algorithms and Architectures, pages 173-181, June-July 1993.
19. A. Czumaj, Z. Galil, L. Gasieniec, K. Park, and W. Plandowski. Wbrk-time-optimal parallel algorithms for string problems. In Proc. 27th ACM Symp. on the Theory of Computing, pages 713-722, May-June 1995.
20. P. de la Torre and C. P. Kruskal. Towards a single model of efficient computation in real parallel machines. Future Generation Computer Systems, 8:395-408, 1992.
21. C. Dwork, M. Herlihy, and O. Waarts. Contention in shared memory algorithms. In Proc. 25th ACM Symp. on Theory of Computing, pages 174-183, May 1993.
22. S. Fortune and J. Wyllie. Parallelism in random access machines. In Proc. 10th ACM Symp. on Theory of Computing, pages 114-118, May 1978.
23. A. V. Gerbessiotis and L. Valiant. Direct bulk-synchronous parallel algorithms. Journal of Parallel and Distributed Computing, 22:251-267, 1994.
24. K. Gharachorloo, D. Lenoski, J. Laudon, P. Gibbons, A. Gupta, and J. Hennessy. Memory consistency and event ordering in scalable shared-memory multiprocessors. In Proc. 17th International Symp. on Computer Architecture, pages 15-26, May 1990.
25. P. B. Gibbons. A more practical PRAM model. In Proc. 1st ACM Symp. on Parallel Algorithms and Architectures, pages 158-168, June 1989.
26. Full version in The Asynchronous PRAM: A semi-synchronous model for shared memory MIMD machines, PhD thesis, U.C. Berkeley 1989.
27. P. B. Gibbons. Models of parallel computation: An overview, September 1993. Invited talk, DIMACS Workshop on Models, Architectures, and Technologies for Parallel Computation.
28. P. B. Gibbons and Y. Matias. The Queuing Shared Memory model, 1996. Manuscript.
29. P. B. Gibbons, Y. Matias, and V. Ramachandran. Efficient low-contention parallel algorithms. Journal of Computer and System Sciences, 1996. To appear.
30. Preliminary version appears in Proc. 6th ACM Symp. on Parallel Algorithms and Architectures, pages 236-247, June 1994.
31. P. B. Gibbons, Y. Matias, and V. Ramachandran. The Queue-Read Queue-Write Asynchronous PRAM model. Technical report, Bell Labs, Murray Hill, NJ, 1996.
32. Preliminary version appears in QRQW: Accounting for Concurrency in PRAMs and Asynchronous PRAMs, AT&T Bell Laboratories Technical Report, March 1993.
33. P. B. Gibbons, Y. Matias, and V. Ramachandran. The Queue-Read Queue-Write PRAM model: Accounting for contention in parallel algorithms. SIAM Journal on Computing, 1996. To appear.
34. Preliminary version appears in Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, pages 638-648, January 1994.
35. J. Greiner. A comparison of data-parallel algorithms for connected components. In Proc. 6th ACM Symp. on Parallel Algorithms and Architectures, pages 16-25, June 1994.
36. S. Hambrusch and A. Khokhar. C3: An architecture-independent model for coarse-grained parallel machines. In Proc. 6th IEEE Symp. on Parallel and Distributed Processing, pages 544-551, 1994.
37. J. Hennessy and D. Patterson. Computer Architecture: A Quantitative Approach. Morgan Kaufmann, San Mateo, CA, 1990.
38. T. Hey wood and S. Ranka. A practical hierarchical model of parallel computation: I. The model. Journal of Parallel and Distributed Computing, 16:212-232, 1992.
39. J. JaJa. An Introduction to Parallel Algorithms. Addison-Wesley, Reading, MA, 1992.
40. J. JaJa and K. W. Ryu. The Block Distributed Memory model. Technical Report UMIACS-TR-94-5, University of Maryland Institute for Advanced Computer Studies, College Park, MD, January 1994.
41. R. Karp, A. Sahay, E. Santos, and K.E. Schauser. Optimal broadfcast and summation in the LogP model. In Proc. 5th ACM Symp. on Parallel Algorithms and Architectures, pages 142-153, June-July 1993.
42. R. M. Karp and V. Ramachandran. Parallel algorithms for shared-memory machines. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume A, pages 869-941. Elsevier Science Publishers B.V., Amsterdam, The Netherlands, 1990.
43. Z. M. Kedem, K. V. Palem, M. O. Rabin, and A. Raghunathan. Efficient program transformations for resilient parallel computation via randomization. In Proc. 24th ACM Symp. on Theory of Computing, pages 306-317, May 1992.
44. C. P. Kruskal, L. Rudolph, and M. Snir. A complexity theory of efficient parallel algorithms. Theoretical Computer Science, 71:95-132, 1990.
45. F. T. Leighton. Introduction to Parallel Algorithms and Architectures: ArraysTreesHypercubes. Morgan Kaufmann, San Mateo, CA, 1992.
46. F. T. Leighton. Methods for message routing in parallel machines. In Proc. 24th ACM Symp. on Theory of Computing, pages 77-96, May 1992. Invited paper.
47. C. E. Leiserson and B. M. Maggs. Communication-efficient parallel algorithms for distributed random-access machines. Algorithmica, 3(l):53-77, 1988.
48. P. Liu, W. Aiello, and S. Bhatt. An atomic model for message-passing. InProc. 5thACMSymp. on Parallel Algorithms and Architectures, pages 154-163, June-July 1993.
49. B. M. Maggs, L. R. Matheson, and R. E. Tarjan. Models of parallel computation: A survey and synthesis. In Proc. 28th Hawaii International Conf. on System Sciences, pages II: 61-70, January 1995.
50. Y. Mansour, N. Nisan, and U. Vishkin. Trade-offs between communication throughput and parallel time. In Proc. 26th ACM Symp. on Theory of Computing, pages 372-381, 1994.
51. C. Mattel, A. Park, and R. Subramonian. Work-optimal asynchronous algorithms for shared memory parallel computers. SIAM Journal on Computing, 21(6): 1070-1099, 1992.
52. K. Mehlhorn and U. Vishkin. Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories. Acta Informatica, 21:339-374, 1984.
53. N. Nishimura. Asynchronous shared memory parallel computation. In Proc. 2nd ACM Symp. on Parallel Algorithms and Architectures, pages 76-84, July 1990.
54. M. H. Nodine and J. S. Vitter. Large-scale sorting in parallel memories. In Proc. 3rd ACM Symp. on Parallel Algorithms and Architectures, pages 29-39, July 1991.
55. J. H. Reif, editor. A Synthesis of Parallel Algorithms. Morgan-Kaufmann, San Mateo, CA, 1993.
56. J. H. Reif and S. Sen. Randomized algorithms for binary search and load balancing on fixed connection networks with geometric applications. In Proc. 2nd ACM Symp. on Parallel Algorithms and Architectures, pages 327-337, July 1990.
57. B. Smith. Invited lecture, 7th ACM Symp. on Parallel Algorithms and Architectures, July 1995.
58. P. Stenstrom, T. Joe, and A. Gupta. Comparative performance evaluation of cache-coherent NUMA and COMA architectures. In Proc. 19th International Symp. on Computer Architecture, pages 80-91, May 1992.
59. L. G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8): 103-111, 1990.
60. U. Vishkin.A parallel-design distributed-implementation (PDDI) general purpose computer. Theoretical Computer Science, 32:157-172, 1984.
61. J. S. Vitter and E. A. M. Shriver. Optimal disk I/O with parallel block transfer. InProc. 22nd ACM Symp. on Theory of Computing, pages 159-169, May 1990.
62. M. Zagha and G. E. Blelloch. Radix sort for vector multiprocessors. In Proceedings Supercomputing '91, pages 712-721, November 1991.