On balancing traffic load in path-based multicast communication.

Al-Dubai, Ahmed; Ould-Khaoua, Mohamed; El-Zayyat, K; Mackenzie, Lewis

Abstract

Multicast is the most primitive collective capability of any
message-passing network. It is itself central to many
important parallel applications in Science and
Engineering but are also fundamental to the
implementation of higher-level communication operations
such as gossip, gather, and barrier synchronisation. This
paper presents a new efficient multicast path-based
algorithm, which can achieve a high degree of parallelism
and low communication latency over a wide range of
traffic loads in the mesh. To achieve this, the proposed
algorithm relies on a new approach that divides the
destinations in a way that balances the traffic load on
network channels during the propagation of the multicast
message. Results from extensive simulations under a
variety of working conditions confirm that the proposed
algorithm exhibits superior performance characteristics
over those of some well-known existing algorithms, such
as dual-path, multiple-path, and column-path algorithms

• Conference Name: International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS'2003)
• Start Date: Jul 20, 2003
• End Date: Jul 24, 2003
• Publication Date: 2003
• Deposit Date: Dec 16, 2009
• Publicly Available Date: Dec 16, 2009
• Peer Reviewed: Peer Reviewed
• Pages: 533-540
• Book Title: SPECTS '03
• ISBN: 1-56555-269-5
• Keywords: multicast; message-passing network; gossip, gather, and barrier synchronisation; path-basedalgorithm; traffic loads; mesh; dual-path; multiple-path;column-path algorithms
• Public URL: http://researchrepository.napier.ac.uk/id/eprint/3560
• Contract Date: Dec 16, 2009