Referenced Items are not available for this document.
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
- Page(s):
- 258 - 265
- Meeting Date :
- 01 Sep 1997-04 Sep 1997
- Print ISBN:
- 0-8186-8215-9
- INSPEC Accession Number:
- 5850727
- Conference Location :
- Budapest
- Digital Object Identifier :
- 10.1109/EMSCNT.1997.658475
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
