Guaranteeing timing constraints under shortest remaining processing time scheduling

R.I. Davis, A. Burns, W. Walker

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

Abstract

The scheduling scheme “shortest remaining processing time” (SRPT) has the advantage that it minimises mean response times. We present feasibility tests for SRPT that will enable this scheduling approach to be used for real time systems. Examples are given of task sets that are schedulable under SRPT but not by fixed priority based scheduling
Original languageEnglish
Title of host publicationEuromicro Workshop on Real-Time Systems
Pages88-93
Number of pages6
DOIs
Publication statusPublished - Jul 1997

Keywords

  • real-time
  • scheduling
  • SRPT
  • shortest remaining processing time

Cite this