“Global Laxity-Based Scheduling on Multiprocessor Resource Reservations”
Revision as of 13:21, 1 April 2017 by Ruf
Extended Abstract in 4th International Real-Time Scheduling Open Problems Seminar (RTSOPS 2013), Paris, France, Jul. 2013, pp. 12–13.
Abstract: In this paper, we focus on the problem of scheduling a task set on a multiprocessor resource reservation, i.e., in a scenario in which some (or all) processors may be at some times unavailable. We focus on the approach of adding laxity-based priority assignment decisions to EDF, as in the case of EDZL.
Research line(s): Timeliness and Adaptation in Dependable Systems (TADS)