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

by Giorgio C. Buttazzo

This updated edition offers an indispensable exposition on real-time computing, with particular emphasis on predictable scheduling algorithms. It introduces the fundamental concepts of real-time computing, demonstrates the most significant results in the field, and provides the essential methodologies for designing predictable computing systems used to support time-critical control applications. Along with an in-depth guide to the available approaches for the implementation and analysis of real-time applications, this revised edition contains a close examination of recent developments in real-time systems, including limited preemptive scheduling, resource reservation techniques, overload handling algorithms, and adaptive scheduling techniques. This volume serves as a fundamental advanced-level textbook. Each chapter provides basic concepts, which are followed by algorithms, illustrated with concrete examples, figures and tables. Exercises and solutions are provided to enhance self-study, making this an excellent reference for those interested in real-time computing for designing and/or developing predictable control applications.

Genres: Computer Science, Science

540 pages, Hardcover

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.