Abstract
An efficient interprocessor communication mechanism is essential to the performance of hypercube multiprocessors. All existing hypercube multiprocessors basically support one-to-one interprocessor communication only. However, multicast (one-to-many) communication is highly demanded in executing many data parallel algorithms. A multicast algorithm should attempt to inform each destination in a minimum number of time steps while generating a least amount of traffic. In this paper, we first propose a graph theoretical model, the Optimal Multicast Tree (OMT), for interprocessor communication in distributed-memory multiprocessors. The problem of finding an OMT is conjectured to be NP-hard even for hypercube multiprocessors. A heuristic Greedy multicast algorithm which guarantees a minimized message delivery time is proposed. Simulation results show that the performance of the Greedy algorithm is very close to the optimal solution. Routing of multicast messages is done in a distributed manner. The hardware design of a VLSI router which supports all types of communications is briefly discussed.
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.
