A novel analytical method for worst case response time estimation of distributed embedded systems
- Authors
- Kim, Jinwoo; Oh, Hyunok; Choi, Junchul; Ha, Hyojin; Ha, Soonhoi
- Issue Date
- May-2013
- Publisher
- Association for Computing Machinery
- Keywords
- Distributed embedded system; Performance analysis; Worst case response time
- Citation
- Proceedings - Design Automation Conference, pp.1 - 10
- Indexed
- SCOPUS
- Journal Title
- Proceedings - Design Automation Conference
- Start Page
- 1
- End Page
- 10
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/162829
- DOI
- 10.1145/2463209.2488893
- ISSN
- 0738-100X
- Abstract
- In this paper, we propose a novel analytical method, called scheduling time bound analysis, to find a tight upper bound of the worst-case response time in a distributed real-time embedded system, considering execution time variations of tasks, jitter of input arrivals, and scheduling anomaly behavior in a multi-tasking system all together. By analyzing the graph topology and worstcase scheduling scenarios, we measure the conservative scheduling time bound of each task. The proposed method supports an arbitrary mixture of preemptive and non-preemptive processing elements. Its speed is comparable to compositional approaches while it gives a much tighter bound. The advantages of the proposed approach compared with related work were verified by experimental results with randomly generated task graphs and a real-life automotive application.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 정보시스템학과 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/162829)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.