How Long to Read Deadline Scheduling for Real-Time Systems

How Long Does it Take to Read Deadline Scheduling for Real-Time Systems?

It takes the average reader 4 hours and 40 minutes to read Deadline Scheduling for Real-Time Systems by John A. Stankovic

Assuming a reading speed of 250 words per minute. Learn more

Description

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.

How long is Deadline Scheduling for Real-Time Systems?

Deadline Scheduling for Real-Time Systems by John A. Stankovic is 280 pages long, and a total of 70,000 words.

This makes it 94% the length of the average book. It also has 86% more words than the average book.

How Long Does it Take to Read Deadline Scheduling for Real-Time Systems Aloud?

The average oral reading speed is 183 words per minute. This means it takes 6 hours and 22 minutes to read Deadline Scheduling for Real-Time Systems aloud.

What Reading Level is Deadline Scheduling for Real-Time Systems?

Deadline Scheduling for Real-Time Systems is suitable for students ages 12 and up.

Note that there may be other factors that effect this rating besides length that are not factored in on this page. This may include things like complex language or sensitive topics not suitable for students of certain ages.

When deciding what to show young students always use your best judgement and consult a professional.

Where Can I Buy Deadline Scheduling for Real-Time Systems?

Deadline Scheduling for Real-Time Systems by John A. Stankovic is sold by several retailers and bookshops. However, Read Time works with Amazon to provide an easier way to purchase books.

To buy Deadline Scheduling for Real-Time Systems by John A. Stankovic on Amazon click the button below.