Bringing real-time scheduling theory and practice closer for multimedia computing
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Engineering and Analysis of Fixed Priority Schedulers
IEEE Transactions on Software Engineering
Scheduling Fixed-Priority Tasks with Preemption Threshold
RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
Efficient Object Sharing in Quantum-Based Real-Time Systems
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Integrating Real-Time Synchronization Schemes into Preemption Threshold Scheduling
ISORC '02 Proceedings of the Fifth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing
Rate Monotonic Analysis: The Hyperbolic Bound
IEEE Transactions on Computers
Solution Space for Fixed-Priority with Preemption Threshold
RTAS '05 Proceedings of the 11th IEEE Real Time on Embedded Technology and Applications Symposium
The Limited-Preemption Uniprocessor Scheduling of Sporadic Task Systems
ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
Preemption Threshold Scheduling: Stack Optimality, Enhancements and Analysis
RTAS '07 Proceedings of the 13th IEEE Real Time and Embedded Technology and Applications Symposium
Quantum-Based Earliest Deadline First Scheduling for Multiservices
IEEE Transactions on Multimedia
| Hi-index | 0.00 |
Fixed priority schedulers are widely used for real-time systems, and there were efforts to improve the schedulability. Preemption threshold scheduling is one of such efforts with a dual priority scheme. It increases the schedulability by introducing priority inversion during task execution. In this paper, we analyze another scheduling model, quantum-based scheduling. When quantum-based scheduling is combined with priority-based scheduling, the quantum introduces a partially non-preemptive region. We show that the non-preemptiveness introduced by quantum-based scheduling can improve the schedulability of fixed priority tasks, and there is a task set which is not schedulable by preemption threshold scheduling but is schedulable by quantum-based scheduling. This paper presents a method to calculate the worst case response time of tasks in quantum-based scheduling. Based on the previous research results for preemptive and non-preemptive scheduling, we present a priority assignment method for quantum-based scheduling also.