Minimizing node contention in multiple multicast on wormhole k-ary n-cube networks

Publisher Website
Google Scholar
Abstract
This paper presents a new approach to minimize node contention while performing multiple multicast on wormhole -ary -cube networks with overlapped destina- tion sets. The existing multicast algorithms in the literature deliver poor performance under multiple multicast because these algorithms have been designed with only single multi- cast in mind. Our algorithms use only local source-specific information, and no global knowledge about other concur- rent multicasts. For systems supporting unicast message- passing, a new SPUmesh (Source-Partitioned Umesh) al- gorithm is proposed and shown to be superior than the conventional Umesh algorithm (4) for multiple multicast. Two new algorithms, SQHL (Source-Quadrant Hierar- chical Leader) and SCHL (Source-Centered Hierarchical Leader), are proposed for systems with multidestination message-passing, and shown to be superior than the HL scheme (7). All these algorithms perform 1) 5-10 times faster than the existing algorithms under multiple multicast and 2) as fast as existing algorithms under single multi- cast. Such results related to multiple multicast are the first of their kind in the wormhole literature and demonstrate significant potential for current and future wormhole sys- tems.

This publication has 6 references indexed in Scilit: