Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 5:00 PM ET (12:00 - 21:00 UTC). We apologize for the inconvenience.
By Topic

A simple adaptive wormhole routing algorithm for MIMD systems

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
$31 $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)
Venkataramana, R.D. ; Dept. of Comput. Sci. & Eng., Univ. of South Florida, Tampa, FL, USA ; Ranganathan, N.

This paper describes a new adaptive wormhole routing algorithm for distributed memory MIMD systems. The algorithm uses the absolute sum of the difference in the coordinates of the nodes, as a measure to determine which of the available output channels the packet must be routed through. Thus, the routing decision is local, involves simple computations and provides maximum adaptivity to the traffic. The adaptivity of the packets that have resided in the network for a long time, is restricted to the shortest path to their destination, which ensures livelock freedom. In order to avoid deadlock, packets are buffered and then reintroduced when routing paths become available. The algorithm maps to a simple architecture

Published in:

Computer Design: VLSI in Computers and Processors, 1998. ICCD '98. Proceedings. International Conference on

Date of Conference:

5-7 Oct 1998