Tolerating faults in a mesh with a row of spare nodes
Open Access
- 6 June 1994
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 128 (1-2) , 241-252
- https://doi.org/10.1016/0304-3975(94)90171-6
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Fault-tolerant meshes with minimal numbers of sparesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Asymptotically tight bounds for computing with faulty arrays of processorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fault-tolerant meshes and hypercubes with minimal numbers of sparesIEEE Transactions on Computers, 1993
- Designing fault-tolerant systems using automorphismsJournal of Parallel and Distributed Computing, 1991
- On designing and reconfiguring k-fault-tolerant tree architecturesIEEE Transactions on Computers, 1990
- A fault tolerant massively parallel processing architectureJournal of Parallel and Distributed Computing, 1987
- Efficient Spare Allocation for Reconfigurable ArraysIEEE Design & Test of Computers, 1987
- Design of a Massively Parallel ProcessorIEEE Transactions on Computers, 1980
- A Graph Model for Fault-Tolerant Computing SystemsIEEE Transactions on Computers, 1976
- Graphs with circulant adjacency matricesJournal of Combinatorial Theory, 1970