Abstract
With the emergence of the network technologies, heterogeneous computing has become a wide accept paradigm for distributed and network computing. In this paper, we present different algorithms aiming to efficiently perform atomic one-to-all broadcast in a heterogeneous network with a one port model. The proposed algorithms are divided into graph-based and tree-based ones. In graph-based algorithms, we present Nearest Neighbor First and Maximum Degree Neighbor First schemes. A prescheduling strategy with constructing a message forwarding table for avoiding redundant transmissions is applied as runtime support. In the tree- based approaches, there are five heuristic algorithms: Nearest Neighbor First, Maximum Degree Neighbor First, Maximum Height Subtree First, Maximum Subtree First, and Maximum Weighted Subtree First, proposed based on different network characteristics. To evaluate the performance of the proposed techniques, we have developed a simulator that contains a parametric graph generator for generating network graphs with various characteristics. We have implemented all of the proposed scheduling algorithms on the simulator. The performance results show that the Maximum Weighted Subtree First performs best in high degree heterogeneous environments. On the contrary, with homogeneous-like environments, the graph-based Nearest Neighbor First will be the best choice. In summary, contribution of this study relies on informing significant suggestions for adapting proper broadcasting mechanism in different heterogeneous platforms.
Similar content being viewed by others
References
Barchet-Steffenel AL, Mounié G (2006) Scheduling heuristics for efficient broadcast operations on grid environments. In: Proceedings of international parallel and distributed processing symposium, 2006
Banikazemi M, Moorthy V, Panda DK (1998) Efficient collective communication on heterogeneous networks of workstations. In: Proceedings of international conference on parallel processing, 1998, pp 460–467
Beaumont O, Legrand A, Marchal L, Robert Y (2005) Steady-state scheduling on heterogeneous clusters. Int J Found Comput Sci 16(2):163–194
Beaumont O, Legrand A, Marchal L, Robert Y (2004) Complexity results and heuristics for pipelined multicast operations on heterogeneous platforms. In: Proceedings of international conference on parallel processing, 2004, pp 267–274
Beaumont O, Legrand A, Marchal L, Robert Y (2005) Pipelining broadcasts on heterogeneous platforms. IEEE Trans Parallel Distrib Syst 16(4):300–313
Beaumont O, Marchal L, Robert Y (2005) Broadcast trees for heterogeneous platforms. In: Proceedings of 19th IEEE international parallel and distributed processing symposium, 2005
Bhat P, Raghavendra C, Prasanna V (2003) Efficient collective communication in distributed heterogeneous systems. J Parallel Distrib Comput 63(3):251–263
Faraj A, Patarasuk P, Yuan X (2005) Bandwidth efficient all-to-all broadcast on switched clusters. In: Proceedings of IEEE international conference on cluster computing, 2005
Garey MR, Johnson DS (1979) Computers and intractability, a guide to the theory of NP-completeness. Freeman, New York
Lennart Johnsson S, Ho C-T (1989) Optimum broadcasting and personalized communication in hypercubes. IEEE Trans Comput 38(9):1249–1268
Khuller S, Kim Y (2004) On broadcasting in heterogeneous networks. In: Proceedings of the 16th annual ACM symposium on parallel architectures and algorithms, 2004
Kumar V, Grama A, Gupta A, Karypis G (1994) Introduction to parallel computing. Benjamin/Cummings, Redwood City
Lin C, Tseng Y-C, Sheu J-P (2001) Efficient single-node broadcast in switched-based network of workstations with network partitioning. In: Proceedings of tenth international conference on computer communications and networks, 2001, pp 68–74
Lin C (2003) Efficient contention-free broadcast in heterogeneous network of workstation with multiple send and receive speeds. In: Proceedings eighth IEEE international symposium on computers and communication, 2003 (ISCC 2003), vol 2, pp 1277–1284
Lin C (2004) Efficient broadcast in a heterogeneous network of workstations using two sub-networks. In: Proceedings of 7th international symposium on parallel architectures, algorithms and networks, 2004, pp 273–279
Lowekamp BB, Begueliny A (1996) ECO: efficient collective operations for communication on heterogeneous networks. In: Proceedings of the 10th international parallel processing symposium, 1996, pp 399–405
Liu P (2002) Broadcast scheduling optimization for heterogeneous cluster systems. J Algorithms 42(1):135–152
Mendia VE, Sarkar D (1992) Optimal broadcasting on the star graph. IEEE Trans Parallel Distrib Syst 3(4):389–396
Moore J, Quinn M (1997) Generating an efficient broadcast sequence using reflected gray codes. IEEE Trans Parallel Distrib Syst 8(11):1117–1122
Ooshita F, Matsumae S, Masuzawa T, Tokura N (2004) Scheduling for broadcast operation in heterogeneous parallel computing environments. Syst Comput Jpn 35(5):44–54
Ooshita F, Matsumae S, Masuzawa T (2002) Efficient gather operation in heterogeneous cluster systems. In: Proceedings of 16th annual international symposium on high performance computing systems and applications, 2002, pp 196–204
Patarasuk P, Faraj A, Yuan X (2006) Pipelined broadcast on ethernet switched clusters. In: Proceedings of international parallel and distributed processing symposium, 2006, p 10
Rescigno AA (1997) Optimal polling in communication networks. IEEE Trans Parallel Distrib Syst 8(5):449–461
Tinetti FG, Barbieri A (2003) An efficient implementation for broadcasting data in parallel applications over ethernet clusters. In: Proceeding of 17th international conference on advanced information networking and applications, 2003, pp 593–596
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hsu, CH., Tsai, BR. Scheduling for atomic broadcast operation in heterogeneous networks with one port model. J Supercomput 50, 269–288 (2009). https://doi.org/10.1007/s11227-008-0261-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-008-0261-6