Finish Time Predictability of Earliest Deadline Zero Laxity Algorithm for Multiprocessor Real-Time Systems
Summary :
This letter proves the finish time predictability of EDZL (Earliest Deadline Zero Laxity) scheduling algorithm for multiprocessor real-time systems, which is a variant of EDF. Based on the results, it also shows that EDZL can successfully schedule any periodic task set if its total utilization is not greater than (m+1)/2, where m is the number of processors.
- Publication
- IEICE TRANSACTIONS on Information Vol.E89-D No.12 pp.2981-2984
- Publication Date
- 2006/12/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1093/ietisy/e89-d.12.2981
- Type of Manuscript
- LETTER
- Category
- System Programs
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Sangchul HAN, Heeheon KIM, Xuefeng PIAO, Minkyu PARK, Seongje CHO, Yookun CHO, "Finish Time Predictability of Earliest Deadline Zero Laxity Algorithm for Multiprocessor Real-Time Systems" in IEICE TRANSACTIONS on Information,
vol. E89-D, no. 12, pp. 2981-2984, December 2006, doi: 10.1093/ietisy/e89-d.12.2981.
Abstract: This letter proves the finish time predictability of EDZL (Earliest Deadline Zero Laxity) scheduling algorithm for multiprocessor real-time systems, which is a variant of EDF. Based on the results, it also shows that EDZL can successfully schedule any periodic task set if its total utilization is not greater than (m+1)/2, where m is the number of processors.
URL: https://global.ieice.org/en_transactions/information/10.1093/ietisy/e89-d.12.2981/_p
Copy
@ARTICLE{e89-d_12_2981,
author={Sangchul HAN, Heeheon KIM, Xuefeng PIAO, Minkyu PARK, Seongje CHO, Yookun CHO, },
journal={IEICE TRANSACTIONS on Information},
title={Finish Time Predictability of Earliest Deadline Zero Laxity Algorithm for Multiprocessor Real-Time Systems},
year={2006},
volume={E89-D},
number={12},
pages={2981-2984},
abstract={This letter proves the finish time predictability of EDZL (Earliest Deadline Zero Laxity) scheduling algorithm for multiprocessor real-time systems, which is a variant of EDF. Based on the results, it also shows that EDZL can successfully schedule any periodic task set if its total utilization is not greater than (m+1)/2, where m is the number of processors.},
keywords={},
doi={10.1093/ietisy/e89-d.12.2981},
ISSN={1745-1361},
month={December},}
Copy
TY - JOUR
TI - Finish Time Predictability of Earliest Deadline Zero Laxity Algorithm for Multiprocessor Real-Time Systems
T2 - IEICE TRANSACTIONS on Information
SP - 2981
EP - 2984
AU - Sangchul HAN
AU - Heeheon KIM
AU - Xuefeng PIAO
AU - Minkyu PARK
AU - Seongje CHO
AU - Yookun CHO
PY - 2006
DO - 10.1093/ietisy/e89-d.12.2981
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E89-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 2006
AB - This letter proves the finish time predictability of EDZL (Earliest Deadline Zero Laxity) scheduling algorithm for multiprocessor real-time systems, which is a variant of EDF. Based on the results, it also shows that EDZL can successfully schedule any periodic task set if its total utilization is not greater than (m+1)/2, where m is the number of processors.
ER -
English
