ABSTRACT
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.
- J. H. Anderson, R. Jain, and K. Jeffay. Efficient object sharing in quantum-based real-time systems. In Proceedings of the 19th IEEE Real-Time Systems Symposium, pages 346--355, Dec. 1998. Google ScholarDigital Library
- N. C. Audsley. Optimal priority assignment and feasibility of static priority tasks with arbitrary start times. Technical report, Department of Computer Science, University of York, 1991.Google Scholar
- N. C. Audsley, A. Burns, M. Richardson, and A. Wellings. Hard real-time scheduling: The deadline monotonic approach. In Proceedings of IEEE Workshop on Real-Time Operating Systems and Software, pages 133--137, May 1991.Google ScholarCross Ref
- S. Baruah. The limited-preemption uniprocessor scheduling of sporadic task systems. In Proceedings of the 17th Euromicro Conference on Real-Time Systems, pages 137--144, July 2005. Google ScholarDigital Library
- E. Bini, G. C. Buttazzo, and G. M. Buttazzo. Rate monotonic analysis: The hyperbolic bound. IEEE Transactions on Computers, 52(7):933--942, 2003. Google ScholarDigital Library
- J. Chen, A. Harji, and P. Buhr. Solution space for fixed-priority with preemption threshold. In Proceedings of the 11th IEEE Real-Time and Embedded Technology and Applications Symposium, pages 385--394, Mar. 2005. Google ScholarDigital Library
- L. George, N. Riviere, and M. Spuri. Preemptive and non-preemptive real-time uniprocessor scheduling. Technical report, INRIA, 1996.Google Scholar
- R. Ghattas and A. G. Dean. Preemption threshold scheduling: Stack optimality, enhancements and analyis. In Proceedings of the 13th IEEE Real-Time and Embedded Technology and Applications Symposium, pages 147--157, Apr. 2007. Google ScholarDigital Library
- R. Gopalakrishnan and G. M. Parulkar. Bringing real-time scheduling theory and practice closer for multimedia computing. In Proceedings of the ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pages 1--12, May 1996. Google ScholarDigital Library
- D.-Z. He, F.-Y. Wang, and W. Li. Dynamic preemption threshold scheduling for specific real-time control systems. In Proceedings of the IEEE International Conference on Networking, Sensing and Control, pages 395--400, Mar. 2005.Google Scholar
- K. Jeffay, D. F. Stanat, and C. U. Martel. On non-preemptive scheduling of periodic and sporadic tasks. In Proceedings of IEEE Real-Time Systems Symposium, pages 129--139, Dec. 1991.Google Scholar
- D. I. Katcher, H. Arakawa, and J. K. Strosnider. Engineering and analysis of fixed priority schedulers. IEEE Transactions on Software Engineering, 19(9):920--934, 1993. Google ScholarDigital Library
- S. Kim, S. Hong, and T.-H. Kim. Integrating real-time synchronization schemes into preemption threshold scheduling. In Proceedings of the 5th IEEE International Symposium on Object-Oriented Real-Time Distributed Computing, page 145, Apr. 2002. Google ScholarDigital Library
- J. P. Lehoczky. Fixed priority scheduling of periodic task sets with arbitrary deadlines. In Proceedings of IEEE Real-Time Systems Symposium, pages 201--209, 1990.Google ScholarCross Ref
- T. M. Lim, B.-S. Lee, and C. K. Yeo. Quantum-based earliest deadline first scheduling for multiservices. IEEE Transactions on Multimedia, 9(1):157--168, 2007. Google ScholarDigital Library
- C. Liu and J. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of ACM, 20(1):46--61, 1973. Google ScholarDigital Library
- Y. Wang and M. Saksena. Scheduling fixed-priority tasks with preemption threshold. In Proceedings of the 6th International Conference on Real-Time Computing Systems and Applications, pages 328--335, Dec. 1999. Google ScholarDigital Library
Index Terms
Analysis on quantum-based fixed priority scheduling of real-time tasks
Recommendations
Integration of Preemption Threshold and Quantum-Based Scheduling for Schedulability Enhancement of Fixed Priority Tasks
RTCSA '09: Proceedings of the 2009 15th IEEE International Conference on Embedded and Real-Time Computing Systems and ApplicationsFixed priority scheduling is an important real-time scheduling scheme widely used in practice. To improve the schedulability of fixed priority scheduling considerable effort has been made such as introduction of preemption threshold or deferred ...
Preference-oriented fixed-priority scheduling for periodic real-time tasks
A preference priority assignment (PPA) scheme that explicitly incorporates the ASAP and ALAP execution preferences of periodic real-time tasks is proposed.An online dual-queue based preference-oriented fixed- priority (POFP) scheduler is proposed 4, ...
Fixed-Priority Multiprocessor Scheduling with Liu and Layland's Utilization Bound
RTAS '10: Proceedings of the 2010 16th IEEE Real-Time and Embedded Technology and Applications SymposiumLiu and Layland discovered the famous utilization bound for fixed-priority scheduling on single processor systems in the 1970's. Since then, it has been a long standing open problem to find fixed-priority scheduling algorithms with the same bound for ...
Comments