Clustering multicast on hypercube network

Authors:
Lu Song;Fan BaoHua;Dou Yong;Yang XiaoDong
Affiliations:
College of Computer Science, National University of Defense Technology, Changsha, Hunan, People's Republic of China;College of Computer Science, National University of Defense Technology, Changsha, Hunan, People's Republic of China;College of Computer Science, National University of Defense Technology, Changsha, Hunan, People's Republic of China;College of Computer Science, National University of Defense Technology, Changsha, Hunan, People's Republic of China
Venue:
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
Year:
2006

Citing 8
Cited 1

Distributed multi-destination routing in hypercube multiprocessors

C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Multicast in hypercube multiprocessors

Journal of Parallel and Distributed Computing
Multicast algorithms for hypercube multiprocessors

Journal of Parallel and Distributed Computing
Locally Subcube-Connected Hypercube Networks: Theoretical Analysis and Experimental Results

IEEE Transactions on Computers
Interconnection Networks: An Engineering Approach

Interconnection Networks: An Engineering Approach
Multicast Communication in Multicomputer Networks

IEEE Transactions on Parallel and Distributed Systems
Principles and Practices of Interconnection Networks

Principles and Practices of Interconnection Networks
Topological Structure and Analysis of Interconnection Networks

Topological Structure and Analysis of Interconnection Networks

A clustering model for multicast on hypercube network

GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multicast communication is one of the general patterns of collective communication in multiprocessors. On hypercube network, the optimal multicast tree problem is NP-hard and all existing multicast algorithms are heuristic. And we find that the existing works are far away from optimal. So this paper aims to design an more efficient algorithm to reduce the communication traffic of multicast in hypercube network. We propose a clustering model and an efficient clustering multicast algorithm. Compared with the existing related works by simulation experiments, our heuristic algorithm reduces the communication traffic significantly.