Browse > Article

Enhancing Fixed Priority Scheduling Algorithms for Real-Time Tasks on Multiprocessors  

Park Minkyu (서울대학교 컴퓨터공학과)
Han Sangchul (서울대학교 컴퓨터공학과)
Kim HeeHeon (서울대학교 컴퓨터공학과)
Cho Seongje (단국대학교 정보컴퓨터학부)
Cho Yookun (서울대학교 컴퓨터공학부)
Publication Information
Journal of KIISE:Computing Practices and Letters / v.11, no.1, 2005 , pp. 62-68 More about this Journal
Abstract
This paper presents a scheme to enhance fixed priority scheduling algorithms on multiprocessors. This scheme gives the highest priority to jobs with zero laxity and schedules them Prior to other jobs. A fixed priority algorithm employing this scheme strictly dominates the original one; it can schedule all task sets schedulable by the fixed priority algorithm and some task sets not schedulable by the fixed priority algorithm. Simulation results show that the proposed scheme improves fixed priority algorithms in terms of the number of schedulable task sets and schedulable utilization bound.
Keywords
multiprocessor; real-time; priority-driven scheduling; laxity; schedulable utilization bound;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Kalyanasundaram, B., Pruhs, K. P., and Torng, E., 'Errata: A New Algorithm for Scheduling Periodic, Real-Time Tasks,' Algorithmica, Vol.28, pp. 269-270, 2000   DOI
2 Goossens, J., and Macq, C., 'Limitation of the Hyper-Period in Real-Time Periodic Task Set Generation,' In Proceedings of the 9th International Conference on Real-Time Systems, pp. 133-148, 2001
3 Carpenter, J., Funk, S., Holman, P., Srinivasan, A., Anderson, J., and Baruah, S., Handbook of Scheduling: Algorithms, Models, and Performance Analysis, chapter 2, Chapman Hall/CRC Press, 2004
4 Dhall, S. K. and Liu, C. L., 'On a Real-Time Scheduling Problem,' Operations Research. Vol.26, No.1, pp. 127-140, 1978   DOI
5 Leung, J., 'A New Algorithm for Scheduling Periodic Real-Time Tasks,' Algorithmica, Vol.4, pp. 209-219, 1989   DOI
6 Goossens, J., Funk, S., and Baruah, S., 'Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors,' Real-Time Systems, Vol.25, Issue.2-3, pp. 187-205, 2003   DOI
7 Liu, C. L. and Layland, J. W., 'Scheduling Algorithms for Multiprogramming in a HardReal-Time Environment,' Journal of the ACM, Vol.20, No.1, pp. 46-61, 1973   DOI
8 Audsley, N. C., Burns, A., Richardson, M., and Wellings, A., 'Hard Real-Time Scheduling: The Deadline Monotonic Approach,' In Proceedings of IEEE Workshop on Real-Time Operating Systems and Software, pp. 133-137, 1991
9 Srinivasan, A. and Baruah, S., 'Deadline-based seheduling of Periodic Task Systems on Multiprocessors,' Information Processing Letters, Vol.84, No.2, pp. 93-98, 2002   DOI   ScienceOn
10 Baruah, S. K.. 'Optimal Utilization Bounds for the Fixed-Priority Scheduling of Periodic Task Systems on Identical Multiprocessors,' IEEE Transactions on Computers, Vol.53, No.6, pp.781-784, 2004   DOI   ScienceOn