TY - GEN
T1 - Minimal schedulability testing interval for real-time periodic tasks with arbitrary release offsets
AU - Jiang, Yu
AU - Zhou, Qiang
AU - Zou, Xingliang
AU - Cheng, Albert M.K.
N1 - Publisher Copyright:
© 2014 IEEE.
PY - 2014/3/9
Y1 - 2014/3/9
N2 - The concept of feasibility (or schedulability) interval plays a very important role in the schedulability analysis in real-time systems. Existing results on the schedulability testing interval of real-time task sets under fixed priority scheduling with arbitrary release offsets (or phases) have limitations for certain scenarios in constructing a schedule for testing the schedulability of a given task set. In this paper, we propose a transforming method for deriving minimal schedulability testing interval of real-time n-task sets with arbitrary release offsets under fixed priority scheduling in both the classical pre-emptive model and the Priority-based Functional Reactive Programming (P-FRP) model on uniprocessor. The complexity of our transforming method is O(n), and the validity is also proved by theoretical analysis.
AB - The concept of feasibility (or schedulability) interval plays a very important role in the schedulability analysis in real-time systems. Existing results on the schedulability testing interval of real-time task sets under fixed priority scheduling with arbitrary release offsets (or phases) have limitations for certain scenarios in constructing a schedule for testing the schedulability of a given task set. In this paper, we propose a transforming method for deriving minimal schedulability testing interval of real-time n-task sets with arbitrary release offsets under fixed priority scheduling in both the classical pre-emptive model and the Priority-based Functional Reactive Programming (P-FRP) model on uniprocessor. The complexity of our transforming method is O(n), and the validity is also proved by theoretical analysis.
KW - classical preemptive model
KW - feasibility interval
KW - fixed priority scheduling
KW - priority-based functional reactive programming (P-FRP) model
KW - real-time system
KW - schedulability analysis
UR - https://www.scopus.com/pages/publications/84983162477
U2 - 10.1109/HPCC.2014.93
DO - 10.1109/HPCC.2014.93
M3 - 会议稿件
AN - SCOPUS:84983162477
T3 - Proceedings - 16th IEEE International Conference on High Performance Computing and Communications, HPCC 2014, 11th IEEE International Conference on Embedded Software and Systems, ICESS 2014 and 6th International Symposium on Cyberspace Safety and Security, CSS 2014
SP - 611
EP - 614
BT - Proceedings - 16th IEEE International Conference on High Performance Computing and Communications, HPCC 2014, 11th IEEE International Conference on Embedded Software and Systems, ICESS 2014 and 6th International Symposium on Cyberspace Safety and Security, CSS 2014
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 16th IEEE International Conference on High Performance Computing and Communications, HPCC 2014, 11th IEEE International Conference on Embedded Software and Systems, ICESS 2014 and 6th International Symposium on Cyberspace Safety and Security, CSS 2014
Y2 - 20 August 2014 through 22 August 2014
ER -