A soft aperiodic task scheduling algorithm in dynamic-priority systems

Authors:
Sungyoung Lee;Hyungill Kim;Jongwon Lee
Affiliations:
-;-;-
Venue:
RTCSA '95 Proceedings of the 2nd International Workshop on Real-Time Computing Systems and Applications
Year:
1995

Citing 6
Cited 0

Some Results of the Earliest Deadline Scheduling Algorithm

IEEE Transactions on Software Engineering
Dynamic priority scheduling of periodic and aperiodic tasks in hard real-time systems

Real-Time Systems
Scheduling periodic and aperiodic tasks using the slack stealing algorithm

Advances in real-time systems
Scheduling of hard aperiodic tasks

LCTES '95 Proceedings of the ACM SIGPLAN 1995 workshop on Languages, compilers, & tools for real-time systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Utilizing slack time for aperiodic and sporadic requests scheduling in real-time systems

Utilizing slack time for aperiodic and sporadic requests scheduling in real-time systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a joint scheduling of hard deadline periodic and soft deadline aperiodic tasks in dynamic-priority systems. The proposed algorithm has extended the fixed-critical task indicating (CTI) algorithm developed by the authors previously (1995). The dynamic-CTI algorithm is operated in such a way that dynamic-priority assignment strategy for a given periodic task set and the information on a deadlinewise preassignment table, called dynamic-CTI table, are mixed dynamically according to the aperiodic tasks' arrivals at runtime. The algorithm has a predictability and a less computational complexity in calculating the slacks since it uses the dynamic-CTI table. Our simulation study shows that the dynamic-CTI scheduling has better performance than the fixed-CTI algorithm which is even better than the slack stealing algorithms, especially under a heavy, transient overload.