The dance party problem and its application to collective communication in computer networks

Parallel Computing

Volumn 23, Issue 8, 1997, Pages 1141-1156

  Wang, Xin ^a,c   Blum, Edward K ^b,c   Parker, D Stott ^a   Massey, Daniel ^a  

^a University of California   (United States)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^c Compbionics Inc ^*  (United States)

Author keywords

Collective communication; Divide and conquer; IBM SP2; Message passing; Optimal schedule; SUN SPARC 10; Workstation cluster

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; COMPUTER WORKSTATIONS; PROBLEM SOLVING; STORAGE ALLOCATION (COMPUTER);

COLLECTIVE COMMUNICATION; DANCE PARTY PROBLEM; DIVIDE AND CONQUER ALGORITHM; WORKSTATION CLUSTER;

DATA COMMUNICATION SYSTEMS;

EID: 0031207529     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-8191(97)00041-0     Document Type: Article

References (31)

1. D.H. Bailey, T. Harris, W. Saphir, R. van der Wijngaart, A. Woo, M. Yarrow, The NAS parallel benchmarks 2.0, Report NAS-95-020, NASA Ames Research Center, Dec. 1995. See also the WWW page at http://www.nas.nasa.gov/NAS/NPB/.
2. V. Bala, J. Bruck, R. Cypher, P. Elustondo, A. Ho, C.-T. Ho, S. Kipnis, M. Snir, CCL: A portable and tunable collective communication library for scalable parallel computers, IEEE Trans. Parallel Distrib. Syst. 6 (2) (1995) 154-164.
3. M. Barnett, S. Gupta, D. Payne, L. Shuler, R. van de Geijn, J. Watts, Interprocessor collective communication library (InterCom), Proceedings of the Scalable High Performance Computing Conference, May, 1994.
4. C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam, 1973.
5. E. Blum, X. Wang, ROCC95 User's Manual, Compbionics Inc., Dec. 1995.
6. J. Bruck, C.-T. Ho, S. Kipnis, D. Weathersby, Efficient algorithms for all-to-all communications in multi-port message-passing systems. Proceedings of the Sixth ACM Symposium on Parallel Algorithms and Architectures, 1994, pp. 298-309.
7. R. Butler, E. Lusk, User's Guide to the p4 Programming System, Argonne National Laboratory, Oct. 1992.
8. J. Denes, A.D. Keedwell, Latin Squares and their Applications, Academic Press, New York, 1974.
9. J.J. Dongarra, T. Dunigan, Message-passing performance of various computers, Technical Report ORNL/TM-13006, Computer Science and Mathematical Division, Oak Ridge National Laboratory, Feb. 1996.
10. E. Drakopoulos, Performance and traffic analysis of a network-based distributed system, Comput. Commun. 16 (3) (1993) 155-167.
11. R. Fatoohi, Performance evaluation of communication networks for distributed computing, Report NAS-95-009, NASA Ames Research Center, Sept. 1995.
12. A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, V. Sunderam, PVM: Parallel Virtual Machine, A Users' Guide and Tutorial for Networked Parallel Programming, The MIT Press, Cambridge, MA, 1994.
13. IBM AIX Parallel Environment: Parallel Programming Subroutine Reference, Release 2.1, Dec. 1994.
14. S.L. Johnson, C.-T. Ho, Optimum broadcasting and personalized communication in hypercubes, IEEE Trans. Comput. 38 (9) (1989) 1249-1268.
15. V. Kumar, A. Grama, A. Gupta, G. Karypis, Introduction to Parallel Computing: Design and Analysis of Algorithms, Benjamin/Cummings Publishing Company, Redwood City, CA, 1994.
16. LAM: MPI Network Parallel Computing, Ohio Supercomputing Center, WWW home page at http:// www.osc.edu/lam.html.
17. C.L. Liu, Introduction to Combinatorial Mathematics, McGraw-Hill, New York, 1968.
18. P. Mitra, D. Payne, L. Shuler, R. van de Geijn, J. Watts, Fast collective communication libraries, please, Technical Report CS-TR-95-22, Computer Science Department, University of Texas at Austin, June 1, 1995.
19. Message passing interface forum, MPI: A message-passing interface standard, Int. J. Supercomput. Appl. High Performance Comput. 8 (4) (1994), special issue.
20. MPICH: A Portable Implementation of MPI, Mathematics and Computer Science Division, Argonne National Laboratory, Available at http://www.mcs.anl.gov/home/lusk/mpich/.
21. J.W. Moon, Topics on Tournaments, Holt, Rinehart and Winston, New York, 1968.
22. N. Nevin, The performance of LAM 6.0 and MPICH 1.0.12 on a workstation cluster, Technical Report OSC-TR-1996-4, Ohio Supercomputing Center, 1996. Available at http://www.osc.edu/Lam/lam /lam60-perf.html.
23. S. Nog, D. Kotz, A performance comparison of TCP/IP and MPI on FDDI, Fast Ethernet and Ethernet, Technical Report PCS-TR95-273, Department of Computer Science, Dartmouth College, 1995.
24. Y. Saad, M.H. Schultz, Data communication in parallel architectures, Parallel Comput. 11 (2) (1989) 131-150.
25. S. Saini, D.H. Bailey, NAS parallel benchmarks results 12-95, Report NAS-95-021, Dec. 1995. Available from the WWW home page at http://www.nas.nasa.gov/NAS/NPB/Reports/NAS-95-021.html.
26. G. Stellner, S. Lamberts, A. Bode, T. Ludwig, NXLib: Paragon parallel programming environment on a network of workstations. Available at the NXlib WWW home page http:// wwwbode.informatik.tu-muenchen.de/∼lamberts/NXLib/NXLib.html.
27. W.R. Stevens, UNIX Network Programming, Prentice Hall, Englewood Cliffs, New Jersey, 1990.
28. W.D. Wallis, Combinatorial Designs, Marcel Dekker, 1988.
29. X. Wang, E.K. Blum, Parallel execution of iterative algorithms on workstation clusters, J. Parallel Distrib. Comput. 34 (2) (1996) 218-226.
30. X. Wang, E.K. Blum, Efficient collective communication algorithms for high-performance computing on workstation clusters, in preparation.
31. X. Zhang, Y. Yan. A framework of performance prediction of parallel computing on nondedicated heterogeneous NOW, International Conference on Parallel Processing, August, 1995.