IEICE TRANSACTIONS on Information
Proof and Evaluation of Improved Slack Reclamation for Response Time Analysis of Real-Time Multiprocessor Systems
Summary :
RTA (Response time analysis) is a popular technique to guarantee timing requirements for a real-time system, and therefore the RTA framework has been widely studied for popular scheduling algorithms such as EDF (Earliest Deadline First) and FP (Fixed Priority). While a number of extended techniques of RTA have been introduced, some of them cannot be used since they have not been proved and evaluated in terms of their correctness and empirical performance. In this letter, we address the state of the art technique of slack reclamation of the existing generic RTA framework for multiprocessors. We present its mathematical proof of correctness and empirical performance evaluation, which have not been revealed to this day.
- Publication
- IEICE TRANSACTIONS on Information Vol.E101-D No.8 pp.2136-2140
- Publication Date
- 2018/08/01
- Publicized
- 2018/05/02
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.2017EDL8260
- Type of Manuscript
- LETTER
- Category
- Software System
Authors
Hyeongboo BAEK
Sungkyunkwan University (SKKU)
Donghyouk LIM
RTST
Jinkyu LEE
Sungkyunkwan University (SKKU)
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
Hyeongboo BAEK, Donghyouk LIM, Jinkyu LEE, "Proof and Evaluation of Improved Slack Reclamation for Response Time Analysis of Real-Time Multiprocessor Systems" in IEICE TRANSACTIONS on Information,
vol. E101-D, no. 8, pp. 2136-2140, August 2018, doi: 10.1587/transinf.2017EDL8260.
Abstract: RTA (Response time analysis) is a popular technique to guarantee timing requirements for a real-time system, and therefore the RTA framework has been widely studied for popular scheduling algorithms such as EDF (Earliest Deadline First) and FP (Fixed Priority). While a number of extended techniques of RTA have been introduced, some of them cannot be used since they have not been proved and evaluated in terms of their correctness and empirical performance. In this letter, we address the state of the art technique of slack reclamation of the existing generic RTA framework for multiprocessors. We present its mathematical proof of correctness and empirical performance evaluation, which have not been revealed to this day.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2017EDL8260/_p
Copy
@ARTICLE{e101-d_8_2136,
author={Hyeongboo BAEK, Donghyouk LIM, Jinkyu LEE, },
journal={IEICE TRANSACTIONS on Information},
title={Proof and Evaluation of Improved Slack Reclamation for Response Time Analysis of Real-Time Multiprocessor Systems},
year={2018},
volume={E101-D},
number={8},
pages={2136-2140},
abstract={RTA (Response time analysis) is a popular technique to guarantee timing requirements for a real-time system, and therefore the RTA framework has been widely studied for popular scheduling algorithms such as EDF (Earliest Deadline First) and FP (Fixed Priority). While a number of extended techniques of RTA have been introduced, some of them cannot be used since they have not been proved and evaluated in terms of their correctness and empirical performance. In this letter, we address the state of the art technique of slack reclamation of the existing generic RTA framework for multiprocessors. We present its mathematical proof of correctness and empirical performance evaluation, which have not been revealed to this day.},
keywords={},
doi={10.1587/transinf.2017EDL8260},
ISSN={1745-1361},
month={August},}
Copy
TY - JOUR
TI - Proof and Evaluation of Improved Slack Reclamation for Response Time Analysis of Real-Time Multiprocessor Systems
T2 - IEICE TRANSACTIONS on Information
SP - 2136
EP - 2140
AU - Hyeongboo BAEK
AU - Donghyouk LIM
AU - Jinkyu LEE
PY - 2018
DO - 10.1587/transinf.2017EDL8260
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E101-D
IS - 8
JA - IEICE TRANSACTIONS on Information
Y1 - August 2018
AB - RTA (Response time analysis) is a popular technique to guarantee timing requirements for a real-time system, and therefore the RTA framework has been widely studied for popular scheduling algorithms such as EDF (Earliest Deadline First) and FP (Fixed Priority). While a number of extended techniques of RTA have been introduced, some of them cannot be used since they have not been proved and evaluated in terms of their correctness and empirical performance. In this letter, we address the state of the art technique of slack reclamation of the existing generic RTA framework for multiprocessors. We present its mathematical proof of correctness and empirical performance evaluation, which have not been revealed to this day.
ER -
English
