Unicast-Based Multicast Communication in Wormhole-Routed Networks
IEEE Transactions on Parallel and Distributed Systems
Efficient Broadcasting in Wormhole-Routed Multicomputers: A Network-Partitioning Approach
IEEE Transactions on Parallel and Distributed Systems
Efficient Multicast on Irregular Switch-Based Cut-Through Networks with Up-Down Routing
IEEE Transactions on Parallel and Distributed Systems
Efficient Collective Communication on Heterogeneous Networks of Workstations
ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
ServerNet Deadlock Avoidance and Fractahedral Topologies
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Efficient Multicast Algorithms for Heterogeneous Switch-based Irregular Networks of Workstations
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Efficient Multicast in Heterogeneous Networks of Workstations
ICPP '00 Proceedings of the 2000 International Workshop on Parallel Processing
Optimal Contention-Free Unicast-Based Multicasting in Switch-Based Networks of Workstations
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Autonet: a high-speed, self-configuring local area network using point-to-point links
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
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.