Notations and symbols
Introduction
1. Basic Concepts
1.1. Real-time applications
1.2.Basic notions for real-time task scheduling.
2. Scheduling of Independent Tasks
2.1. Basic on-line algorithms for periodic tasks
2.2. Hybrid task sets scheduling
2.3. Exercises
3. Scheduling of Dependent Tasks
3.1. Tasks for precedence relationships
3.2. Tasks sharing critical resources
4. Scheduling Schemes for Handling Overload
4.1. Scheduling techniques in overload conditions
4.2. Handling real-time tasks with varying timing parameters
4.3. Handling overload conditions for hybrid task sets
5. Multiprocessor Scheduling.
5.1. Introduction
5.2. First results and comparison with uniprocessor scheduling
5.3. Multiprocessor scheduling anomalies
5.4. Schedulability conditions
5.5. Scheduling algorithms
5.6. Conclusion
6. Joint Scheduling of Tasks and Messages in Distributed Systems
6.1. Overview of distributed real-time systems
6.2. Task allocation in real-time distributed systems
6.3. Real-time traffic
6.4. Message scheduling
6.5. Conclusion
6.6. Exercise 6.1: joint scheduling of tasks and messages
7. Packet Scheduling in Networks
7.1. Introduction
7.2. Network and traffic models
7.3. Service disciplines
7.4. Work-conserving service disciplines
7.5. Non-work-conserving service disciplines
7.6. Summary and conclusion
7.7. Exercises
8. Software Environment
8.1. Real-time operating system and real-time kernel
8.2. Real-time languages
8.3. Real-time middleware
8.4. Summary of scheduling capabilities of standardized components
8.5. Exercise
8.6. Web Links (April 2002)
9. Case Studies
9.1. Real-time acquisition and analysis of rolling mill signals
9.2. Embedded real-time application: Mars Pathfinder mission
9.3. Distributed automotive application
Glossary
Bibliography
Index
