Journal Article10.1109/32.601081
An optimal algorithm for scheduling soft aperiodic tasks in dynamic-priority preemptive systems
59
TL;DR: The proposed algorithm is shown to be optimal in terms of providing the shortest aperiodic response time among fixed and dynamic priority schedulers and always guarantees the proper execution of periodic hard tasks.
read more
Abstract: The paper addresses the problem of jointly scheduling tasks with both hard and soft real time constraints. We present a new analysis applicable to systems scheduled using a priority preemptive dispatcher, with priorities assigned dynamically according to the EDF policy. Further, we present a new efficient online algorithm (the acceptor algorithm) for servicing aperiodic work load. The acceptor transforms a soft aperiodic task into a hard one by assigning a deadline. Once transformed, aperiodic tasks are handled in exactly the same way as periodic tasks with hard deadlines. The proposed algorithm is shown to be optimal in terms of providing the shortest aperiodic response time among fixed and dynamic priority schedulers. It always guarantees the proper execution of periodic hard tasks. The approach is composed of two parts: an offline analysis and a run time scheduler. The offline algorithm runs in pseudopolynomial time O(mn), where n is the number of hard periodic tasks and m is the hyperperiod/min deadline.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Fixed priority pre-emptive scheduling: an historical perspective
TL;DR: An historical perspective on the development of fixed priority pre-emptive scheduling is provided for the implementation of real-time systems.
419
A hardware scheduler for complex real-time systems
Sergio Sáez,J. Vila,Alfons Crespo,A. García +3 more
- 12 Jul 1999
TL;DR: A complete hardware architecture that implements slack stealing in hardware using an optimal algorithm that has been completely redesigned to perform efficiently in hardware is introduced.
98
Verification and Scheduling Techniques for Real-Time Embedded Systems
Luis-Alejandro Cortes
- 01 Jan 2005
TL;DR: Modeling and verification techniques targeted towards hard real-time systems, where correctness, both logical and temporal, is of prime importance, are proposed and an approach to the formal verification of systems represented in the modeling formalism is introduced.
Patent
Methods and apparatus for sharing slack in a time-partitioned system
Pamela A. Binns,Aaron Larson +1 more
- 29 Dec 2000
TL;DR: In this article, slack is stolen from both timeline and reclaimed slack to enable the execution of high priority non-essential tasks on a best efforts basis, and idle time is calculated by priority level.
85
Patent
Method and apparatus for slack stealing with dynamic threads
Pamela A. Binns
- 29 Dec 2000
TL;DR: In this paper, slack is stolen from both timeline and reclaimed slack to enable the execution of high priority non-essential tasks on a best efforts basis, and Idle time is calculated by priority level.
60
References
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
C. L. Liu,James W. Layland +1 more
TL;DR: The problem of multiprogram scheduling on a single processor is studied from the viewpoint of the characteristics peculiar to the program functions that need guaranteed service and it is shown that an optimum fixed priority scheduler possesses an upper bound to processor utilization.
Preemptively scheduling hard-real-time sporadic tasks on one processor
Sanjoy Baruah,Aloysius K. Mok,Louis E. Rosier +2 more
- 05 Dec 1990
TL;DR: The authors first give necessary and sufficient conditions for a sporadic task system to be feasible (i.e., schedulable) and lead to a feasibility test that runs in efficient pseudo-polynomial time for a very large percentage of sporadic task systems.
810
•Proceedings Article
Control Robotics: The Procedural Control of Physical Processes.
Michael L. Dertouzos
- 01 Jan 1974
726
Some Results of the Earliest Deadline Scheduling Algorithm
Houssine Chetto,Maryline Chetto +1 more
TL;DR: This paper reports results from some investigations into the problem of making optimum use of the remaining processor idle time in scheduling perlodk tasks, and provides an elRcient algorlthm lor determining maximum quantity of total idle time available between any two instants.
475