Paper Info
Title
Improved response time analysis of tasks scheduled under preemptive Round-Robin
Abstract
Round-Robin scheduling is the most popular time triggered scheduling policy, and has been widely used in communication networks for the last decades. It is an efficient scheduling technique for integration of unrelated system parts, but the worst-case timing depends on the system properties in a very complex way. The existing works on response time analysis of task scheduled under Round-Robin determine very pessimistic response time bounds, without considering in detail the interactions between tasks. This may lead to a degradation of the efficiency of Round-Robin scheduling algorithm, and becomes a practical obstacle to its application in realtime systems. In this paper we present an approach to compute much tighter best-case and worst-case response time bounds of tasks scheduled under preemptive Round-Robin, including also the effects of the scheduling algorithm.
Year
DOI
Venue
2007
10.1145/1289816.1289861
CODES+ISSS
Keywords
Field
DocType
worst-case timing,processor scheduling,popular time,efficient scheduling technique,scheduling algorithm,round-robin scheduling algorithm,improved response time analysis,round-robin scheduling,timing,real-time system,response time analysis,communication networks,time triggered scheduling,preemptive round-robin,task scheduling,real-time systems,pessimistic response time bound,worst-case response time bound,real time systems
Fixed-priority pre-emptive scheduling,Fair-share scheduling,Computer science,Parallel computing,Deadline-monotonic scheduling,Real-time computing,Two-level scheduling,Least slack time scheduling,Rate-monotonic scheduling,Dynamic priority scheduling,Earliest deadline first scheduling,Distributed computing
Conference
ISBN
Citations 
PageRank 
978-1-5959-3824-4
7
0.69
References 
Authors
15
5
Name
Order
Citations
PageRank
Razvan Racu121814.93
Li Li270.69
Rafik Henia316113.71
Arne Hamann426422.87
Rolf Ernst52633252.90