A Scheduling Algorithm for Minimizing Exclusive Window Durations in Time-Triggered Controller Area Network
- Authors
- Ryu, Minsoo
- Issue Date
- Aug-2009
- Publisher
- Oxford University Press
- Keywords
- TTCAN; real-time communication; periodic and sporadic messages; scheduling; worst-case delays
- Citation
- IEICE Transactions on Communications, v.E92B, no.8, pp 2739 - 2742
- Pages
- 4
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEICE Transactions on Communications
- Volume
- E92B
- Number
- 8
- Start Page
- 2739
- End Page
- 2742
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/176413
- DOI
- 10.1587/transcom.E92.B.2739
- ISSN
- 0916-8516
1745-1345
- 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(n(2)) 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.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 컴퓨터소프트웨어학부 > 1. Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.