TY - GEN
T1 - A scheduling model inspired by control theory
AU - Baruah, Sanjoy
AU - Bonifaci, Vincenzo
AU - Marchetti-Spaccamela, Alberto
AU - Verdugo, Victor
N1 - Publisher Copyright:
© 2017 Copyright held by the owner/author(s).
PY - 2017/10/4
Y1 - 2017/10/4
N2 - Certain control computations may be modeled as periodic tasks with the correctness requirement that for each task, the fraction of jobs of the task that complete execution by their respective deadlines be no smaller than a specified value. This appears to be a correctness requirement that has not previously been studied in the real-time scheduling theory community; this paper formulates the problem and proposes some solution strategies.
AB - Certain control computations may be modeled as periodic tasks with the correctness requirement that for each task, the fraction of jobs of the task that complete execution by their respective deadlines be no smaller than a specified value. This appears to be a correctness requirement that has not previously been studied in the real-time scheduling theory community; this paper formulates the problem and proposes some solution strategies.
KW - Control tasks
KW - Periodic preemptive scheduling
KW - Scheduling with dropout
UR - http://www.scopus.com/inward/record.url?scp=85037375717&partnerID=8YFLogxK
U2 - 10.1145/3139258.3139272
DO - 10.1145/3139258.3139272
M3 - Conference contribution
AN - SCOPUS:85037375717
T3 - ACM International Conference Proceeding Series
SP - 78
EP - 87
BT - Proceedings of the 25th International Conference on Real-Time Networks and Systems, RTNS 2017
PB - Association for Computing Machinery
T2 - 25th International Conference on Real-Time Networks and Systems, RTNS 2017
Y2 - 4 October 2017 through 6 October 2017
ER -