A Scheduling Algorithm for Minimizing Exclusive Window Durations in Time-Triggered Controller Area Network
Summary :
Time-Triggered Controller Area Network is widely accepted as a viable solution for real-time communication systems such as in-vehicle communications. However, although TTCAN has been designed to support both periodic and sporadic real-time messages, previous studies mostly focused on providing deterministic real-time guarantees for periodic messages while barely addressing the performance issue of sporadic messages. In this paper, we present an O(n2) scheduling algorithm that can minimize the maximum duration of exclusive windows occupied by periodic messages, thereby minimizing the worst-case scheduling delays experienced by sporadic messages.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E92-B No.8 pp.2739-2742
- Publication Date
- 2009/08/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E92.B.2739
- Type of Manuscript
- LETTER
- Category
- Network
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
Minsoo RYU, "A Scheduling Algorithm for Minimizing Exclusive Window Durations in Time-Triggered Controller Area Network" in IEICE TRANSACTIONS on Communications,
vol. E92-B, no. 8, pp. 2739-2742, August 2009, doi: 10.1587/transcom.E92.B.2739.
Abstract: Time-Triggered Controller Area Network is widely accepted as a viable solution for real-time communication systems such as in-vehicle communications. However, although TTCAN has been designed to support both periodic and sporadic real-time messages, previous studies mostly focused on providing deterministic real-time guarantees for periodic messages while barely addressing the performance issue of sporadic messages. In this paper, we present an O(n2) scheduling algorithm that can minimize the maximum duration of exclusive windows occupied by periodic messages, thereby minimizing the worst-case scheduling delays experienced by sporadic messages.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.2739/_p
Copy
@ARTICLE{e92-b_8_2739,
author={Minsoo RYU, },
journal={IEICE TRANSACTIONS on Communications},
title={A Scheduling Algorithm for Minimizing Exclusive Window Durations in Time-Triggered Controller Area Network},
year={2009},
volume={E92-B},
number={8},
pages={2739-2742},
abstract={Time-Triggered Controller Area Network is widely accepted as a viable solution for real-time communication systems such as in-vehicle communications. However, although TTCAN has been designed to support both periodic and sporadic real-time messages, previous studies mostly focused on providing deterministic real-time guarantees for periodic messages while barely addressing the performance issue of sporadic messages. In this paper, we present an O(n2) scheduling algorithm that can minimize the maximum duration of exclusive windows occupied by periodic messages, thereby minimizing the worst-case scheduling delays experienced by sporadic messages.},
keywords={},
doi={10.1587/transcom.E92.B.2739},
ISSN={1745-1345},
month={August},}
Copy
TY - JOUR
TI - A Scheduling Algorithm for Minimizing Exclusive Window Durations in Time-Triggered Controller Area Network
T2 - IEICE TRANSACTIONS on Communications
SP - 2739
EP - 2742
AU - Minsoo RYU
PY - 2009
DO - 10.1587/transcom.E92.B.2739
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E92-B
IS - 8
JA - IEICE TRANSACTIONS on Communications
Y1 - August 2009
AB - Time-Triggered Controller Area Network is widely accepted as a viable solution for real-time communication systems such as in-vehicle communications. However, although TTCAN has been designed to support both periodic and sporadic real-time messages, previous studies mostly focused on providing deterministic real-time guarantees for periodic messages while barely addressing the performance issue of sporadic messages. In this paper, we present an O(n2) scheduling algorithm that can minimize the maximum duration of exclusive windows occupied by periodic messages, thereby minimizing the worst-case scheduling delays experienced by sporadic messages.
ER -
English
