By Topic

Optimal multicast tree routing for cluster computing in hypercube interconnection networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Weijia Jia ; Dept. of Comput. Eng. & Inf. Technol., City Univ. of Hong Kong, China ; Pui-On Au ; Yong He ; Wanlei Zhou

This paper proposes a set of novel efficient multicast routing algorithms on hypercube interconnections of cluster computers using a multicast shared-tree approach. We present some new algorithms for selecting an optimal core (root) for constructing the shared tree so as to minimize the average delay for multicast messages. Simulation results indicate that our algorithms are efficient in the sense of short end-to-end average delay, load balance and lower resource utilization over hypercube cluster connections

Published in:

Parallel Architectures, Algorithms and Networks, 2002. I-SPAN '02. Proceedings. International Symposium on

Date of Conference:

2002