Multipath E-cube algorithms (MECA) for adaptive wormhole routing and broadcasting in k-ary n-cubes

J.T Draper,J Ghosh

doi:10.1109/ipps.1992.223011

Multipath E-cube algorithms (MECA) for adaptive wormhole routing and broadcasting in k-ary n-cubes

J.T Draper, J Ghosh

https://doi.org/10.1109/ipps.1992.223011

Copy DOI

Publication Date: Mar 1, 1992

Citations: 25

Affiliation: The University of Texas at Austin

#Routing In K-ary N-cubes #K-ary N-cubes + Show 8 more

Abstract
Full-Text
Similar Papers

Abstract

Introduces and evaluates the multipath E-cube algorithm (MECA) for adaptive and fault-tolerant wormhole routing in k-ary n-cubes. This algorithm provides multiple shortest paths between any source and destination node of a multicomputer using only a constant number of virtual channels for every physical channel, and with little added overhead at the router. Consequently, it is able to improve network throughput and reduce latency while maintaining the deadlock-free property that is critical for circuit-switched routing mechanisms. MECA also allows multiple broadcast trees to be used concurrently without incurring deadlock. Simulation results highlight the advantages of MECA over other circuit-switched routing techniques. >

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 call

Similar Papers

Paper Title

Journal

Date

Author

View more papers

Disclaimer: 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.