Abstract
This paper addresses the problem of jointly scheduling tasks with both hard and soft time constraints. We present a new analysis which builds upon previous research into slack stealing algorithms. Our analysis determines the maximum processing time which may be stolen from hard deadline periodic or sporadic tasks, without jeopardising their timing constraints. It extends to tasks with characteristics such as synchronization, release jitter and stochastic execution times, as well as forming the basis for a family of optimal and approximate slack stealing algorithms
Original language | English |
---|---|
Title of host publication | IEEE Real-Time Systems Symposium |
Pages | 222-231 |
Number of pages | 10 |
DOIs | |
Publication status | Published - Dec 1993 |
Event | Real-Time Systems Symposium, 1993., Proceedings. - Raleigh, Durham, United Kingdom Duration: 1 Dec 1993 → … |
Conference
Conference | Real-Time Systems Symposium, 1993., Proceedings. |
---|---|
Country/Territory | United Kingdom |
City | Durham |
Period | 1/12/93 → … |
Keywords
- real-time
- scheduling
- schedulability analysis
- slack stealing
- servers