Guaranteeing timing constraints under shortest remaining processing time scheduling
Robert Ian Davis, Alan Burns, W. Walker · 2002
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.