Comparison of Deadline-Based Scheduling Algorithms for Periodic Real-Time Tasks on Multiprocessor

Minkyu PARK; Sangchul HAN; Heeheon KIM; Seongje CHO; Yookun CHO

doi:10.1093/ietisy/e88-d.3.658

Comparison of Deadline-Based Scheduling Algorithms for Periodic Real-Time Tasks on Multiprocessor

Minkyu PARK, Sangchul HAN, Heeheon KIM, Seongje CHO, Yookun CHO

Full Text Views

0

Share
Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Information Vol.E88-D No.3 pp.658-661

Publication Date: 2005/03/01

Publicized

Online ISSN

DOI: 10.1093/ietisy/e88-d.3.658

Type of Manuscript: LETTER

Category: System Programs

Cite this

Copy

Minkyu PARK, Sangchul HAN, Heeheon KIM, Seongje CHO, Yookun CHO, "Comparison of Deadline-Based Scheduling Algorithms for Periodic Real-Time Tasks on Multiprocessor" in IEICE TRANSACTIONS on Information, vol. E88-D, no. 3, pp. 658-661, March 2005, doi: 10.1093/ietisy/e88-d.3.658.
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.
URL: https://globals.ieice.org/en_transactions/information/10.1093/ietisy/e88-d.3.658/_p

Copy

@ARTICLE{e88-d_3_658,
author={Minkyu PARK, Sangchul HAN, Heeheon KIM, Seongje CHO, Yookun CHO, },
journal={IEICE TRANSACTIONS on Information},
title={Comparison of Deadline-Based Scheduling Algorithms for Periodic Real-Time Tasks on Multiprocessor},
year={2005},
volume={E88-D},
number={3},
pages={658-661},
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.},
keywords={},
doi={10.1093/ietisy/e88-d.3.658},
ISSN={},
month={March},}

Copy

TY - JOUR
TI - Comparison of Deadline-Based Scheduling Algorithms for Periodic Real-Time Tasks on Multiprocessor
T2 - IEICE TRANSACTIONS on Information
SP - 658
EP - 661
AU - Minkyu PARK
AU - Sangchul HAN
AU - Heeheon KIM
AU - Seongje CHO
AU - Yookun CHO
PY - 2005
DO - 10.1093/ietisy/e88-d.3.658
JO - IEICE TRANSACTIONS on Information
SN -
VL - E88-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 2005
AB - 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.
ER -