Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications

by Giorgio C. Buttazzo

Preface. 1. A General View. 2. Basic Concepts. 3. Aperiodic Task Scheduling. 4. Periodic Task Scheduling. 5. Fixed-Priority Servers. 6. Dynamic Priority Servers. 7. Resource Access Protocols. 8. Handling Overload Conditions. 9. Kernel Design Issues. 10. Application Design Issues. 11. Examples of Real-Time Systems. Glossary. References. Index.

Genres: Computer Science, Science

398 pages, Paperback

First published January 15, 1997

Reviews

[Nathan · Rating 4 out of 5]

A very strong look at modern scheduling algorithms to ~2009. It analyses earliest deadline first and the classic optimality solutions for periodic and aperiodic systems, both online and offline, and then provides a deeper look at guarantees and priority systems and many of the recent algorithms for overload resolution. What I really liked most was that it understood the importance of synchronisation schemes on preemption algorithms and explored a number of modern algorithms on fighting priority inversion and other negatives of naive locking primitives. I had only heard of priority inheritance before reading this, and now I see that one can do much better.