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

by Giorgio C. Buttazzo

Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications is a basic treatise on real-time computing, with particular emphasis on predictable scheduling algorithms. It introduces the fundamental concepts of real-time computing, illustrates the most significant results in the field, and provides the essential methodologies for designing predictable computing systems which can be used to support critical control applications.

This volume serves as a textbook for advanced level courses on the topic. Each chapter provides basic concepts, which are followed by algorithms that are illustrated with concrete examples, figures and tables. Exercises are included with each chapter and solutions are given at the end of the book. The book also provides an excellent reference for those interested in real-time computing for designing and/or developing predictable control applications.

Genres: Computer Science, Science

438 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.