Exact analysis of round-robin schedulng of services
IBM Journal of Research and Development
An extendible approach for analyzing fixed priority hard real-time tasks
Real-Time Systems
Efficient fair queueing using deficit round robin
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
On the Latency Bound of Pre-Order Deficit Round Robin
LCN '02 Proceedings of the 27th Annual IEEE Conference on Local Computer Networks
Proportional Share Scheduling of Operating System Services for Real-Time Applications
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
PCI Express System Architecture
PCI Express System Architecture
Guaranteeing end-to-end deadlines in ATM networks
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
Timing analysis of compound scheduling policies: application to posix1003.1b
Journal of Scheduling
A high-end real-time digital film processing reconfigurable platform
EURASIP Journal on Embedded Systems
Reliable performance analysis of a multicore multithreaded system-on-chip
CODES+ISSS '08 Proceedings of the 6th IEEE/ACM/IFIP international conference on Hardware/Software codesign and system synthesis
Providing accurate event models for the analysis of heterogeneous multiprocessor systems
CODES+ISSS '08 Proceedings of the 6th IEEE/ACM/IFIP international conference on Hardware/Software codesign and system synthesis
Bottom-up performance analysis considering time slice based software scheduling at system level
CODES+ISSS '09 Proceedings of the 7th IEEE/ACM international conference on Hardware/software codesign and system synthesis
Real-time communication analysis for networks with two-stage arbitration
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Optimizing performance analysis for synchronous dataflow graphs with shared resources
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
| Hi-index | 0.00 |
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 real-time 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.