Fault-tolerant meshes and hypercubes with minimal numbers of spares
- 1 January 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 42 (9) , 1089-1104
- https://doi.org/10.1109/12.241598
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- Some practical issues in the design of fault-tolerant multiprocessorsPublished 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 array processors using single-track switchesIEEE Transactions on Computers, 1989
- Fast computation using faulty hypercubesPublished by Association for Computing Machinery (ACM) ,1989
- Efficient Spare Allocation for Reconfigurable ArraysIEEE Design & Test of Computers, 1987
- Minimumk-hamiltonian graphs, IIJournal of Graph Theory, 1986
- Wafer-Scale Integration of Systolic ArraysIEEE Transactions on Computers, 1985
- Minimum K‐hamiltonian graphsJournal of Graph Theory, 1984
- A Graph Model for Fault-Tolerant Computing SystemsIEEE Transactions on Computers, 1976
- Graphs with circulant adjacency matricesJournal of Combinatorial Theory, 1970