Browse > Article

Dominance and Performance of Real-time Scheduling Algorithms on Multiprocessors  

Park, Min-Kyu (서울대학교 컴퓨터공학과)
Han, Sang-Chul (서울대학교 전기 컴퓨터공학부)
Kim, Hee-Heon (서울대학교 전기 컴퓨터공학부)
Cho, Seong-Je (단국대학교 정보컴퓨터학부)
Cho, Yoo-Kun (서울대학교 전기 컴퓨터공학부)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.32, no.7, 2005 , pp. 368-376 More about this Journal
Abstract
Multiprocessor architecture becomes increasingly common on real-time systems as computer hardware technology rapidly progresses and the workload of real-time systems increases. However, efficient solutions for many real-time multiprocessor scheduling problems are not known. Hence many researchers apply uniprocessor scheduling algorithms to multiprocessor scheduling or devise new algorithms based on these algorithms. Such algorithms are EDF (Earliest Deadline First), LLF (Least Laxity First), EDF-US[m/(2m-1)], and EDZL (Earliest Deadline Zero Laxity), and comparative studies on them are necessary. In this paper, we show the dominance relation of these algorithms with respect to schedulability, and we prove EDZL strictly dominates EDF. The simulation results show that EDZL has high processor utilization and it causes a small number of preemptions.
Keywords
dominance; multiprocessor; real-time scheduling algorithm; laxity; deadline;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Cho, S., Lee, S., Ahn, S., and Lin, K., 'Efficient Real-Time Scheduling Algorithms for Multiprocessor Systems,' IEICE Trans. Commun., Vol. E85-B, No.12, pp, 2859-2867, 2002
2 Mok, A., 'Task Management Techniques for Enforcing ED Scheduling on a Periodic Task Set,' Proceedings of the 5th IEEE Workshop on Real-Time Software and Operating Systems, Washington, DC, pp. 42-46. May 1988
3 Kalyanasundaram, B., Pruhs, K. P., and Torng, E., 'Errata: A New Algorithm for Scheduling Periodic, Real-Time Tasks,' Algorithmica, Vo1.28, pp. 269-270, 2000   DOI
4 Liu, J. W., Real-Time Systems, p.70, Prentice Hall,2000
5 Dertouzos, M. L. and Mok, A. K., 'Multiprocessor On-line Scheduling of Hard Real-Time Tasks,' IEEE Trans. on Software Eng., Vol.15, No.12, pp. 1497-1506, 1989   DOI   ScienceOn
6 Dhall, S. K. and Liu, C. L., 'On a Real-Time Scheduling Problem,' Operations Research. Vol.26, No.1, pp. 127-140, 1978   DOI   ScienceOn
7 Leung, J.. 'A New Algorithm for Scheduling Periodic Real-Time Tasks,' Algorithmica, Vol.4, pp. 209-219, 1989   DOI
8 C. L. Liu and J. W. Layland, 'Scheduling Algorithm for Multiprogramming in Hard Real Time Environment,' Journal of ACM, Vol. 20, pp. 46-61, Jan., 1973   DOI
9 Carpenter, J., Funk, S., Holman, P., Srinivasan, A., Anderson, J., and Baruah, S., 'A Categorization of Real-time Multiprocessor Scheduling Problems and Algorithms,' In Handbook of Scheduling: Algorithms, Models, and Performance Analysis, Joseph Y-T Leung (ed). Chapman Hall/ CRC Press. 2004
10 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