Provided by: Linkoping University
Date Added: Jun 2008
In this paper, the authors present an approach for scheduling with preemption for fault-tolerant embedded systems composed of soft and hard real-time processes. They are interested to maximize the overall utility for average, most likely to happen, scenarios and to guarantee the deadlines for the hard processes in the worst case scenarios. In many applications, the worst-case execution times of processes can be much longer than their average execution times. Thus, designs for the worst-case can be overly pessimistic, i.e., result in low overall utility.