Comparison of Deadline-Based Scheduling Algorithms for Periodic Real-Time Tasks on Multiprocessor*This work is supported in part by Brain Korea 21 project and in part by ICT.

  • Authors:

  • Minkyu Park;Sangchul Han;Heeheon Kim;Seongje Cho;Yookun Cho

  • Affiliations:

  • The author is with the Department of Computer Engineering, Seoul National University, 151-742, Korea. E-mail: mkpark@ssrnet.snu.ac.kr,;The authors are with the School of Electrical Engineering and Computer Science, Seoul National University, 151-742, Korea.,;The authors are with the School of Electrical Engineering and Computer Science, Seoul National University, 151-742, Korea.,;The author is with the Division of Information and Computer Science, Dankook University, 140-714, Korea.;The authors are with the School of Electrical Engineering and Computer Science, Seoul National University, 151-742, Korea.,

  • Venue:
  • IEICE - Transactions on Information and Systems
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Multiprocessor architecture becomes common on real-time systems as the workload of real-time systems increases. Recently new deadline-based (EDF-based) multiprocessor scheduling algorithms are devised, and comparative studies on the performance of these algorithms are necessary. In this paper, we compare EDZL, a hybrid of EDF and LLF, with other deadline-based scheduling algorithms such as EDF, EDF-US[m(2m-1)], and fpEDF. We show EDZL schedules all task sets schedulable by EDF. The experimental results show that the number of preemptions of EDZL is comparable to that of EDF and the schedulable utilization bound of EDZL is higher than those of other algorithms we consider.