Abstract
Most recently, multicast communication has been included in multicomputer systems. Multicast communication refers to the delivery of the same message from a source node to an arbitrary number of destination nodes. The performance of multicomputers is highly dependent on the message routing scheme and the communication mechanism. Wormhole routing is the most promising switching technique used in the new generation multicomputers. In this paper, we propose a multicast wormhole routing algorithm for 2D-torus multicomputers. The multicast routing algorithm is based on a path-like routing scheme and offers deadlock-free routing. Our simulation which compared the 2D-mesh multicomputers shows that the multipath routing algorithm for 2D-torus multicomputers can reduce the communication traffic and the maximum distance in multicast communication.
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.
