Fault-Tolerant Multiprocessor Link and Bus Network Architectures
From MaRDI portal
Publication:3340781
DOI10.1109/TC.1985.1676513zbMath0547.94020MaRDI QIDQ3340781
Publication date: 1985
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
fault toleranceregular networkspacket switchingshuffle-exchange graphmultiprocessor networksfault-tolerant communicationalgorithmic routing, circuit switchingmultiple bus network
Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)
Related Items (11)
A depth-first search routing algorithm for star graphs and its performance evaluation ⋮ Topological properties of star graphs ⋮ On the connectivity of the De Bruijn graph ⋮ Supercube: An optimally fault tolerant network architecture ⋮ Bus interconnection networks ⋮ Unnamed Item ⋮ SHUFFLE-RING: A NEW CONSTANT-DEGREE NETWORK ⋮ Graph theoretic characterization and reliability of the multiple-clique network ⋮ A new family of trivalent Cayley networks on wreath product \(Z_{m}\wr S_{n}^\ast\) ⋮ An algorithm for routing messages between processing elements in a multiprocessor system which tolerates a maximal number of faulty links ⋮ Approximate Moore graphs are good expanders
This page was built for publication: Fault-Tolerant Multiprocessor Link and Bus Network Architectures
