An Approximation Algorithm for Broadcast Scheduling in Heterogeneous Clusters

Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-the-shelf processors become cheaper and faster, it is now possible to build a PC or workstation cluster that provides high computing power within a limited budget. However, a cluster may consist of different types of processors and this heterogeneity within a cluster complicates the design of efficient collective communication protocols.

[1]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[2]  Douglas B. West.  A class of solutions to the gossip problem, part II , 1982, Discret. Math..

[3]  David A. Patterson,et al.  A case for networks of workstations (now) , 1994, Symposium Record Hot Interconnects II.

[4]  Pangfeng Liu.  Broadcast Scheduling Optimization for Heterogeneous Cluster Systems , 2002, J. Algorithms.

[5]  Richard M. Karp,et al.  Optimal broadcast and summation in the LogP model , 1993, SPAA '93.

[6]  David E. Culler,et al.  A case for NOW (networks of workstation) , 1995, PODC '95.

[7]  Jehoshua Bruck,et al.  Efficient Message Passing Interface (MPI) for Parallel Computing on Clusters of Workstations , 1997, J. Parallel Distributed Comput..

[8]  Amotz Bar-Noy,et al.  Designing broadcasting algorithms in the postal model for message-passing systems , 1992, SPAA '92.

[9]  Da-Wei Wang,et al.  Reduction optimization in heterogeneous cluster environments , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[10]  Luisa Gargano,et al.  On the construction of minimal broadcast networks , 1989, Networks.

[11]  Message Passing Interface Forum.  MPI: A message - passing interface standard , 1994 .

[12]  Arthur L. Liestman,et al.  Broadcast Networks of Bounded Degree , 1988, SIAM J. Discret. Math..

[13]  Anthony Skjellum,et al.  A High-Performance, Portable Implementation of the MPI Message Passing Interface Standard , 1996, Parallel Comput..

[14]  Dhabaleswar K. Panda,et al.  Multicast on irregular switch-based networks with wormhole routing , 1997, Proceedings Third International Symposium on High-Performance Computer Architecture.

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  Dhabaleswar K. Panda,et al.  Efficient collective communication on heterogeneous networks of workstations , 1998, Proceedings. 1998 International Conference on Parallel Processing (Cat. No.98EX205).

[17]  Viktor K. Prasanna,et al.  Efficient collective communication in distributed heterogeneous systems , 1999, Proceedings. 19th IEEE International Conference on Distributed Computing Systems (Cat. No.99CB37003).

[18]  Jose A. Ventura,et al.  A new method for constructing minimal broadcast networks , 1993, Networks.

[19]  Douglas B. West.  A class of solutions to the gossip problem, part I , 1982, Discret. Math..

[20]  Message P Forum,et al.  MPI: A Message-Passing Interface Standard , 1994 .

[21]  Dhabaleswar K. Panda,et al.  Communication modeling of heterogeneous networks of workstations for performance characterization of collective operations , 1999, Proceedings. Eighth Heterogeneous Computing Workshop (HCW'99).

[22]  Ran Libeskind-Hadas,et al.  Efficient multicast in heterogeneous networks of workstations , 2000, Proceedings 2000. International Workshop on Parallel Processing.

[23]  Amotz Bar-Noy,et al.  Designing broadcasting algorithms in the postal model for message-passing systems , 2005, Mathematical systems theory.

[24]  Sudipto Guha,et al.  Multicasting in heterogeneous networks , 1998, STOC '98.

[25]  Dana S. Richards,et al.  Generalizations of broadcasting and gossiping , 1988, Networks.

[26]  David Peleg,et al.  Tight Bounds on Minimum Broadcast Networks , 1991, SIAM J. Discret. Math..

[27]  Arthur L. Liestman,et al.  A survey of gossiping and broadcasting in communication networks , 1988, Networks.