Efficient Broadcast in Heterogeneous Networks of Workstations Using Two Sub-Networks
This paper presents efficient algorithms for broadcasting on heterogeneous switch-based networks of workstations (HNOW) by two partitioned sub-networks. In an HNOW, many multiple speed types of workstations have different send and receive overheads. Previous research has found that routing by two sub-networks in a NOW can significantly increase system’s performance (Proc. 10th International Conference on Computer Communications and Networks, pp. 68–73, 2001). Similarly, EBS and VBBS (Proc. 8th IEEE International Symposium on Computer and Communication, pp. 1277–1284, (2003)), designed by applying the concept of fastest nodes first, can be executed in O(nlog(n)) time, where n is the number of workstations. This paper proposes two schemes TWO-EBS and TWO-VBBS for broadcasting in an HNOW. These two schemes divide an HNOW into two sub-networks that are routed concurrently and combine EBS and VBBS to broadcast in an HNOW. Based on simulation results, TWO-VBBS outperforms EBS, VBBS, VBBSWF (Proc. 8th IEEE International Symposium on Computer and Communication, pp. 1277–1284, (2003)), the postorder recursive doubling (Proc. Merged IPPS/SPDP Conference, pp. 358–364, (1998)), and the optimal scheduling tree (Proc. Parallel and Distributed Processing Symposium, Proc. 15th International (2001)) generated by dynamic programming in an HNOW.
KeywordsWormhole routing myrinet heterogeneous networks of workstation network partitioning up*/down* routing unicast-based broadcast postorder recursive doubling algorithm
Unable to display preview. Download preview PDF.
- 1.Banikazemi M., Moorthy V., and Panda D., Efficient Collective Communication on Heterogeneous Networks of Workstations, In International Conference on Parallel Processing, p. 460–467 (1998).Google Scholar
- 2.Banikazemi M., Sampathkumar J., Prabhu S., Panda D., and Sadayappan P., Communication Modeling of Heterogeneous Networks of Workstations for Performance Characterization of Collective Operations, In Heterogeneous Computing Workshop, 1999. (HCW ’99) Proceedings. Eighth, 1999, pp. 125–133 (1999).Google Scholar
- 4.Dally, W.J., Seitz, C.L. 1986The Torus Routing ChipJournal of Parallel and Distributed Computing1187196Google Scholar
- 5.Horst R., Servernet Deadlock Avoidance and Fractahefral Topologies. In Proc. Int’l Parallel Processing Symp, 1996 pp. 274–280.Google Scholar
- 6.Kesavan R., and Panda D.K., Efficient Multicast on Irregular Switch-based Cut-Through Networks With Up-Down Routing, IEEE Transaction on Parallel and Distributed Systems, pp. 808–828 (2001).Google Scholar
- 7.R. Libeskind-Hadas and Hartline J., Efficient Multicast in Heterogeneous Networks of Workstations, In Parallel Processing, 2000. Proceedings. 2000 International Workshops on, 2000, pp. 403–410 (2000).Google Scholar
- 8.R. Libeskind-Hadas, Mazzoni D., and Rajagopalan R., Optimal Contension-Free Unicast-Based Multicasting in Switched-Based Networks of Workstations, In Merged IPPS/SPDP Conf., pp. 358–364 (1998).Google Scholar
- 9.Lin C., Efficient Contention-Free Broadcast in Heterogeneous Network of Worstation with Multiple Send and Recive Speeds. In Proc. 8th IEEE International Simposium on Computer and communication, pp. 1277–1284 (2003).Google Scholar
- 10.Lin C., Tseng Y.-C., and Sheu J.-P., Efficient Single Node Broadcast in Switched-Based Network of Workstations with Network Partitioning, In Proc. 10th International Conference on Computer Communications and Networks, pp. 68–73 (2001).Google Scholar
- 12.Ni, L.M., Mckinley, P. 1993A Survey of Wormhole Routing Techiniques in Directed NetworkIEEE Computers266276Google Scholar
- 14.Singhal A., Banikazemi M., Sadayappan P., and Panda D., Efficient Multicast Algorithms for Switch-Based Irregular Heterogeneous Networks of Workstations, In Parallel and Distributed Processing Symposium., Proceedings 15th International, 2001 8 pp.Google Scholar