The block distributed memory model

IEEE Transactions on Parallel and Distributed Systems

Volumn 7, Issue 8, 1996, Pages 830-840

  Jájá, Joseph F ^a   Ryu, Kwan Woo ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b Kyungpook National University   (South Korea)

Author keywords

Broadcasting; Fast fourier transform; Load balancing; Matrix multiplication; Parallel algorithms; Parallel model; Personalized communication; Sorting

Indexed keywords

BROADCASTING; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; FAST FOURIER TRANSFORMS; INFORMATION THEORY; PACKET SWITCHING; PARALLEL ALGORITHMS; PERSONAL COMMUNICATION SYSTEMS; SORTING; STORAGE ALLOCATION (COMPUTER);

BLOCK DISTRIBUTED MEMORY MODEL; LOAD BALANCING; MATRIX MULTIPLICATION; PARALLEL MODEL; PERSONALIZED COMMUNICATION;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0030216917     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.532114     Document Type: Article

References (30)

1. A. Aggarwal, A. Chandra, and M. Snir, "On Communication Latency in PRAM Computations," Proc. First ACM Symp. Parallel Algorithms and Architectures, pp. 11-21, June 1989.
2. A. Aggarwal, A.K. Chandra, and M. Snir, "Hierarchical Memory with Block Transfer," Proc. 28th Ann. Symp. Foundations of Computer Science, pp. 204-216, Oct. 1987.
3. A. Agarwal, B.-H. Lim, D. Kranzs, and J. Kubiatowicz, "APRIL: A Processor Architecture for Multiprocessing," Proc. 17th Ann. Int'l Symp. Computer Architecture, pp. 104-114, May 1990.
4. D. Bader, D. Helman, and J. JáJá, "Practical Parallel Algorithms for Personalized Communication and Integer Sorting," Tech. Report, UMIACS, Univ. of Maryland, College Park, MD, Nov. 1995.
5. D. Bader and J. JáJá, "Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study," Proc. Fifth ACM SIGPLAN Symp. Principles and Practice of Parallel Programming, pp. 123-133, Santa Barbara, Calif., July 1995.
6. D. Bader and J. JáJá, "Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection,́ Proc. Int'l Parallel Processing Symp., Apr. 1996.
7. D. Bader, J. JáJá, D. Harwood, and L. Davis, "Parallel Algorithms for Image Enhancement and Segmentation by Region Growing with an Experimental Study," Proc. Int'l Parallel Processing Symp., Apr. 1996.
8. A. Bar-Noy and S. Kipnis, "Designing Broadcasting Algorithms in the Postal Model for Message-Passing Systems," Proc. Fourth Symp. on Parallel Algorithms and Architectures, pp. 13-22, July 1992.
9. A. Bar-Noy and S. Kipnis, "Multiple Message Broadcasting in the Postal Model," Proc. Seventh Int'l Parallel Processing Symp., pp. 463-470, Apr. 1993.
10. G.E. Blelloch et. al., "A Comparison of Sorting Algorithms for the Connection Machine CM-2," Proc. Third Symp. Parallel Algorithms and Architectures, pp. 3-16, July 1991.
11. H. Burkhardt III, S. Frank, B. Knobe, and J. Rothnie, Overview of the KSRI Computer System. TR KSR_TR_9202001, Boston: Kendall Square Rescard, Feb. 1992.
12. D. Culler et. al., "PLogP: Toward a Realistic Model of Parallel Computation," Proc. Fourth ACM PPOPP, pp. 1-12, May 1993.
13. P.B. Gibbons, "Asynchronous PRAM Algorithms," a chapter in Synthesis of Parallel Algorithms. J.H. Reif, ed., Morgan-Kaufman, 1990.
14. A. Gupta and V. Kumar, "Scalability of Parallel Algorithms for the Matrix Multiplication," Proc. Int'l Conf. Parallel Processing, vol. III, pp. 115-123, 1993.
15. E. Hagersten, S. Haridi, and D. Warren, "The Cache-Coherence Protocol of the Data Diffusion Machine," M. Dubois and S. Thakkar, eds., Cache and Interconnect Architectures in Multiprocessors. Kluwer Academic Publishers, 1990.
16. S. Hambrusch and A. Khokhar, "Ĉ : An Architecture Independent Model for Coarse-Grained Parallel Machines," Proc. Sixth IEEE Symp. Parallel and Distributed Processing, pp. 554-551, 1994.
17. T. Heywood and S. Ranka, "A Practical Hierarchical Model of Parallel Computation," J. Parallel and Distributed Computing, vol. 16, pp. 212-249, 1992.
18. J. JáJá and K.W. Ryu, "Load Balancing and Routing on the Hypercube and Related Networks," J. Parallel and Distributed Computing vol. 14, pp. 431-435, 1992.
19. R.M. Karp, A. Sahay, E.E. Santos, and K.E. Schauser, "Optimal Broadcast and Summation in the LogP Model," Proc. Fifth Symp. Parallel Algorithms and Architectures, pp. 142-153, July 1993.
20. C.P. Kruskal, L. Rudolph, and M. Snir, "A Complexity Theory of Efficient Parallel Algorithms," Theoretical Computer Science 71, pp. 95-132, 1990.
21. T. Leighton, "Tight Bounds on the Complexity of Parallel Sorting," IEEE Trans. Computers, vol. 34, no. 4, pp. 344-354, Apr. 1985.
22. D. Lenoski et. al., The Stanford Dash Multiprocessor. IEEE Computer, vol. 25, no. 3, pp. 63-79, Mar. 1992.
23. C.V. Loan, "Computational Frameworks for the Fast Fourier Transform," J. SIAM, 1992.
24. J.M. Marberg and E. Gafni, "Sorting in Constant Number of Row and Column Phases on a Mesh," Algorithmica vol. 3, pp. 561-572, 1988.
25. K. Mehrotra, S. Ranka, and J.-C. Wang, "A Probabilistic Analysis of a Locality Maintaining Load Balancing Algorithm," Proc. Seventh Int'l Parallel Processing Symp., pp. 369-373, Apr. 1993.
26. S. Rajasekaran and T. Tsantilas, "Optimal Routing Algorithms for Mesh-connected Processor Arrays," Algorithmica, vol. 8, pp. 21-38, 1992.
27. K.W. Ryu and JáJá, "Efficient Algorithms for List Ranking and for Solving Graph Problems on the Hypercube," IEEE Trans. Parallel and Distributed Systems, vol. 1, no. 1, pp. 83-90, Jan. 1990.
28. H. Shi and J. Schaeffer, "Parallel Sorting by Regular Sampling," J. Parallel and Distributed Computing, vol. 14, pp. 361-372, 1992.
29. H.J. Siegel et. al., "Report of the Purdue Workshop in Grand Challenges in Computer Architecture for the Support of High Performance Computing," J. Parallel and Distributed Computing, vol. 16, no. 3, pp. 198-211, 1992.
30. L.G. Valiant, "A Bridging Model for Parallel Computation," J. CACM, vol. 33, no. 8, pp. 103-111, Aug. 1990.