Graceful Degradation of Adaptive Multiprocessor Systems on a Chip

Sammanfattning: This thesis explores the potential for using existing flexibility in order to allow Multiprocessor Systems on a Chip to function in the presence of permanent faults and to prolong their lifetime. Technology scaling in accordance with Moore’s law brings up reliability challenges and forces the use of potentially unreliable hardware components. However, hardware reconfigurability and workload flexibility can provide the means for permanent fault tolerance and graceful degradation via runtime system management. This work first elaborates on the concept of degradable hardware components and presents a methodology for characterizing each of their possible configurations. This is necessary if we intend to use this reconfigurability in an efficient manner to work around permanent faults. The characterization methodology is used to perform design space exploration aiming to find the optimal reconfiguration granularity for any given fault density. Subsequently, Graceful Degradation of Multiprocessor Systems on a Chip is defined as an optimization problem. Three algorithms are proposed for solving this problem within reasonable time, in order to be applicable at runtime: A novel fast heuristic based on incremental and partially precomputed solutions, and our versions of two well established search algorithms (simulated annealing and genetic algorithm), tailored to the particular problem. The fast heuristic is proven able to find a solution on average 81.9% as good as the exhaustively sought optimal one, in less than 2?sec on average. Our versions of simulated annealing and genetic algorithm find on average better solutions (86.6% and 89.6% as good as the optimal respectively), at the cost of one and two orders of magnitude slower execution time.