Fault-Tolerant Real Time Multiprocessor SchedulingReport
Multiprocessors are increasingly used to support hard real - time systems. The increase in the number of processors in a system makes a system susceptible to processor failures. Fault-tolerant mechanisms as well as realtime scheduling techniques should be used together to ensure that hard realtime systems continue to operate correctly even in the presence of processor failures, since ‘deadline missing in a hard real-time system may result in catastrophic consequences. In this paper, we present approaches to achieving fau1t - tolei'ance in hard real - time multiprocessor systems. Using the primarybackup copy approach, we propose two efficient scheduling algorithms to solve a special case of the general scheduling problem. The scheduling algorithms have the property of generating near-optimal solutions to the problem as well as determining the amount of redundancy required to achieve the desired level of fault-tolerance. Experimental results are obtained to evaluate the performance of the heuristics:
Note: Abstract extracted from PDF file via OCR
All rights reserved (no additional license for public reuse)
Oh, Yingfeng, and S Son. "Fault-Tolerant Real Time Multiprocessor Scheduling." University of Virginia Dept. of Computer Science Tech Report (1992).
University of Virginia, Department of Computer Science