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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
