An algorithm for routing messages between processing elements in a multiprocessor system which tolerates a maximal number of faulty links

Authors:
Dinko Gichev
Affiliations:
Center of Informatics and Computer Technology Akad. G. Bonchev str. 25 A, Sofia 1113, Bulgaria
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1992

Citing 10
Cited 0

Incomplete Hypercubes

IEEE Transactions on Computers
Topological Properties of Hypercubes

IEEE Transactions on Computers
Data communication in hypercubes

Journal of Parallel and Distributed Computing
Optimum Broadcasting and Personalized Communication in Hypercubes

IEEE Transactions on Computers
Adaptive Fault-Tolerant Routing in Hypercube Multicomputers

IEEE Transactions on Computers
Subcube Allocation and Task Migration in Hypercube Multiprocessors

IEEE Transactions on Computers
Fault-Tolerant Multiprocessor Link and Bus Network Architectures

IEEE Transactions on Computers
Generalized Hypercube and Hyperbus Structures for a Computer Network

IEEE Transactions on Computers
Fault Diagnosis in a Boolean n Cube Array of Microprocessors

IEEE Transactions on Computers
A Fault-Tolerant Communication Architecture for Distributed Systems

IEEE Transactions on Computers

Quantified Score

Hi-index	0.98

Visualization

Abstract

An algorithm for routing messages between processing elements in a multiprocessor system is proposed. The algorithm can always be performed when the system is a connected graph. Comparisons are made with some known algorithms. The algorithm has been illustrated on an n-dimensional hypercube but can be applied on an arbitrary connected multiprocessor system.