Summary
|
For Full-Text PDF, please login, if you are a member of IEICE, or go to Pay Per View on menu list, if you are a nonmember of IEICE. |
|
Optimal Multicast Tree Routing for Cluster Computing in Hypercube Interconnection Networks Weijia JIA Bo HAN Pui On AU Yong HE Wanlei ZHOU Publication IEICE TRANSACTIONS on Information and Systems Vol.E87-D No.7 pp.1625-1632 Publication Date: 2004/07/01 Online ISSN: DOI: Print ISSN: 0916-8532 Type of Manuscript: Special Section PAPER (Special Section on Hardware/Software Support for High Performance Scientific and Engineering Computing) Category: Networking and System Architectures Keyword: cluster computing, multicast routing, routing delay, hypercube, delay, source tree, shared tree, resource utilization, Full Text: PDF(570.7KB)>>
Summary: Cluster computation has been used in the applications that demand performance, reliability, and availability, such as cluster server groups, large-scale scientific computations, distributed databases, distributed media-on-demand servers and search engines etc. In those applications, multicast can play the vital roles for the information dissemination among groups of servers and users. This paper proposes a set of novel efficient fault-tolerant multicast routing algorithms on hypercube interconnection of cluster computers using multicast shared tree approach. We present some new algorithms for selecting an optimal core (root) and constructing the shared tree so as to minimize the average delay for multicast messages. Simulation results indicate that our algorithms are efficient in the senses of short end-to-end average delay, load balance and less resource utilizations over hypercube cluster interconnection networks. | ||||||||||
| ||||||||||
