Advertisement

Deadline Scheduling for Real-Time Systems

EDF and Related Algorithms

  • John A. Stankovic
  • Marco Spuri
  • Krithi Ramamritham
  • Giorgio C. Buttazzo

Table of contents

  1. Front Matter
    Pages i-xvi
  2. John A. Stankovic, Marco Spuri, Krithi Ramamritham, Giorgio C. Buttazzo
    Pages 1-11
  3. John A. Stankovic, Marco Spuri, Krithi Ramamritham, Giorgio C. Buttazzo
    Pages 13-26
  4. John A. Stankovic, Marco Spuri, Krithi Ramamritham, Giorgio C. Buttazzo
    Pages 27-65
  5. John A. Stankovic, Marco Spuri, Krithi Ramamritham, Giorgio C. Buttazzo
    Pages 67-86
  6. John A. Stankovic, Marco Spuri, Krithi Ramamritham, Giorgio C. Buttazzo
    Pages 87-120
  7. John A. Stankovic, Marco Spuri, Krithi Ramamritham, Giorgio C. Buttazzo
    Pages 121-150
  8. John A. Stankovic, Marco Spuri, Krithi Ramamritham, Giorgio C. Buttazzo
    Pages 151-168
  9. John A. Stankovic, Marco Spuri, Krithi Ramamritham, Giorgio C. Buttazzo
    Pages 169-196
  10. John A. Stankovic, Marco Spuri, Krithi Ramamritham, Giorgio C. Buttazzo
    Pages 197-228
  11. John A. Stankovic, Marco Spuri, Krithi Ramamritham, Giorgio C. Buttazzo
    Pages 229-261
  12. John A. Stankovic, Marco Spuri, Krithi Ramamritham, Giorgio C. Buttazzo
    Pages 263-267
  13. Back Matter
    Pages 269-273

About this book

Introduction

Many real-time systems rely on static scheduling algorithms. This includes cyclic scheduling, rate monotonic scheduling and fixed schedules created by off-line scheduling techniques such as dynamic programming, heuristic search, and simulated annealing. However, for many real-time systems, static scheduling algorithms are quite restrictive and inflexible. For example, highly automated agile manufacturing, command, control and communications, and distributed real-time multimedia applications all operate over long lifetimes and in highly non-deterministic environments. Dynamic real-time scheduling algorithms are more appropriate for these systems and are used in such systems. Many of these algorithms are based on earliest deadline first (EDF) policies. There exists a wealth of literature on EDF-based scheduling with many extensions to deal with sophisticated issues such as precedence constraints, resource requirements, system overload, multi-processors, and distributed systems.
Deadline Scheduling for Real-Time Systems: EDF and Related Algorithms aims at collecting a significant body of knowledge on EDF scheduling for real-time systems, but it does not try to be all-inclusive (the literature is too extensive). The book primarily presents the algorithms and associated analysis, but guidelines, rules, and implementation considerations are also discussed, especially for the more complicated situations where mathematical analysis is difficult.
In general, it is very difficult to codify and taxonomize scheduling knowledge because there are many performance metrics, task characteristics, and system configurations. Also, adding to the complexity is the fact that a variety of algorithms have been designed for different combinations of these considerations. In spite of the recent advances there are still gaps in the solution space and there is a need to integrate the available solutions. For example, a list of issues to consider includes:
  • preemptive versus non-preemptive tasks,
  • uni-processors versus multi-processors,
  • using EDF at dispatch time versus EDF-based planning,
  • precedence constraints among tasks,
  • resource constraints,
  • periodic versus aperiodic versus sporadic tasks,
  • scheduling during overload,
  • fault tolerance requirements, and
  • providing guarantees and levels of guarantees (meeting quality of service requirements).

Deadline Scheduling for Real-Time Systems: EDF and Related Algorithms should be of interest to researchers, real-time system designers, and instructors and students, either as a focussed course on deadline-based scheduling for real-time systems, or, more likely, as part of a more general course on real-time computing. The book serves as an invaluable reference in this fast-moving field.

Keywords

Quality of Service Quality of Service (QoS) Scheduling algorithms complexity configuration control distributed systems metrics multimedia performance processor programming real-time system time

Authors and affiliations

  • John A. Stankovic
    • 1
  • Marco Spuri
    • 2
  • Krithi Ramamritham
    • 3
  • Giorgio C. Buttazzo
    • 4
  1. 1.University of VirginiaCharlottesvilleUSA
  2. 2.Merloni Elettrodomestici SpaFabrianoItaly
  3. 3.University of MassachusettsAmherstUSA
  4. 4.Scuola Superiore S. AnnaPisaItaly

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4615-5535-3
  • Copyright Information Kluwer Academic Publishers 1998
  • Publisher Name Springer, Boston, MA
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4613-7530-2
  • Online ISBN 978-1-4615-5535-3
  • Series Print ISSN 0893-3405
  • Buy this book on publisher's site