Soft real-time systems: predictability vs. efficiency

Description

Preface 1: Introduction 1.1 Basic terminology 1.2 From hard to soft real-time systems 1.3 Providing support for soft real-time systems 2: Overload Management 2.1 Introduction 2.2 Load definitions 2.3 Admission control methods 2.4 Performance degradation methods 2.5 Service adaptation 2.6 Job skipping 2.7 Period adaptation 3: Temporal Protection 3.1 Problems without temporal protection 3.2 Providing temporal protection 3.3 The GPS model 3.4 Proportional share scheduling 3.5 Resource reservation techniques 3.6 Resource reservations in dynamic priority systems 3.7 Temporal guarantees 3.8 Resource reservations in operating system kernels 4: Multi-thread Applications 4.1 The thread model 4.2 Global approaches 4.3 Partition-based approaches 4.4 Concluding remarks and open problems 5: Synchronization Protocols 5.1 Terminology and notation 5.2 Shared resource in real-time systems 5.3 Synchronization protocols for hard real-time systems 5.4 Shared resources in soft real-time systems 5.5 Extending resource reservation with the SRP 5.6 Resource constraints in dynamic systems 5.7 Concluding remarks 6: Resource Reclaiming 6.1 Problems with reservations 6.2 The CASH algorithm 6.3 The GRUB algorithm 6.4 Other forms of reclaiming 7: QoS Management 7.1 The QoS-based resource allocation model 7.2 Static vs. dynamic resource management 7.3 Integrating design and scheduling issues 7.4 Smooth rate adaptation 8: Feedback Scheduling 8.1 Controlling the number of missed deadlines 8.2 Adaptive reservations 8.3 Application level adaptation 8.4 Workload estimators 9: Stochastic Scheduling 9.1 Background and definitions 9.2 Statistical analysis of classical algorithms 9.3 Real-time queueing theory 9.4 Novel algorithms for stochastic scheduling 9.5 Reservations and stochastic guarantee References Index