<p>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 methodol
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
โ Scribed by Giorgio C. Buttazzo
- Publisher
- Kluwer Academic Publishers
- Year
- 1997
- Tongue
- English
- Leaves
- 429
- Series
- Kluwer International Series in Engineering & Computer Science
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
Real-time systems play a crucial role in our society, supporting several important application areas, such as nuclear and chemical plant control, flight control systems, traffic control in airports, harbors, and train stations, telecommunication systems, industrial automation, robotics, defensive military systems, space missions, and so on. Despite such a large number of critical applications, most of the current real-time systems are still designed and implemented using low level programming and empirical techniques without the support of a precise scientific methodology. The consequence of this approach is a lack of reliability, which in critical applications may cause serious damage to the environment or result in significant human loss. 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. 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 which can be used to support critical control applications. Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications presents fundamental concepts which are clearly defined at the beginning of each chapter, and each algorithm is described through concrete examples, figures and tables. After introducing the basic concepts of real-time computing, the book covers such topics as taxonomy of scheduling algorithms, models of tasks with explicit time constraints, handling tasks with precedence relations, periodic and aperiodic task scheduling, access protocols to shared resources, asynchronous communication mechanisms, schedulability analysis, and handling overload conditions. Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications was written for use as a textbook and serves as an excellent reference for those interested in real-time computing for designing and/or developing predictable control applications, which may include robotics, plant control, monitoring systems, data acquisition, simulations of real-world systems, virtual reality, interactive games, etc.
๐ SIMILAR VOLUMES
<span>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 methodolo
<span>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 methodolo
Many real-time systems rely on static scheduling algorithms. This includes cyclic scheduling, rate monotonic scheduling and fixed schedules created by off-line scheduling techniques such as dynamic programming, heuristic search, and simulated annealing. However, for many real-time systems, static sc