Analysis of minimal path routing schemes in the presence of faults

DOI10.1016/0166-218X(92)90136-XzbMath0756.94022OpenAlexW1978113314MaRDI QIDQ1199428

Jesse M. Gordon

Publication date: 16 January 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(92)90136-x

zbMATH Keywords

hypercubefaultsdistributed memory multiprocessor systemsfault tolerant message routing schemeslarge parallel systems

Mathematics Subject Classification ID

Circuits, networks (94C99) Fault detection; testing in circuits and networks (94C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On fault tolerant routings in general networks
• A new look at fault-tolerant network routing
• A Scheme for Fast Parallel Communication
• A Graph Model for Fault-Tolerant Computing Systems
• An optimal shortest-path routing policy for network computers with regular mesh-connected topologies

This page was built for publication: Analysis of minimal path routing schemes in the presence of faults