Abstract
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.
This paper shows that a simple heuristic called fastest-node-first (FNF) [2] is very effective in reducing broadcast time for heterogeneous cluster systems. Despite the fact that FNF heuristic does not guarantee an optimal broadcast time for general heterogeneous network of workstation, we prove that FNF always gives near optimal broadcast time in a special case of cluster, and this finding helps us show that FNF delivers guaranteed performance for general clusters. In a previous paper we showed a similar bound on the competitive ratio in a send-only communication model. This paper extends the result to a more realistic sender-receiver model. We show that FNF gives a total broadcast of 2T + β, where T is the optimum time and β is a constant. This improves over the previous bound on 2 αT + β [17], where α is a theoretically unbounded ratio of the processor performance in the cluster.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Anderson, T., Culler, D., Patterson, D.: A case for networks of workstations (now). IEEE Micro (February 1995)
Banikazemi, M., Moorthy, V., Panda, D.K.: Efficient collective communication on heterogeneous networks of workstations. In: Proceedings of International Parallel Processing Conference (1998)
Banikazemi, M., Sampathkumar, J., Prabhu, S., Panda, D., Sadayappan, P.: Communication modeling of heterogenous networks of workstations for performance characterization of collective operations. In: Proceedings of International Workshop on Heterogeneous Computing (1999)
Bar-Noy, A., Guha, S., Naor, J., Schieber, B.: Multicast in heterogeneous networks. In: Proceedings of the 13th Annual ACM Symposium on theory of computing (1998)
Bar-Noy, A., Kipnis, S.: Designing broadcast algorithms in the postal model for message-passing systems. Mathematical Systems Theory 27(5) (1994)
Bhat, P.B., Raghavendra, C.S., Prasanna, V.K.: Efficient collective communication in distributed heterogeneous systems. In: Proceedings of the International Conference on Distributed Computing Systems (1999)
Dinneen, M., Fellows, M., Faber, V.: Algebraic construction of efficient networks. In: Mattson, H.F., Rao, T.R.N., Mora, T. (eds.) AAECC 1991. LNCS, vol. 539. Springer, Heidelberg (1991)
Bruck, J., et al.: Efficient message passing interface(mpi) for parallel computing on clusters of workstations. Journal of Parallel and Distributed Computing (January 1997)
Message Passing Interface Forum. MPI: A message-passing interface standard. Technical Report UT-CS-94-230 (1994)
Garey, M.R., Johnson, D.S.: Computer and Intractability: A guide to the theory of NP-Completeness. W. H. Freeman, New York (1979)
Gargang, L., Vaccaro, U.: On the construction of minimal broadcast networks. Network 19 (1989)
Grigni, M., Peleg, D.: Tight bounds on minimum broadcast networks. SIAM J. Discrete Math. 4 (1991)
Gropp, W., Lusk, E., Doss, N., Skjellum, A.: High-performance, portable implementation of the MPI Message Passing Interface Standard. Parallel Computing 22(6), 789–828 (1996)
Hedetniemi, S.M., Hedetniem, S.T., Liestman, A.L.: A survey of gossiping and broadcasting in communication networks. Networks 18 (1991)
Karp, R., Sahay, A., Santos, E., Schauser, K.E.: Optimal broadcast and summation in the logp model. In: Proceedings of 5th Ann. Symposium on Parallel Algorithms and Architectures (1993)
Kesavan, R., Bondalapati, K., Panda, D.: Multicast on irregular switch-based networks with wormhole routing. In: Proceedings of International Symposium on High Performance Computer Architecture (1997)
Libeskind-Hadas, R., Hartline, J.: Efficient multicast in heterogeneous networks of wrokstations. In: Proceedings of 2000 International Workshop on Parallel Processing (2000)
Liestman, A.L., Peters, J.G.: Broadcast networks of bounded degree. SIAM J. Discrete Math. 1 (1988)
Liu, P.: Broadcast scheduling optimization for heterogeneous cluster systems. Journal of Algorithms 42 (2002)
Liu, P., Wang, D.: Reduction optimization in heterogeneous cluster environments. In: Proceedings of the International Parallel and Distributed Processing Symposium (2000)
Richards, D., Liestman, A.L.: Generalization of broadcast and gossiping. Networks 18 (1988)
Ventura, J.A., Weng, X.: A new method for constructing minimal broadcast networks. Networks 23 (1993)
West, D.B.: A class of solutions to the gossip problem. Discrete Math. 39 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, P., Wang, DW., Guo, YH. (2004). An Approximation Algorithm for Broadcast Scheduling in Heterogeneous Clusters. In: Chen, J., Hong, S. (eds) Real-Time and Embedded Computing Systems and Applications. RTCSA 2003. Lecture Notes in Computer Science, vol 2968. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24686-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-24686-2_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21974-3
Online ISBN: 978-3-540-24686-2
eBook Packages: Springer Book Archive