(Enter summary)
Abstract: In this paper we present five new on-line algorithms for servicing
soft aperiodic requests in real-time systems, where a set of hard periodic
tasks is scheduled using the Earliest Deadline First (EDF) algorithm. All
the proposed solutions can achieve full processor utilization and enhance
aperiodic responsiveness, still guaranteeing the execution of the periodic
tasks. Operation of the algorithms, performance, schedulability analysis,
and implementation complexity are discussed and... (Update)
Context of citations to this paper: More
.... real time systems and many e ective approaches have appeared in the literature aimed at improving the responsiveness of SRT tasks [1, 16, 10, 17] but as pointed out in [2] their complexity induce high overheads when used on line. In addition, most presuppose restrictive...
Cited by: More
Traffic Shaping in Real-Time Distributed Systems: a.. - Gaujal, Navet (1999)
(Correct)
Active bibliography (related documents): More All
0.1: Scheduling Aperiodic Tasks in Dynamic Priority Systems - Spuri, Buttazzo (1996)
(Correct)
0.1: Robust Aperiodic Scheduling under Dynamic Priority Systems - Spuri, Buttazzo, Sensini (1995)
(Correct)
0.1: Using Application Benefit for Proactive Resource.. - Asynchronous Real-Time ..
(Correct)
Similar documents based on text: More All
0.7: Implications of Classical Scheduling Results For.. - Stankovic, Spuri.. (1994)
(Correct)
0.6: Sharing Resources among Periodic and Aperiodic Tasks.. - Caccamo, Lipari.. (1999)
(Correct)
0.6: How to Integrate Precedence Constraints and Shared Resources .. - Spuri, Stankovic (1994)
(Correct)
BibTeX entry: (Update)
M. Spuri and G. Buttazzo. Scheduling Aperiodic Tasks in Dynamic Priority http://citeseer.ist.psu.edu/619647.html More
@misc{ spuri-scheduling,
author = "M. Spuri and G. Buttazzo",
title = "Scheduling Aperiodic Tasks in Dynamic Priority",
text = "M. Spuri and G. Buttazzo. Scheduling Aperiodic Tasks in Dynamic Priority",
url = "citeseer.ist.psu.edu/619647.html" }
Citations (may not include all citations):
1582
Scheduling Algorithms for Multiprogramming in a Hard real-Ti..
- Liu, Layland - 1973
336
The Rate Monotonic Scheduling Algorithm: Exact Characterizat.. (context) - Lehoczky, Sha et al. - 1989
188
Aperiodic Task Scheduling for Hard-Real-Time Systems (context) - Sprunt, Sha et al. - 1989
160
Fundamental Design Problems of Distributed Systems for the H.. (context) - Mok - 1983
113
An Optimal Algorithm for Scheduling Soft-Aperiodic Tasks in .. (context) - Lehoczky, Ramos-Thuel - 1992
106
Enhanced Aperiodic Responsiveness in Hard Real-Time Environm.. (context) - Lehoczky, Sha et al. - 1987
104
Stack-Based Scheduling of Real-Time Processes (context) - Baker - 1991
86
Some Results of the Earliest Deadline Scheduling Algorithm (context) - Chetto, Chetto - 1989
65
Dynamic Priority Ceilings: A Concurrency Control Protocol fo.. (context) - Chen, Lin - 1990
62
Scheduling Slack Time in Fixed Priority Preemptive Systems
- Davis, Tindell et al. - 1993
50
Aperiodic Servers In A Deadline Scheduling Environment (context) - Ghazalie, Baker - 1995
34
Dynamic Scheduling of RealTime Tasks under Precedence Constr.. (context) - Chetto, Silly et al. - 1990
19
RED: A Robust Earliest Deadline Scheduling Algorithm (context) - Buttazzo, Stankovic - 1993
10
line Scheduling of Hard Deadline Aperiodic Tasks in Fixed-Pr.. (context) - Ramos-Thuel, Lehoczky - 1993
Documents on the same site (http://www.cs.umd.edu/users/rich/courses/cmsc818G-s98/resources.html): More
Lottery Scheduling: Flexible Proportional-Share Resource.. - Waldspurger, Weihl (1994)
(Correct)
ARX/ULTRA: A New Real-Time Kernel Architecture for Supporting .. - Hong, Seo, Park (1997)
(Correct)
Holistic Schedulability for DISTRIBUTED Hard REAL-TIME SYSTEMS - Tindell, Clark (1994)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC