Description: Deadline Scheduling for Real-Time Systems Please note: this item is printed on demand and will take extra time before it can be dispatched to you (up to 20 working days). EDF and Related Algorithms Author(s): John A. Stankovic, Marco Spuri, Krithi Ramamritham, Giorgio C Buttazzo Format: Paperback Publisher: Springer-Verlag New York Inc., United States Imprint: Springer-Verlag New York Inc. ISBN-13: 9781461375302, 978-1461375302 Synopsis 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.
Price: 103.96 GBP
Location: Aldershot
End Time: 2025-01-22T12:34:11.000Z
Shipping Cost: 40.65 GBP
Product Images
Item Specifics
Return postage will be paid by: Buyer
Returns Accepted: Returns Accepted
After receiving the item, your buyer should cancel the purchase within: 60 days
Return policy details:
Book Title: Deadline Scheduling for Real-Time Systems
Number of Pages: 273 Pages
Language: English
Publication Name: Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Publisher: Springer-Verlag New York Inc.
Publication Year: 2013
Subject: Computer Science
Item Height: 235 mm
Item Weight: 450 g
Type: Textbook
Author: Giorgio C Buttazzo, John A. Stankovic, Krithi Ramamritham, Marco Spuri
Series: The Springer International Series in Engineering and Computer Science
Item Width: 155 mm
Format: Paperback
