Complexity results and heuristics for pipelined multicast operations on heterogeneous platforms

We consider the communications involved by the execution of a complex application deployed on a heterogeneous platform. Such applications extensively use macro-communication schemes, such as multicast operations, where messages are broadcast to a set of predefined targets. We assume that there are a large number of messages to be multicast in pipeline fashion, and we seek to maximize the throughput of the steady-state operation. We target heterogeneous platforms, modeled by a graph where links have different communication speeds. We show that the problem of computing the best throughput for a multicast operation is NP-hard, whereas the best throughput to broadcast a message to every node in a graph can be computed in polynomial time. Thus, we introduce several heuristics to deal with this problem and prove that some of them are approximation algorithms. We perform, simulations to test these heuristics and show that their results are close to a theoretical upper bound on the throughput that we obtain with a linear programming approach.

[1]  Giorgio Gambosi,et al.  Complexity and Approximation , 1999, Springer Berlin Heidelberg.

[2]  Gene H. Golub,et al.  Matrix computations , 1983 .

[3]  Yves Robert,et al.  Pipelining broadcasts on heterogeneous platforms , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

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

[5]  Mukesh Singhal,et al.  A reliable multicast algorithm for mobile ad hoc networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[6]  John H. Reif,et al.  Synthesis of Parallel Algorithms , 1993 .

[7]  Pawel Winter,et al.  Steiner problem in networks: A survey , 1987, Networks.

[8]  K. Bharath-Kumar,et al.  Routing to Multiple Destinations in Computer Networks , 1983, IEEE Trans. Commun..

[9]  Susumu Shibusawa,et al.  Scheduling algorithms for efficient gather operations in distributed heterogeneous systems , 2000, Proceedings 2000. International Workshop on Parallel Processing.

[10]  Dhabaleswar K. Panda,et al.  Architectural Support for Efficient Multicasting in Irregular Networks , 2001, IEEE Trans. Parallel Distributed Syst..

[11]  Pangfeng Liu,et al.  Broadcast scheduling optimization for heterogeneous cluster systems , 2000, SPAA '00.

[12]  Chunming Qiao,et al.  Nonblocking WDM Multicast Switching Networks , 2000, IEEE Trans. Parallel Distributed Syst..

[13]  Yves Robert,et al.  Optimizing the steady-state throughput of scatter and reduce operations on heterogeneous platforms , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[14]  V. J. Rayward-Smith,et al.  The computation of nearly minimal Steiner trees in graphs , 1983 .

[15]  Betty H. C. Cheng,et al.  Optimal Multicast Communication in Wormhole-Routed Torus Networks , 1995, IEEE Trans. Parallel Distributed Syst..

[16]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

[17]  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).

[18]  Giuseppe Anastasi,et al.  A Reliable Multicast Protocol for Distributed Mobile Systems: Design and Evaluation , 2001, IEEE Trans. Parallel Distributed Syst..

[19]  Viktor K. Prasanna,et al.  Adaptive Communication Algorithms for Distributed Heterogeneous Systems , 1999, J. Parallel Distributed Comput..

[20]  Fukuhito Ooshita,et al.  Efficient gather operation in heterogeneous cluster systems , 2002, Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications.

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

[22]  Ran Libeskind-Hadas,et al.  On Multicast Algorithms for Heterogeneous Networks of Workstations , 1989, J. Parallel Distributed Comput..

[23]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

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

[25]  Anthony Ephremides,et al.  Energy-Aware Wireless Networking with Directional Antennas: The Case of Session-Based Broadcasting and Multicasting , 2002, IEEE Trans. Mob. Comput..

[26]  Bruce Lowekamp,et al.  ECO: Efficient Collective Operations for communication on heterogeneous networks , 1996, Proceedings of International Conference on Parallel Processing.

[27]  Kenneth L. Calvert,et al.  Modeling Internet topology , 1997, IEEE Commun. Mag..

[28]  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).

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

[30]  Xiaola Lin,et al.  Multicast Communication in Multicomputer Networks , 1993, ICPP.

[31]  S. Ramanathan,et al.  Multicast tree generation in networks with asymmetric links , 1996, TNET.

[32]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[33]  Yves Robert,et al.  Optimizing the steady-state throughput of Broadcasts on heterogeneous platforms , 2003 .

[34]  Jeffrey B. Sidney,et al.  Scheduling in broadcast networks , 1998 .

[35]  Jean-Claude König,et al.  Optimized Broadcasting and Multicasting Protocols in Cut-Through Routed Networks , 1998, IEEE Trans. Parallel Distributed Syst..