C3: A parallel model for coarse-grained machines

Journal of Parallel and Distributed Computing

Volumn 32, Issue 2, 1996, Pages 139-154

  Hambrusch, Susanne E ^a   Khokhar, Ashfaq A ^b  

^a Purdue University   (United States)

^b UNIVERSITY OF DELAWARE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030077642     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1996.0010     Document Type: Article

References (25)

1. 1. V. Bala, J. Bruck, R. Cypher, P. Elustondo, A. Ho, C.-T. Ho, S. Kipnis, and M. Snir. CCL: A portable and tunable collective communication library for scalable parallel computers. Proc. 8th International Parallel Processing Symposium 1994, pp. 835-844.
2. 2. M. Barnett, R. Littlefield, D. G. Payne, and R. van de Geijn. Global combine on meshes architectures with wormhole routing. Proc. 7th International Parallel Processing Symposium. 1993, pp. 156-162.
3. 3. A. Bar-Noy and S. Kipnis. Designing broadcasting algorithms in the postal model for message-passing systems. Proc. 4th ACM Symposium on Parallel Algorithms and Architectures. 1992, pp. 13-22.
4. 4. S. H. Bokhari. Multiphase complete exchange on a circuit switched hypercube. Proc. 1991 International Conference on Parallel Processing. 1991, pp. 525-529.
5. 5. L. T. Chen, L. S. Davis, and C. P. Kruskal. Efficient parallel processing of image contours. IEEE Trans. Pattern Anal. Machine Intell. 15, (1993), 69-81.
6. 6. 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. Proc. 4th ACM SIGPLAN Symposium on Principles and Practices of Parallel Programming. 1993, pp. 1-12.
7. 7. R. Cypher and E. Leu. The semantics of blocking and nonblocking send and receive primitives. Technical Report, IBM Almaden Research Division, 1993.
8. 8. J. J. Dongarra, R. Hempel, A. J. G. Hey, and D. W. Walker. A proposal for a user-level, message passing interface in a distributed memory environment. Technical Report TM 12231, Oak Ridge National Laboratory, 1993.
9. 9. C. Dwork, M. Herlihy, and O. Waarts. Contention in shared memory algorithms. Proc. 25th ACM STOC. 1993, pp. 174-183.
10. 10. P. B. Gibbons. A More Practical PRAM Model. Proc. 1989 ACM Symposium on Parallel Algorithms and Architectures. 1989, pp. 158-168.
11. 11. S. E. Hambrusch, F. Hameed, and A. Khokhar. Communication operations on coarse-grained architectures, Parallel Comput. 21, 731-751, 1995.
12. 12. F. Hameed, S. E. Hambrusch, A. Khokhar, and J. Patel. Contour ranking on coarse-grained machines: A case study for low-level vision computations. Technical Report, Purdue University, Nov. 1994.
13. 13. T. Heywood and S. Ranka. A practical hierarchical model of parallel computation: I. the model. J. Parallel Distrib. Comput. 16, (1992), 212-232.
14. 14. K. Hwang. Advanced Computer Architecture with Parallel Programming. McGraw-Hill, New York, 1993.
15. 15. S. L. Johnsson and C.-T. Ho. Optimum broadcasting and personalized communication in hypercubes. IEEE Trans. Comput. 38, (1989), 1249-1268.
16. 16. M. H. Kim and O. H. Ibarra. Transformations between boundary codes, run length codes, and linear quadtrees. Proc. 8th International Parallel Processing Symposium. 1994, pp. 120-125.
17. 17. P. Liu, W. Aiello, and S. Bhatt. An atomic model for message passing. Proc. 5th ACM Symposium on Parallel Algorithms and Architectures. 1993, pp. 154-163.
18. 18. G. Papadopoulos. Constant factors matter: Putting communication on the computation power curve. Proc. DIMACS Workshop on Model, Architectures, and Technologies for Parallel Computation. 1993.
19. 19. R. Ponnusamy, A. Choudhary, and G. Fox. Communication overhead on CM5: An experimental performance evaluation. Proc. 4th Symposium on the Frontiers of Massively Parallel Computation. 1992, pp. 108-115.
20. 20. H. Samet. Applications of Spatial Data Structures, Computer Graphics, and Image Processing. Addison-Wesley, Reading, MA, 1990.
21. 21. D. S. Scott. Efficient all-to-all communication patterns in hypercube and mesh topologies. Proc. 6th Distributed Memory Computing Conference. 1991, pp. 398-403.
22. 22. R. Thakur and A. Choudhary. All-to-all communication on meshes with wormhole routing. Proc. 8th International Parallel Processing Symposium. 1994, pp. 561-565.
23. 23. P. de la Torre and C. P. Kruskal. Towards a single model of efficient computation in real parallel machines. Future Gen. Comput. Syst. 8, (1992), 395-408.
24. 24. L. G. Valiant. A bridging model for parallel computation. Comm. ACM 33, 8 (1990), 103-111.
25. 25. D. S. Wills and W. Dally, Pi: A parallel architecture interface. Proc. 4th Symposium on the Frontiers of Massively Parallel Computation. (1992), pp. 345-352.