Dario Socci, Peter Poplavko, Saddek Bensalem, Marius Bozga
Mixed Critical Earliest Deadline First (2012)
Mixed Critical Earliest Deadline First (2012)
TR-2012-22.pdf
Keywords: real-time, mixed critical, scheduling
Abstract: Using the advances of the modern microelectronics technology, the safety-critical systems, such as avionics, can reduce their costs by integrating multiple tasks on one device. This makes such systems essentially mixed-critical, as this brings together different tasks whose error probability requirements may differ by a factor of one million. In the context of mixed-critical scheduling theory, we studied the problem of scheduling a finite set of jobs. In this work we propose an algorithm which is proved to dominate OCBP, one of the best scheduling algorithms for this problem. We show through empirical studies that our algorithm can reduce the set of non-schedulable instances by a factor of 2.5 or, under certain assumptions, by a factor of 4.5, when compared to OCBP.
