The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Memandangkan sistem terbenam masa nyata diperlukan untuk menampung pelbagai tugas dengan tahap kritikal yang berbeza, algoritma penjadualan untuk sistem MC (Mixed-Criticality) telah dikaji secara meluas dalam komuniti sistem masa nyata. Kebanyakan kajian telah memberi tumpuan kepada sistem unipemproses MC sedangkan terdapat hanya beberapa kajian untuk menyokong sistem multipemproses MC. Khususnya, walaupun dasar ZL (Zero-Laxity) telah diketahui sebagai teknik yang berkesan dalam meningkatkan prestasi penjadualan algoritma penjadualan asas pada sistem multipemproses SC (Single-Criticality), keberkesanan dasar ZL pada sistem berbilang pemproses MC tidak telah didedahkan sehingga kini. Dalam makalah ini, kami menumpukan pada merealisasikan potensi dasar ZL untuk sistem multipemproses MC, yang merupakan percubaan pertama. Untuk tujuan ini, kami mereka bentuk dasar ZL untuk sistem berbilang pemproses MC, dan menggunakan dasar itu kepada EDF (Tarikh Akhir Terawal Didahulukan), menghasilkan EDZL (Tarikh Akhir Terawal dahulu sehingga Zero-Laxity) yang disesuaikan untuk sistem berbilang pemproses MC. Kemudian, kami membangunkan analisis penjadualan untuk EDZL (serta algoritma asasnya EDF) untuk menyokong jaminan masanya. Keputusan simulasi kami menunjukkan peningkatan penjadualan EDZL yang ketara berbanding EDF, menunjukkan keberkesanan dasar ZL untuk sistem berbilang pemproses MC.
Namyong JUNG
Sungkyunkwan University (SKKU)
Hyeongboo BAEK
Sungkyunkwan University (SKKU)
Donghyouk LIM
RTST
Jinkyu LEE
Sungkyunkwan University (SKKU)
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.
Salinan
Namyong JUNG, Hyeongboo BAEK, Donghyouk LIM, Jinkyu LEE, "Incorporating Zero-Laxity Policy into Mixed-Criticality Multiprocessor Real-Time Systems" in IEICE TRANSACTIONS on Fundamentals,
vol. E101-A, no. 11, pp. 1888-1899, November 2018, doi: 10.1587/transfun.E101.A.1888.
Abstract: As real-time embedded systems are required to accommodate various tasks with different levels of criticality, scheduling algorithms for MC (Mixed-Criticality) systems have been widely studied in the real-time systems community. Most studies have focused on MC uniprocessor systems whereas there have been only a few studies to support MC multiprocessor systems. In particular, although the ZL (Zero-Laxity) policy has been known to an effective technique in improving the schedulability performance of base scheduling algorithms on SC (Single-Criticality) multiprocessor systems, the effectiveness of the ZL policy on MC multiprocessor systems has not been revealed to date. In this paper, we focus on realizing the potential of the ZL policy for MC multiprocessor systems, which is the first attempt. To this end, we design the ZL policy for MC multiprocessor systems, and apply the policy to EDF (Earliest Deadline First), yielding EDZL (Earliest Deadline first until Zero-Laxity) tailored for MC multiprocessor systems. Then, we develop a schedulability analysis for EDZL (as well as its base algorithm EDF) to support its timing guarantee. Our simulation results show a significant schedulability improvement of EDZL over EDF, demonstrating the effectiveness of the ZL policy for MC multiprocessor systems.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E101.A.1888/_p
Salinan
@ARTICLE{e101-a_11_1888,
author={Namyong JUNG, Hyeongboo BAEK, Donghyouk LIM, Jinkyu LEE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Incorporating Zero-Laxity Policy into Mixed-Criticality Multiprocessor Real-Time Systems},
year={2018},
volume={E101-A},
number={11},
pages={1888-1899},
abstract={As real-time embedded systems are required to accommodate various tasks with different levels of criticality, scheduling algorithms for MC (Mixed-Criticality) systems have been widely studied in the real-time systems community. Most studies have focused on MC uniprocessor systems whereas there have been only a few studies to support MC multiprocessor systems. In particular, although the ZL (Zero-Laxity) policy has been known to an effective technique in improving the schedulability performance of base scheduling algorithms on SC (Single-Criticality) multiprocessor systems, the effectiveness of the ZL policy on MC multiprocessor systems has not been revealed to date. In this paper, we focus on realizing the potential of the ZL policy for MC multiprocessor systems, which is the first attempt. To this end, we design the ZL policy for MC multiprocessor systems, and apply the policy to EDF (Earliest Deadline First), yielding EDZL (Earliest Deadline first until Zero-Laxity) tailored for MC multiprocessor systems. Then, we develop a schedulability analysis for EDZL (as well as its base algorithm EDF) to support its timing guarantee. Our simulation results show a significant schedulability improvement of EDZL over EDF, demonstrating the effectiveness of the ZL policy for MC multiprocessor systems.},
keywords={},
doi={10.1587/transfun.E101.A.1888},
ISSN={1745-1337},
month={November},}
Salinan
TY - JOUR
TI - Incorporating Zero-Laxity Policy into Mixed-Criticality Multiprocessor Real-Time Systems
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1888
EP - 1899
AU - Namyong JUNG
AU - Hyeongboo BAEK
AU - Donghyouk LIM
AU - Jinkyu LEE
PY - 2018
DO - 10.1587/transfun.E101.A.1888
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E101-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2018
AB - As real-time embedded systems are required to accommodate various tasks with different levels of criticality, scheduling algorithms for MC (Mixed-Criticality) systems have been widely studied in the real-time systems community. Most studies have focused on MC uniprocessor systems whereas there have been only a few studies to support MC multiprocessor systems. In particular, although the ZL (Zero-Laxity) policy has been known to an effective technique in improving the schedulability performance of base scheduling algorithms on SC (Single-Criticality) multiprocessor systems, the effectiveness of the ZL policy on MC multiprocessor systems has not been revealed to date. In this paper, we focus on realizing the potential of the ZL policy for MC multiprocessor systems, which is the first attempt. To this end, we design the ZL policy for MC multiprocessor systems, and apply the policy to EDF (Earliest Deadline First), yielding EDZL (Earliest Deadline first until Zero-Laxity) tailored for MC multiprocessor systems. Then, we develop a schedulability analysis for EDZL (as well as its base algorithm EDF) to support its timing guarantee. Our simulation results show a significant schedulability improvement of EDZL over EDF, demonstrating the effectiveness of the ZL policy for MC multiprocessor systems.
ER -