Name
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. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1109/EMWRTS.1997.613768 | Proceedings Ninth Euromicro Workshop on Real Time Systems |
Keywords | Field | DocType |
timing constraint guarantee,shortest remaining processing time scheduling,scheduling scheme,SRPT,mean response times,feasibility tests,scheduling approach,real time systems,task sets,fixed priority based scheduling | Fixed-priority pre-emptive scheduling,Fair-share scheduling,Computer science,Deadline-monotonic scheduling,Real-time computing,Shortest job next,Rate-monotonic scheduling,Dynamic priority scheduling,Earliest deadline first scheduling,Shortest remaining time,Distributed computing | Conference |
ISSN | ISBN | Citations |
1068-3070 | 0-8186-8034-2 | 1 |
PageRank | References | Authors |
0.35 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Robert I. Davis | 1 | 1824 | 93.74 |
| Alan Burns | 2 | 739 | 59.60 |
| W. Walker | 3 | 1 | 0.35 |