By Topic

Fault-tolerant self-routing algorithms for hypercube based architectures

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)
Castorino, A. ; Dept. of Electron. Eng., Rome Univ., Italy ; Ciccarella, G.

A key aspect in developing general hardware and software distributed architectures concerns the routing of messages among several processors. The aim of such routing algorithms is to guarantee the message delivery through shortest paths and to present a certain tolerance in case of link or node failures. The paper presents two routing algorithms suitable for message routing in a general purpose distributed system based on a N cube architecture. The decision policy, adopted in both the algorithms, is based on a particular assignment of labels to each node and requires minimal information, local to each node or embedded in the messages. Their simplicity, moreover, permits us to have a reduced overhead; an aspect of remarkable importance in real time systems

Published in:

EUROMICRO 97. 'New Frontiers of Information Technology'. Short Contributions., Proceedings of the 23rd Euromicro Conference

Date of Conference:

1-4 Sep 1997