Heuristic search for adaptive, defect-tolerant multiprocessor arrays

Authors:
Vasileios Vasilikos;Georgios Smaragdos;Christos Strydis;Ioannis Sourdis
Affiliations:
Delft University of Technology, The Netherlands;Delft University of Technology, The Netherlands;Erasmus University Medical Center, The Netherlands;Chalmers University of Technology, Sweden
Venue:
ACM Transactions on Embedded Computing Systems (TECS) - Special section on ESTIMedia'12, LCTES'11, rigorous embedded systems design, and multiprocessor system-on-chip for cyber-physical systems
Year:
2013

Citing 16
Cited 0

Discrete Mathematics and Its Applications

Discrete Mathematics and Its Applications
Dynamic Fault Tolerance in FPGAs via Partial Reconfiguration

FCCM '00 Proceedings of the 2000 IEEE Symposium on Field-Programmable Custom Computing Machines
Stochastic Local Search: Foundations & Applications

Stochastic Local Search: Foundations & Applications
Designing Reliable Systems from Unreliable Components: The Challenges of Transistor Variability and Degradation

IEEE Micro
ElastIC: An Adaptive Self-Healing Architecture for Unpredictable Silicon

IEEE Design & Test
Reunion: Complexity-Effective Multicore Redundancy

Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture
Configurable isolation: building high availability systems with commodity multi-core processors

Proceedings of the 34th annual international symposium on Computer architecture
Online fault tolerance for FPGA logic blocks

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Reliable Systems on Unreliable Fabrics

IEEE Design & Test
Core cannibalization architecture: improving lifetime chip performance for multicore processors in the presence of hard faults

Proceedings of the 17th international conference on Parallel architectures and compilation techniques
The StageNet fabric for constructing resilient multicore systems

Proceedings of the 41st annual IEEE/ACM International Symposium on Microarchitecture
Architectural core salvaging in a multi-core processor for hard-error tolerance

Proceedings of the 36th annual international symposium on Computer architecture
Reconfigurable Computing: The Theory and Practice of FPGA-Based Computation

Reconfigurable Computing: The Theory and Practice of FPGA-Based Computation
Chip-Level Redundancy in Distributed Shared-Memory Multiprocessors

PRDC '09 Proceedings of the 2009 15th IEEE Pacific Rim International Symposium on Dependable Computing
The SARC Architecture

IEEE Micro
StageNet: A Reconfigurable Fabric for Constructing Dependable CMPs

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article, new heuristic-search methods and algorithms are presented for enabling highly efficient and adaptive, defect-tolerant multiprocessor arrays. We consider systems where a homogeneous multiprocessor array lies on top of reconfigurable interconnects which allow the pipeline stages of the processors to be connected in all possible configurations. Considering the multiprocessor array partitioned in substitutable units at the granularity of pipeline stages, we employ a variety of heuristic-search methods and algorithms to isolate and replace defective units. The proposed heuristics are designed for off-line execution and aim at minimizing the performance overhead necessarily introduced to the array by the interconnects' latency. An empirical evaluation of the designed algorithms is then carried out, in order to assess the targeted problem and the efficacy of our approach. Our findings indicate this to be a NP-complete computational problem, however, our heuristic-search methods can achieve, for the problem sizes we exhaustively searched, 100% accuracy in finding the optimal solution among 1019 possible candidates within 2.5 seconds. Alternatively, they can provide near-optimal solutions at an accuracy which consistently exceeds 70% (compared to the optimal solution) in only 10-4 seconds.