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

DOI10.1016/0895-7177(92)90027-IzbMath0791.68003OpenAlexW2048683435MaRDI QIDQ1206196

Dinko Gichev

Publication date: 1 April 1993

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(92)90027-i

zbMATH Keywords

\(n\)-dimensional hypercubemultiprocessor systemrouting messages

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Parallel algorithms in computer science (68W10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• An algorithm paradigm for incomplete hypercubes
• Generalized Hypercube and Hyperbus Structures for a Computer Network
• Fault-Tolerant Multiprocessor Link and Bus Network Architectures
• Fault Diagnosis in a Boolean n Cube Array of Microprocessors
• A Fault-Tolerant Communication Architecture for Distributed Systems
• Adaptive fault-tolerant routing in hypercube multicomputers
• Optimum broadcasting and personalized communication in hypercubes

This page was built for publication: An algorithm for routing messages between processing elements in a multiprocessor system which tolerates a maximal number of faulty links