Logo - springer
Slogan - springer

Computer Science - Communication Networks | Deadline Scheduling for Real-Time Systems - EDF and Related Algorithms

Deadline Scheduling for Real-Time Systems

EDF and Related Algorithms

Stankovic, J.A., Spuri, M., Ramamritham, K., Buttazzo, G.C.

1998, XVI, 273 p.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$179.00

(net) price for USA

ISBN 978-1-4615-5535-3

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Hardcover
Information

Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$229.00

(net) price for USA

ISBN 978-0-7923-8269-0

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$229.00

(net) price for USA

ISBN 978-1-4613-7530-2

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

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.

Content Level » Research

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

Related subjects » Communication Networks - Computer Science

Table of contents 

List of Figures. List of Tables. Preface. 1. Introduction. 2. Terminology and Assumptions. 3. Fundamentals of EDF Scheduling. 4. Response Times under EDF Scheduling. 5. Planning-Based Scheduling. 6. EDF Scheduling for Shared Resources. 7. Precedence Constraints and Shared Resources. 8. Aperiodic Task Scheduling. 9. Distributed Scheduling - Part I. 10. Distributed Scheduling - Part II. 11. Summary and Open Questions. Index.

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Special Purpose and Application-Based Systems.