By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
J. T. Draper ; Dept. of Electr. Eng. & Comput. Sci., Texas Univ., Austin, TX, USA ; J. Ghosh

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

Published in:

Parallel Processing Symposium, 1992. Proceedings., Sixth International

Date of Conference:

23-26 Mar 1992