scientific article; zbMATH DE number 1106353
The object of the reviewed book is to introduce scientific methods into the design and the development of real-time systems to increase their reliability. It comprises a basic treatise on real-time programming considering especially predictable scheduling algorithms. After a short introduction into the fundamentals of real-time work an excellent summary of the real-time scheduling problem is given. The different approaches to solve this task and the matching algorithms are compared. After that, all these algorithms are treated specifically: periodic and aperiodic task scheduling, fixed and dynamic priority servers, resource access protocols, overload problems as well as kernel and application design issues. In each chapter, firstly the fundamental concepts are defined clearly. The detailed examinations of the algorithms are illustrated by instructive tables and pictures. And every chapter is closed by several concrete application examples. Especially to emphasize is the last part of the book. It explains a series of implemented real-time systems in some detail and shows the practical application of the theoretical considerations carried through before. In the reviewer's opinion the discussed publication is an outstanding textbook. It offers an excellent summary of real-time problems, explains the details thoroughly and shows some realized applications. This unit of theory and practice makes the book valuable not only to lecturers as a base for lectures on real-time systems, but also to students of informatics and automation. Beyond that it may serve as a comprehensive work of reference for experts being involved in the field of real-time systems. Therefore the referenced book must be also emphatically recommended to all engineers involved in real-time computing.
- Rate-monotonic scheduling for hard-real-time systems
- Minimal schedulability interval for real-time systems of periodic tasks with offsets
- Memory-centric scheduling for multicore hard real-time systems
- Run-time spatial mapping of streaming applications to heterogeneous multi-processor systems
- Schedulability analysis of fixed-priority systems using timed automata
- Sporadic event-based control of first-order linear stochastic systems
- Formal verification of multitasking applications based on timed automata model
- Sensor networks and cooperative control
- A theory for execution-time derivation in real-time programs
- Task automata: Schedulability, decidability and undecidability
- Liu and Layland's schedulability test revisited
- Hard real-time computing systems. Predictable scheduling algorithms and applications.
- An integrated DBP for streams with (m, k)-firm real-time guarantee
- Design and implementation of a Maple-package for the predictability of real-time systems
- scientific article; zbMATH DE number 53307 (Why is no real title available?)
- scientific article; zbMATH DE number 53318 (Why is no real title available?)
- Feasibility analysis of real-time transactions
- HARTEX?a safe real-time kernel for distributed computer control systems
- Modeling and analysis of real-time systems with mutex components
- Multiprocessor scheduling for real-time systems
- Real-time task scheduling for energy-aware embedded systems
- Optimal admission control of discrete event systems with real-time constraints
- Hard Real-Time Computing Systems
- Perturbation analysis and optimization of stochastic hybrid systems
- Fixed order scheduling with deadlines
- Feasibility analysis of real-time periodic tasks with offsets
- Dispatch sequences for embedded control models
- Solution of the Liu-Layland problem via bottleneck just-in-time sequencing
- GPU-based acceleration of system-level design tasks
- Rate monotonic scheduling re-analysed
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4371833)