Efficient multiple multicasting in hypercubes

No Thumbnail Available
File version
Author(s)
Shen, Hong
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
1997
Size
File type(s)
Location
License
Abstract

Given k sets of processors (k> 1), G1, G2,...,Gk, each with a unique source, multiple multicasting requires to send message from each source to all the processors in its set. This problem can be solved by calling a (unique) multicasting algorithm k times, each for one set of processors, which requires a total time of O(knN) in a hypercube of N = 2n processors with existing hypercube multicasting algorithms. This paper proposes an efficient algorithm of time complexity O(nN) for solving this problem in the hypercube when Σi=1k, ¦ Gi¦ = O(N). The algorithm is designed with the heuristics to minimize the maximum number of hops, amount of traffic and degree of message multiplexing. Experimental results show that the algorithm has a good performance and produces satisfactory multicasting layout.

Journal Title

Journal of Systems Architecture

Conference Title
Book Title
Edition
Volume

43

Issue

9

Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject

Computer Software

Persistent link to this record
Citation
Collections