TY - GEN
T1 - MC-fluid
T2 - 35th IEEE Real-Time Systems Symposium, RTSS 2014
AU - Lee, Jaewoo
AU - Phan, Kieu My
AU - Gu, Xiaozhe
AU - Lee, Jiyeon
AU - Easwaran, Arvind
AU - Shin, Insik
AU - Lee, Insup
N1 - Publisher Copyright:
© 2014 IEEE.
PY - 2015/1/14
Y1 - 2015/1/14
N2 - A mixed-criticality system consists of multiple components with different criticalities. While mixed-criticality scheduling has been extensively studied for the uniprocessor case, the problem of efficient scheduling for the multiprocessor case has largely remained open. We design a fluid model-based multiprocessor mixed-criticality scheduling algorithm, called MC-Fluid, in which each task is executed in proportion to its criticality-dependent rate. We propose an exact schedulability condition for MC-Fluid and an optimal assignment algorithm for criticality-dependent execution rates with polynomial complexity. Since MC-Fluid cannot construct a schedule on real hardware platforms due to the fluid assumption, we propose MC-DP-Fair algorithm, which can generate a non-fluid schedule while preserving the same schedulability properties as MC-Fluid. We show that MC-Fluid has a speedup factor of (1 + v 5)/2 ( 1.618), which is best known in multiprocessor MC scheduling, and simulation results show that MC-DP-Fair outperforms all existing algorithms.
AB - A mixed-criticality system consists of multiple components with different criticalities. While mixed-criticality scheduling has been extensively studied for the uniprocessor case, the problem of efficient scheduling for the multiprocessor case has largely remained open. We design a fluid model-based multiprocessor mixed-criticality scheduling algorithm, called MC-Fluid, in which each task is executed in proportion to its criticality-dependent rate. We propose an exact schedulability condition for MC-Fluid and an optimal assignment algorithm for criticality-dependent execution rates with polynomial complexity. Since MC-Fluid cannot construct a schedule on real hardware platforms due to the fluid assumption, we propose MC-DP-Fair algorithm, which can generate a non-fluid schedule while preserving the same schedulability properties as MC-Fluid. We show that MC-Fluid has a speedup factor of (1 + v 5)/2 ( 1.618), which is best known in multiprocessor MC scheduling, and simulation results show that MC-DP-Fair outperforms all existing algorithms.
KW - mixed-criticality
KW - multiprocessor scheduling
KW - schedulability analysis
KW - scheduling algorithm
UR - http://www.scopus.com/inward/record.url?scp=84936936796&partnerID=8YFLogxK
U2 - 10.1109/RTSS.2014.32
DO - 10.1109/RTSS.2014.32
M3 - Conference contribution
AN - SCOPUS:84936936796
T3 - Proceedings - Real-Time Systems Symposium
SP - 41
EP - 52
BT - Proceedings - IEEE 35th Real-Time Systems Symposium, RTSS 2014
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 2 December 2014 through 5 December 2014
ER -