Proceedings of the Ninth ACM International Conference on Embedded Software 2011
DOI: 10.1145/2038642.2038696
|View full text |Cite
|
Sign up to set email alerts
|

Timing and schedulability analysis for distributed automotive control applications

Abstract: High-end cars today consist of more than 100 electronic control units (ECUs) that are connected to a set of sensors and actuators and run multiple distributed control applications. The design flow of such architectures consists of specifying control applications as Simulink/Stateflow models, followed by generating code from them and finally mapping such code onto multiple ECUs. In addition, the scheduling policies and parameters on both the ECUs and the communication buses over which they communicate also need… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(7 citation statements)
references
References 8 publications
0
7
0
Order By: Relevance
“…As per Constraint (10), we might schedule an occurrence of an activity beyond the hyperperiod H. However, note that if we schedule an activity at time t then it repeats at time t + H. And therefore, we cannot schedule another activity at…”
Section: A Decision Variablesmentioning
confidence: 99%
See 2 more Smart Citations
“…As per Constraint (10), we might schedule an occurrence of an activity beyond the hyperperiod H. However, note that if we schedule an activity at time t then it repeats at time t + H. And therefore, we cannot schedule another activity at…”
Section: A Decision Variablesmentioning
confidence: 99%
“…As inputs, it takes (i) the element i to be scheduled; (ii) ši and ŝi , the earliest and the latest possible start times of this element based on the precedence relation and the end-to-end latency constraint, computed according to Equations ( 14) and ( 18), respectively. We compute ŝi in Equation ( 18) as the maximum of three values: 1) its lower bound LB j i defined by Equation (10), i.e., start of the corresponding period; 2) completion time of the previous element occurrence if it is a message and j > 1; and 3) start time of the earliest activity in the application plus the end-to-end latency bound Lw minus processing time of the element e i to satisfy end-to-end latency constraints.…”
Section: B Feasibility Stagementioning
confidence: 99%
See 1 more Smart Citation
“…© 2021 The Authors. The Journal of Engineering published by John Wiley & Sons Ltd on behalf of The Institution of Engineering and Technology instructs strict partitioning and mapping of the tasks to definite cores [3]. Tasks are scheduled for the intended cores based on static priority scheme.…”
Section: Introductionmentioning
confidence: 99%
“…Parallelized application tasks need to be efficiently scheduled and allocated to multiple computing cores to accomplish the functions within the specified deadlines to ensure the system is fail safe. The state of the art task scheduling algorithm for multicore ECUs instructs strict partitioning and mapping of the tasks to definite cores [3]. Tasks are scheduled for the intended cores based on static priority scheme.…”
Section: Introductionmentioning
confidence: 99%