TY - GEN
T1 - DC2 scheduling for aperiodic tasks in strongly partitioned real-time systems
AU - Kim, Daeyoung
AU - Lee, Yann-Hang
PY - 2000/1/1
Y1 - 2000/1/1
N2 - The strongly partitioned real time system (SP-RTS) provides temporal and spatial partitioning for its integrated real time applications. The SP-RTS architecture adopts a two-level hierarchical scheduling mechanism. In the lower level, multiple partitions (applications) are dispatched under a cyclic scheduling, whereas, in the higher level, multiple periodic tasks of each partition are scheduled according to a fixed priority algorithm. The authors focus on designing algorithms for online scheduling of aperiodic tasks in the SP-RTS environment. The Distance Constraint guaranteed Dynamic Cyclic (DC2) scheduler that is proposed uses these basic operations: Left Sliding (LS), Right Putting (RP), and Compacting. These operations dynamically schedule aperiodic tasks within a distance-constrained cyclic schedule. We show that the dynamic applications of these operations do not violate the distance constraint characteristics of a partition cyclic schedule. In addition, the slack time calculation of these dynamic operations can be applied for scheduling hard aperiodic tasks. With the simulation studies, we observed that the DC2 can result in a significant performance enhancement in terms of the average response time of soft aperiodic tasks and the acceptance rate for hard aperiodic tasks.
AB - The strongly partitioned real time system (SP-RTS) provides temporal and spatial partitioning for its integrated real time applications. The SP-RTS architecture adopts a two-level hierarchical scheduling mechanism. In the lower level, multiple partitions (applications) are dispatched under a cyclic scheduling, whereas, in the higher level, multiple periodic tasks of each partition are scheduled according to a fixed priority algorithm. The authors focus on designing algorithms for online scheduling of aperiodic tasks in the SP-RTS environment. The Distance Constraint guaranteed Dynamic Cyclic (DC2) scheduler that is proposed uses these basic operations: Left Sliding (LS), Right Putting (RP), and Compacting. These operations dynamically schedule aperiodic tasks within a distance-constrained cyclic schedule. We show that the dynamic applications of these operations do not violate the distance constraint characteristics of a partition cyclic schedule. In addition, the slack time calculation of these dynamic operations can be applied for scheduling hard aperiodic tasks. With the simulation studies, we observed that the DC2 can result in a significant performance enhancement in terms of the average response time of soft aperiodic tasks and the acceptance rate for hard aperiodic tasks.
KW - Aerospace electronics
KW - Algorithm design and analysis
KW - Application software
KW - Computational modeling
KW - Dynamic scheduling
KW - Laboratories
KW - Partitioning algorithms
KW - Processor scheduling
KW - Real time systems
KW - Scheduling algorithm
UR - http://www.scopus.com/inward/record.url?scp=77958507071&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77958507071&partnerID=8YFLogxK
U2 - 10.1109/RTCSA.2000.896413
DO - 10.1109/RTCSA.2000.896413
M3 - Conference contribution
AN - SCOPUS:77958507071
T3 - Proceedings - 7th International Conference on Real-Time Computing Systems and Applications, RTCSA 2000
SP - 368
EP - 375
BT - Proceedings - 7th International Conference on Real-Time Computing Systems and Applications, RTCSA 2000
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 7th International Conference on Real-Time Computing Systems and Applications, RTCSA 2000
Y2 - 12 December 2000 through 14 December 2000
ER -