Hardware-Efficient and Highly Reconfigurable 4- and 2-Track Fault-Tolerant Designs for Mesh-Connected Arrays
✍ Scribed by Nihar R. Mahapatra; Shantanu Dutt
- Book ID
- 102601475
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 357 KB
- Volume
- 61
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
✦ Synopsis
We consider m-track models for constructing fault-tolerant (FT) mesh systems which have one primary and m spare tracks per row and column, switches at the intersection of these tracks, and spare processors at the boundaries. A faulty system is reconfigured by finding for each fault u a reconfiguration path from the fault to a spare in which, starting from the fault u, a processor is replaced or covered'' by the nearest available'' succeeding processor on the path a processor on the path is not available if it is faulty or is used as a cover'' on some other reconfiguration path. In previous work, a 1-track design that can support any set of node-disjoint straight reconfiguration paths, and a more reliable 3-track design that can support any set of node-disjoint rectilinear reconfiguration paths have been proposed. In this research note, we present: (1) A fundamental result regarding the universality of simple one-to-one switches'' in m-track 2-D mesh designs in terms of their reconfigurabilities. (2) A 4-track mesh design that can support any set of edgedisjoint (a much less restrictive criterion than node-disjointness) rectilinear reconfiguration paths, and that has 34 0 less switching overhead and significantly higher, actually close-to-optimal, reconfigurability compared to the previously proposed 3-track design. (3) A new 2-track design derived