Fault-tolerant self-routing algorithms for hypercube based architectures

Author

Castorino, A. ; Ciccarella, G.

Author_Institution

Dept. of Electron. Eng., Rome Univ., Italy

fYear

1997

fDate

1-4 Sep 1997

Firstpage

258

Lastpage

265

Abstract

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

Keywords

fault tolerant computing; hypercube networks; message passing; parallel architectures; real-time systems; reliability; software fault tolerance; N cube architecture; decision policy; fault tolerant self routing algorithms; general purpose distributed system; hypercube based architectures; message delivery; message routing; node failures; real time systems; routing algorithms; software distributed architectures; Application software; Computer architecture; Distributed computing; Fault tolerance; Hamming distance; Hardware; Hypercubes; Local area networks; Routing; Telecommunication computing;

fLanguage

English

Publisher

ieee

Conference_Titel

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

Conference_Location

Budapest

Print_ISBN

0-8186-8215-9

Type

conf

DOI

10.1109/EMSCNT.1997.658475

Filename

658475