Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications (Real-Time Systems Series, 24)
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.
Why Read This Book
You will learn how to design and analyze systems that must meet strict timing constraints using provable, practical scheduling algorithms. The book pairs rigorous theory with real-world techniques — from limited preemption and resource reservation to overload and adaptive scheduling — so you can build predictable embedded and real-time systems.
Who Will Benefit
Advanced embedded engineers, real-time systems designers, and graduate students who need to guarantee temporal correctness in time-critical control, automotive, avionics, or industrial IoT applications.
Level: Advanced — Prerequisites: Solid understanding of operating systems and scheduling fundamentals, discrete mathematics/algorithms, basic knowledge of task models and worst-case execution time (WCET) concepts; familiarity with C and embedded development is helpful.
Key Takeaways
- Analyze schedulability using fixed‑priority (Rate Monotonic) and dynamic (Earliest Deadline First) techniques with formal proofs and utilization bounds.
- Design and evaluate predictable scheduling policies including limited preemption, preemption thresholds, and response-time analysis.
- Implement and apply resource reservation and server-based approaches (e.g., periodic servers, constant-bandwidth servers) for temporal isolation.
- Apply overload handling and adaptive scheduling strategies to maintain graceful degradation under transient or sustained overload.
- Model, compute, and verify worst-case response times and integrate WCET considerations into system-level timing guarantees.
- Compare and choose appropriate scheduling strategies for uniprocessor and (introductory) multiprocessor real-time systems based on predictability and utilization trade-offs.
Topics Covered
- Introduction to Real-Time Computing and System Models
- Task and Job Models, Deadlines, and Timing Constraints
- Fixed-Priority Scheduling: Theory and Analysis (Rate Monotonic)
- Dynamic Priority Scheduling: EDF and Related Results
- Response-Time Analysis and Schedulability Tests
- Resource Sharing, Synchronization and Blocking Analysis
- Limited Preemption and Preemption Control Techniques
- Server and Resource Reservation Mechanisms (CBS, Sporadic/Periodic Servers)
- Overload Management and Adaptive Scheduling Techniques
- Multiprocessor and Distributed Real-Time Scheduling (overview)
- Implementation Considerations, Case Studies, and RTOS Integration
- Tool Support, Experimental Evaluation, and Future Directions
Languages, Platforms & Tools
How It Compares
Compared with Jane W. S. Liu's 'Real-Time Systems', Buttazzo's book places more emphasis on predictable scheduling algorithms and practical reservation/overload techniques; it is more applied than purely theoretical surveys.
