Efficient fault-tolerant mesh and hypercube architectures
- 2 January 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Asymptotically tight bounds for computing with faulty arrays of processorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient algorithms for reconfiguration in VLSI/WSI arraysIEEE Transactions on Computers, 1990
- 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
- A defect-tolerant design for full-wafer memory LSIIEEE Journal of Solid-State Circuits, 1984
- The Diogenes Approach to Testable Fault-Tolerant Arrays of ProcessorsIEEE Transactions on Computers, 1983
- Design of a Massively Parallel ProcessorIEEE Transactions on Computers, 1980
- A Graph Model for Fault-Tolerant Computing SystemsIEEE Transactions on Computers, 1976