Skip to main content
  • Book
  • © 1998

Deadline Scheduling for Real-Time Systems

EDF and Related Algorithms

Part of the book series: The Springer International Series in Engineering and Computer Science (SECS, volume 460)

Buy it now

Buying options

eBook USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (11 chapters)

  1. Front Matter

    Pages i-xvi
  2. Introduction

    • John A. Stankovic, Marco Spuri, Krithi Ramamritham, Giorgio C. Buttazzo
    Pages 1-11
  3. Terminology and Assumptions

    • John A. Stankovic, Marco Spuri, Krithi Ramamritham, Giorgio C. Buttazzo
    Pages 13-26
  4. Fundamentals of EDF Scheduling

    • John A. Stankovic, Marco Spuri, Krithi Ramamritham, Giorgio C. Buttazzo
    Pages 27-65
  5. Response Times under EDF Scheduling

    • John A. Stankovic, Marco Spuri, Krithi Ramamritham, Giorgio C. Buttazzo
    Pages 67-86
  6. Planning-Based Scheduling

    • John A. Stankovic, Marco Spuri, Krithi Ramamritham, Giorgio C. Buttazzo
    Pages 87-120
  7. EDF Scheduling for Shared Resources

    • John A. Stankovic, Marco Spuri, Krithi Ramamritham, Giorgio C. Buttazzo
    Pages 121-150
  8. Precedence Constraints and Shared Resources

    • John A. Stankovic, Marco Spuri, Krithi Ramamritham, Giorgio C. Buttazzo
    Pages 151-168
  9. Aperiodic Task Scheduling

    • John A. Stankovic, Marco Spuri, Krithi Ramamritham, Giorgio C. Buttazzo
    Pages 169-196
  10. Distributed Scheduling — Part I

    • John A. Stankovic, Marco Spuri, Krithi Ramamritham, Giorgio C. Buttazzo
    Pages 197-228
  11. Distributed Scheduling — Part II

    • John A. Stankovic, Marco Spuri, Krithi Ramamritham, Giorgio C. Buttazzo
    Pages 229-261
  12. Summary and Open Questions

    • John A. Stankovic, Marco Spuri, Krithi Ramamritham, Giorgio C. Buttazzo
    Pages 263-267
  13. Back Matter

    Pages 269-273

About this book

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.

Authors and Affiliations

  • University of Virginia, Charlottesville, USA

    John A. Stankovic

  • Merloni Elettrodomestici Spa, Fabriano, Italy

    Marco Spuri

  • University of Massachusetts, Amherst, USA

    Krithi Ramamritham

  • Scuola Superiore S. Anna, Pisa, Italy

    Giorgio C. Buttazzo

Bibliographic Information

Buy it now

Buying options

eBook USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access