Scheduling Slack Time in Fixed priority Pre-emptive Systems

R I Davis, K W Tindell, A Burns

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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 languageEnglish
Title of host publicationIEEE Real-Time Systems Symposium
Number of pages10
Publication statusPublished - Dec 1993
EventReal-Time Systems Symposium, 1993., Proceedings. - Raleigh, Durham, United Kingdom
Duration: 1 Dec 1993 → …


ConferenceReal-Time Systems Symposium, 1993., Proceedings.
Country/TerritoryUnited Kingdom
Period1/12/93 → …


  • real-time
  • scheduling
  • schedulability analysis
  • slack stealing
  • servers

Cite this