Scheduling soft aperiodic tasks in adaptable fixed-priority systems

Authors:
Jongwoon Lee;Sungyoung Lee;Hyungill Kim
Affiliations:
Department of Computer Engineering, Kyunghee University, Seoul, Korea;-;Department of Computer Engineering, Kyunghee University, Seoul, Korea
Venue:
ACM SIGOPS Operating Systems Review
Year:
1996

Citing 5
Cited 1

Some Results of the Earliest Deadline Scheduling Algorithm

IEEE Transactions on Software Engineering
What is predictability for real-time systems?

Real-Time Systems
Dynamic Scheduling of Hard Real-Time Tasks and Real-Time Threads

IEEE Transactions on Software Engineering
Scheduling periodic and aperiodic tasks using the slack stealing algorithm

Advances in real-time systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)

Power-conscious joint scheduling of periodic task graphs and aperiodic tasks in distributed real-time embedded systems

Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new type of scheduling algorithm for servicing soft deadline aperiodic tasks in adaptable fixed-priority real-time systems. The major goals of our proposed task scheduling are not only to guarantee all the deadlines of periodic tasks and to obtain fast response time for aperiodic tasks, but also to retain considerable scheduling predictability. To achieve these goals, we have adopted a new aperiodic task scheduling principle in which a normal fixed-priority assignment strategy and the information on a preassignment table built off-line are properly mingled somewhat dynamically according to the aperiodic tasks' arrivals at runtime. The paper also shows some simulation results in terms of the average aperiodic response time, verifying that the new algorithm offers significant performance improvements over other conventional joint scheduling algorithms, especially under a heavy transient overload.