Hard Real-Time Computing Systems [electronic resource] : Predictable Scheduling Algorithms and Applications /

A General View -- Basic Concepts -- A Periodic Task Scheduling -- Periodic Task Scheduling -- Fixed-Priority Servers -- Dynamic Priority Servers -- Resource Access Protocols -- Limited Preemptive Scheduling -- Handling Overload Conditions -- Kernel Design Issues -- Application Design Issues -- Implementing Periodic Tasks in LINUX -- Real-Time Operating Systems and Standards -- Solutions to the Exercises -- References -- Index.

This book is a basic treatise on real-time computing, with particular emphasis on predictable scheduling algorithms. The main objectives of the book are to introduce the basic concepts of real-time computing, illustrate the most significant results in the field, and provide the basic methodologies for designing predictable computing systems useful in supporting critical control applications. Hard Real-Time Computing Systems is written for instructional use and is organized to enable readers without a strong knowledge of the subject matter to quickly grasp the material. Technical concepts are clearly defined at the beginning of each chapter, and algorithm descriptions are corroborated through concrete examples, illustrations, and tables. This new, fourth edition includes new sections to explain the variable-rate task model, how to improve predictability and safety in cyber-physical real-time systems that exploit machine learning algorithms, additional coverage on Response Time Analysis, and a new chapter on implementing periodic real-time tasks under Linux.