CCL: A Portable and Tunable Collective Communication Library for Scalable Parallel Computers

IEEE Transactions on Parallel and Distributed Systems

Volumn 6, Issue 2, 1995, Pages 154-164

  Bala, Vasanth ^a   Bruck, Jehoshua ^b   Ho, Alex ^c   Ho, Ching Tien ^c   Cypher, Robert ^d   Elustondo, Pablo ^e   Kipnis, Shlomo ^f   Snir, Marc ^g  

^a HEWLETT PACKARD LABORATORIES   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^c IBM ALMADEN RESEARCH CENTER   (United States)

^d Computer Science Department University ^*  (United States)

^e SilverGate Team   (Argentina)

^f IBM HAIFA RESEARCH LAB   (Israel)

^g IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Collective communication algorithms; collective communication semantics; message passing parallel systems; portable library; process group; tunable algorithms

Indexed keywords

ALGORITHMS; COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING; COMPUTER SOFTWARE PORTABILITY; PERSONAL COMMUNICATION SYSTEMS; SYNCHRONIZATION; USER INTERFACES;

COLLECTIVE COMMUNICATION LIBRARY; COLLECTIVE COMMUNICATION SEMANTICS; MESSAGE PASSING PARALLEL SYSTEMS; PORTABLE LIBRARY; SCALABLE PARALLEL COMPUTERS;

PARALLEL PROCESSING SYSTEMS;

EID: 0029250755     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.342126     Document Type: Article

References (39)

1. A. Aggarwal and S. Kipnis, “Message-time tradeoff for combining data in message-passing systems,” IBM Res. Rep. RC-18349, Sept. 1992.
2. Y. Amir, D. Dolev, S. Kramer, and D. Malki, “Transis: A communication sub-system for high availability,” in Proc. 22nd Ann Int Symp Fault-Tolerant Computing, July 1992, 76-84.
3. V. Bala and S. Kipnis, “Efficient collective communication over dynamically determined sets of processors in massively parallel computers,” IBM Res. Rep. RC-17771, Mar. 1992.
4. “Process groups: A mechanism for the coordination of and communication among processes in the Venus collective communication library,” in Proc. 7th Int Parallel Processing Symp, Apr. 1993.
5. A. Bar-Noy and S. Kipnis, “Designing broadcasting algorithms in the postal model for message-passing systems,” in Proc. 4th Ann ACM Symp Parallel Algorithms, Architectures, June 1992, 11-22.
6. “Broadcasting multiple messages in simultaneous send/receive systems,” in Proc. 5th IEEE Symp Parallel, Distributed Processing, Dec. 1993.
7. A. Bar-Noy, S. Kipnis, and B. Schieber, “An optimal algorithm for computing census functions in message-passing systems,” Parallel Processing Lett., vol. 3, no. 1, Mar. 1993.
8. A. Beguelin, et al, “A user's guide to PVM Parallel Virtual Machine,” ORNL Tech. Rep. ORNL/TM-11826, May 1992.
9. K. Birman et al., “The ISIS system manual,” Department of Computer Science, Cornell University, Ithaca, NY, Sept. 1990.
10. J. Bruck et al., “Survey of routing issues for the Vulcan parallel computer,” IBM Res. Rep. RJ-8839, June 1992.
11. J. Bruck et al., “A proposal for common group structures in a collective communication library,” IBM Res. Rep. RJ-9421, Mar. 1993.
12. J. Bruck, R. Cypher, and C. T. Ho, “Efficient fault-tolerant mesh and hypercubes architectures,” in Proc. 1992 Int. Symp. Fault-Tolerant Computing, pp. 162-169.
13. J. Bruck, R. Cypher, and C. T. Ho, “Multiple message broadcasting with generalized Fibonacci trees,” in Proc. 4th IEEE Symp. Parallel, Distributed Processing, Dec. 1992, 424-431.
14. J. Bruck, C. T. Ho, and S. Kipnis, “Concatenating data optimally in message-passing systems,” IBM Res. Rep. RJ-9191, Jan. 1993.
15. J. Bruck, R. Cypher, C. T. Ho, and S. Kipnis, “Efficient algorithms for the index operation in message-passing systems,” IBM Res. Rep. RJ-9300, Apr. 1993.
16. N. Carriero and D. Gelernter, “Linda in context,” Commun. ACM, vol. 32, no. 4, pp. 444-458, Apr. 1989.
17. D. R. Cheriton and W. Zwaenpoel, “Distributed process groups in the V kernel,” ACM Trans. Comput. Syst., vol. 2, no. 3, pp. 77-107, May 1985.
18. D. Culler et al, “LogP: Towards a realistic model of parallel computation,” in Proc. 4th SIGPLAN Symp. Principles, Practices of Parallel Programming, ACM, May 1993.
19. R. Cypher and E. Leu, “Message-passing semantics and portable parallel programs,” IBM Res. Rep. RJ-9654, Jan. 1994.
20. W. J. Dally et al., “The J-machine: A fine-grain concurrent computer,” in Proc. Inform. Processing 89, 1989, pp. 1147-1153.
21. Document for a Standard Message-Passing Interface, Message Passing Interface Tech. CS-93-214, Univ. Nov. 1993.
22. J. Dongarra, R. Hempel, A. Hey, and D. Walker, “A proposal for a user-level, message-passing interface in a distributed memory environment,” ORNL Tech. Rep. ORNL/TM-12231, Oct. 1992.
23. S. Dutt and J. P. Hayes, “Designing fault-tolerant systems using automorphisms,” J. Parallel. Distrib. Computing, vol. 12, pp. 249-268, 1991.
24. B. Elspas and J. Turner, “Graphs with circulant adjacency matrices,” J. Combinatorial Theory, no. 9, pp. 297-307, 1970.
25. B. G. Fitch and M. E. Giampapa, “The Vulcan operation environment: A brief overview and status report,” in Proc. 5th Workshop Use Parallel Processors Meteorology, ECMWF, Nov. 1992.
26. G. Fox and W. Furmanski, “Optimal communication algorithms for regular decompositions on the hypercube,” in Proc. 3rd Conf. Hypercube Concurrent Comput. Applicat., ACM, pp. 648-713, 1988.
27. G. Fox et al, Solving Problems on Concurrent Processors, Volume I: General Techniques and Regular Problems. Englewood Cliffs, NJ: Prentice-Hall, 1988.
28. D. Frye et al., “An external user interface for scalable parallel systems: FORTRAN interface,” Tech. Rep., IBM Highly Parallel Supercomputing Systems Laboratory, Nov. 1992.
29. G. A. Geist, M. T. Heath, B. W. Peyton, and P. H. Worley, “A user's guide to PICL: A portable instrumented communication library,” ORNL Tech. Rep. ORNL/TM-11616, Oct. 1990.
30. M. E. Giampapa, B. G. Fitch, G. R. Irwin, and D. G. Shea, “Vulcan operating environment: Programmer's reference,” Intern. Memorandum, IBM T. J. Watson Research Center, Yorktown Heights, NY, Mar. 1991.
31. R. Hempel, “The ANL/GMD macros (PARMACS) in FORTRAN for portable parallel programming using the message passing programming model, user's guide and reference manual,” Tech. Memorandum, Gesellschaft fur Mathematik und Datenverabeitung mbH, West Germany.
32. C. T. Ho, “Optimal broadcasting on SIMD hypercubes without indirect addressing capability,” J. Parallel, Distrib. Computing, vol. 13, no. 2, pp. 246-255, Oct. 1991.
33. S. L. Johnsson and C. T. Ho, “Spanning graphs for optimum broadcasting and personalized communication in hypercubes,” IEEE Trans. Comput., vol. 38, no. 9, 1249-1268, Sept. 1989.
34. J. F. Palmer, “The NCUBE family of parallel supercomputers,” in Proc. Int. Conf. Comput. Design, IEEE, 1986.
35. A. Skjellum and A. P. Leung, “Zipcode: A portable multicomputer communication library atop the Reactive Kernel,” in Proc. 5th Distrib. Memory Computing Conf, IEEE, Apr. 1990, pp. 328-337.
36. Connection Machine CM-5 Tech. Summary, Thinking Machines Corporation, 1991.
37. Express 3.0 Introductory Guide, Parasoft Corporation, 1990.
38. Paragon XP/S Overview, Intel Corporation, 1991.
39. “Vulcan system summary,” Int. Memorandum, IBM T. J. Watson Research Center, Yorktown Heights, NY.