TY - GEN
T1 - Feedback-based admission control for hard real-time task allocation under dynamic workload on many-core systems
AU - Dziurzanski, Piotr
AU - Singh, Amit Kumar
AU - Indrusiak, Leandro Soares
N1 - © Springer International Publishing Switzerland. This is an author-produced version of the published paper. Uploaded in accordance with the publisher’s self-archiving policy. Further copying may not be permitted; contact the publisher for details
PY - 2016/3/26
Y1 - 2016/3/26
N2 - In hard real-time systems, a computationally expensive schedulability analysis has to be performed for every task. Fulfilling this requirement is particularly tough when system workload and service capacity are not available a priori and thus the analysis has to be conducted at runtime. This paper presents an approach for applying controltheory-based admission control to predict the task schedulability so that the exact schedulability analysis is performed only to the tasks with positive prediction results. In case of a careful fine-tuning of parameters, the proposed approach can be successfully applied even to many-core embedded systems with hard real-time constraints and other time-critical systems. The provided experimental results demonstrate that, on average, only 62% of the schedulability tests have to be performed in comparison with the traditional, open-loop approach. The proposed approach is particularly beneficial for heavier workloads, where the number of executed tasks is almost unchanged in comparison with the traditional open-loop approach. By our approach, only 32% of exact schedulability tests have to be conducted. Moreover, for the analysed industrial workloads with dependent jobs, the proposed technique admitted and executed 11% more tasks while not violating any timing constraints.
AB - In hard real-time systems, a computationally expensive schedulability analysis has to be performed for every task. Fulfilling this requirement is particularly tough when system workload and service capacity are not available a priori and thus the analysis has to be conducted at runtime. This paper presents an approach for applying controltheory-based admission control to predict the task schedulability so that the exact schedulability analysis is performed only to the tasks with positive prediction results. In case of a careful fine-tuning of parameters, the proposed approach can be successfully applied even to many-core embedded systems with hard real-time constraints and other time-critical systems. The provided experimental results demonstrate that, on average, only 62% of the schedulability tests have to be performed in comparison with the traditional, open-loop approach. The proposed approach is particularly beneficial for heavier workloads, where the number of executed tasks is almost unchanged in comparison with the traditional open-loop approach. By our approach, only 32% of exact schedulability tests have to be conducted. Moreover, for the analysed industrial workloads with dependent jobs, the proposed technique admitted and executed 11% more tasks while not violating any timing constraints.
UR - http://www.scopus.com/inward/record.url?scp=84962426635&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-30695-7_12
DO - 10.1007/978-3-319-30695-7_12
M3 - Conference contribution
AN - SCOPUS:84962426635
SN - 9783319306940
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 157
EP - 169
BT - Architecture of Computing Systems -- ARCS 2016
PB - Springer
T2 - 29th International Conference on Architecture of Computing Systems, ARCS 2016
Y2 - 4 April 2016 through 7 April 2016
ER -