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
Como os sistemas embarcados de tempo real são necessários para acomodar diversas tarefas com diferentes níveis de criticidade, algoritmos de escalonamento para sistemas MC (Mixed-Criticality) têm sido amplamente estudados na comunidade de sistemas de tempo real. A maioria dos estudos concentrou-se em sistemas MC uniprocessados, enquanto houve apenas alguns estudos para apoiar sistemas MC multiprocessadores. Em particular, embora a política ZL (Zero-Laxity) seja conhecida por ser uma técnica eficaz para melhorar o desempenho da escalonabilidade de algoritmos de escalonamento base em sistemas multiprocessadores SC (Single-Criticality), a eficácia da política ZL em sistemas multiprocessadores MC não aumentou. foi revelado até o momento. Neste artigo, nos concentramos em perceber o potencial da política ZL para sistemas multiprocessadores MC, que é a primeira tentativa. Para este fim, projetamos a política ZL para sistemas multiprocessadores MC e aplicamos a política ao EDF (Earliest Deadline First), produzindo EDZL (Earliest Deadline first até Zero-Laxity) adaptado para sistemas multiprocessadores MC. Em seguida, desenvolvemos uma análise de escalonabilidade para EDZL (bem como para seu algoritmo base EDF) para apoiar sua garantia de temporização. Nossos resultados de simulação mostram uma melhoria significativa na escalonabilidade do EDZL em relação ao EDF, demonstrando a eficácia da política ZL para sistemas multiprocessadores 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.
Copiar
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
Copiar
@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},}
Copiar
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 -