An algorithm for real-time fault-tolerant scheduling in multiprocessor systems

In this paper, we consider using hardware and software redundancy to guarantee task deadlines in a hard real-time mu1 tiprocessor system even in the presence of processor failures. A set of scheduling requirements for the real-time fault-tolerant multiprocessor scheduling problem is first identified and a heuristic algorithm is then proposed to solve the problem. Experimental results show that the algo-rithm finds optimal solutions in most of the cases. I