Heuristic Contention-Free Broadcast in Heterogeneous Networks of Workstations with Multiple Send and Receive Speeds

This paper presents three efficient contention-free algorithms for broadcasting on heterogeneous networks of workstations (HNOW). In an HNOW, many different speed types of workstations can have distinct send and receive overhead. Previous research has shown that finding an optimal routing scheme in an HNOW is not easy [2,12], because properly arranging all workstations in the scheduling tree is difficult. Therefore, this investigation focuses mainly on enhancing the performance of an HNOW by properly arranging fastest nodes into the internal nodes of upper levels in the scheduling tree. Fastest node first is fundamental in designing an efficient algorithm. This paper presents three schemes called EBS, VBBS, and VBBSWF. All of these three schemes can be executed in O(n log(n)) time, where n is the number of workstations. They are all contention-free when broadcasting in an HNOW. Based on the simulation result, the proposed schemes outperform the broadcast with minimal steps [13] and the scheduling tree [22] generated by dynamic programing in an HNOW.

[1]  William J. Dally,et al.  The torus routing chip , 2005, Distributed Computing.

[2]  Hong Xu,et al.  Unicast-Based Multicast Communication in Wormhole-Routed Networks , 1994, IEEE Trans. Parallel Distributed Syst..

[3]  Michael Burrows,et al.  Autonet: A High-Speed, Self-Configuring Local Area Network Using Point-to-Point Links , 1991, IEEE J. Sel. Areas Commun..

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

[5]  Chita R. Das,et al.  Virtual channel multiplexing in networks of workstations with irregular topology , 1998, Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238).

[6]  James Patton Jones,et al.  Workload management: more than just job scheduling , 2001, Proceedings 42nd IEEE Symposium on Foundations of Computer Science.

[7]  Arnold L. Rosenberg,et al.  Sharing partitionable workloads in heterogeneous NOWs: greedier is not better , 2001, Proceedings 42nd IEEE Symposium on Foundations of Computer Science.

[8]  Robert W. Horst,et al.  ServerNet deadlock avoidance and fractahedral topologies , 1996, Proceedings of International Conference on Parallel Processing.

[9]  Christian Huitema,et al.  Routing in the Internet (2nd ed.) , 1999 .

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

[11]  Yves Robert,et al.  Matrix Multiplication on Heterogeneous Platforms , 2001, IEEE Trans. Parallel Distributed Syst..

[12]  D. Ma,et al.  Optimal Contention-Free Unicast-Based Multicasting in Switch-Based Networks of Workstations , 1998 .

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

[14]  Charles L. Seitz,et al.  Myrinet: A Gigabit-per-Second Local Area Network , 1995, IEEE Micro.

[15]  Andrea Clematis,et al.  A resource management tool for heterogeneous networks , 1999, Proceedings of the Seventh Euromicro Workshop on Parallel and Distributed Processing. PDP'99.

[16]  Lionel M. Ni,et al.  A survey of wormhole routing techniques in direct networks , 1993, Computer.

[17]  José Duato,et al.  Fast dynamic reconfiguration in irregular networks , 2000, Proceedings 2000 International Conference on Parallel Processing.

[18]  Dhabaleswar K. Panda,et al.  Efficient multicast algorithms for switch-based irregular heterogeneous networks of workstations , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[19]  Li Xiao,et al.  Dynamic Cluster Resource Allocations for Jobs with Known and Unknown Memory Demands , 2002, IEEE Trans. Parallel Distributed Syst..

[20]  Yu-Chee Tseng,et al.  Efficient single-node broadcast in switched-based network of workstations with network partitioning , 2001, Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495).

[21]  Dhabaleswar K. Panda,et al.  Efficient Multicast Algorithms for Heterogeneous Switch-based Irregular Networks of Workstations , 2001 .

[22]  Christian Huitema,et al.  Routing in the Internet , 1995 .

[23]  Ran Libeskind-Hadas,et al.  Optimal contention-free unicast-based multicasting in switch-based networks of workstations , 1998, Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing.

[24]  Li Xiao,et al.  Effective load sharing on heterogeneous networks of workstations , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[25]  Amit Kumar,et al.  Optimal configuration of OSPF aggregates , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[27]  Dhabaleswar K. Panda,et al.  Efficient Multicast on Irregular Switch-Based Cut-Through Networks with Up-Down Routing , 2001, IEEE Trans. Parallel Distributed Syst..