TY - GEN
T1 - Compositional real-time scheduling of mixed-criticality real-time systems
AU - Ali, Amjad
AU - Kim, Kyong Hoon
N1 - Publisher Copyright:
© 2014 IEEE.
PY - 2014/11/3
Y1 - 2014/11/3
N2 - Compositional real-time scheduling frameworks provide ways for building large and complex real-time embedded systems from independent sub-systems. This paper introduces a novel scheme for scheduling a component of Mixed-Criticality (MC) sporadic tasks on uniprocessor system. It characterizes the mixed criticality resource allocations, and the interface model for abstracting the real-time requirements of such a component. The demand bound function and supply bound function for the low and high criticality modes are derived to determine the schedulability of a component in both modes. The execution times of jobs are monitored in this approach. If it is detected that the behavior of system is inconsistent with low criticality level, then tasks of low criticalities are discarded and the priorities of high criticality tasks are re-ordered in high criticality mode to guarantee the schedulabilty of high criticality tasks. We propose a new algorithm, which schedules a component of mixed criticality jobs in low mode through MC Rate Monotonic (MC-RM) algorithm by applying period transformation, and guarantees the schedulabilty by using MC Earliest Deadline First (MC-EDF) algorithm in high mode.
AB - Compositional real-time scheduling frameworks provide ways for building large and complex real-time embedded systems from independent sub-systems. This paper introduces a novel scheme for scheduling a component of Mixed-Criticality (MC) sporadic tasks on uniprocessor system. It characterizes the mixed criticality resource allocations, and the interface model for abstracting the real-time requirements of such a component. The demand bound function and supply bound function for the low and high criticality modes are derived to determine the schedulability of a component in both modes. The execution times of jobs are monitored in this approach. If it is detected that the behavior of system is inconsistent with low criticality level, then tasks of low criticalities are discarded and the priorities of high criticality tasks are re-ordered in high criticality mode to guarantee the schedulabilty of high criticality tasks. We propose a new algorithm, which schedules a component of mixed criticality jobs in low mode through MC Rate Monotonic (MC-RM) algorithm by applying period transformation, and guarantees the schedulabilty by using MC Earliest Deadline First (MC-EDF) algorithm in high mode.
UR - http://www.scopus.com/inward/record.url?scp=84916226020&partnerID=8YFLogxK
U2 - 10.1109/DASC.2014.89
DO - 10.1109/DASC.2014.89
M3 - Conference contribution
AN - SCOPUS:84916226020
T3 - Proceedings - 2014 World Ubiquitous Science Congress: 2014 IEEE 12th International Conference on Dependable, Autonomic and Secure Computing, DASC 2014
SP - 464
EP - 469
BT - Proceedings - 2014 World Ubiquitous Science Congress
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 12th IEEE International Conference on Dependable, Autonomic and Secure Computing, DASC 2014
Y2 - 24 August 2014 through 27 August 2014
ER -