Error Models and Fault-Secure Scheduling in Multiprocessor Systems

摘要

A schedule for a parallel program is said to be 1- fault-secure if a system that uses the schedule can either pro- duce correct output for the program or detect the presence of any faults in a single processor. Although several fault-secure scheduling algorithms have been proposed, they can all only be applied to a class of tree-structured task graphs with a uniform computation cost. Besides, they assume a stringent error model, called the redeemable error model, that considers extremely un- likely cases.