Design, Automation &Amp; Test in Europe Conference &Amp; Exhibition (DATE), 2017 2017
DOI: 10.23919/date.2017.7927230
|View full text |Cite
|
Sign up to set email alerts
|

On reducing busy waiting in autosar via task-release-delta-based runnable reordering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
3
2
2

Relationship

1
6

Authors

Journals

citations
Cited by 9 publications
(3 citation statements)
references
References 8 publications
0
3
0
Order By: Relevance
“…It is also shown in this paper how the AUTOSAR implicit design constraints influence the modeling of the evolutionary algorithm. Aiming to reduce busy waiting in AUTOSAR, Robert Hottger et al [ 21 ] propose a concept of Task-Release-Delta-based Runnable Reordering (TDRR). In order to achieve reduced task response times, increased parallel efficiency, and improved timing predictability, some AUTOSAR runnables are reordered.…”
Section: Previous Workmentioning
confidence: 99%
“…It is also shown in this paper how the AUTOSAR implicit design constraints influence the modeling of the evolutionary algorithm. Aiming to reduce busy waiting in AUTOSAR, Robert Hottger et al [ 21 ] propose a concept of Task-Release-Delta-based Runnable Reordering (TDRR). In order to achieve reduced task response times, increased parallel efficiency, and improved timing predictability, some AUTOSAR runnables are reordered.…”
Section: Previous Workmentioning
confidence: 99%
“…An extreme case of that is offline scheduling of short tasks with a run-to-completion semantic -an option of the AU-TOSAR OS specification [9]. As concurrency is planned ahead of runtime, the offline scheduler can make sure that race conditions are avoided even without synchronization at runtime [13]. Though, this approach works only for static task schedules in contrast to the dynamic task scheduling and synchronization of MXKERNEL. Scalability and performance can also be improved by avoiding concurrency situations with an innovative system design.…”
Section: Related Workmentioning
confidence: 99%
“…Over the years, many results pertaining to the task and resource mapping problems as well as related optimization problems have appeared [13,34,70,76,87,88,99,100,101,111,112,115,134,149,152,154,168,180,189,195,198,208]. Particularly well-known is Lakshmanan et al's task-set partitioning heuristic for use with the MPCP [123].…”
Section: Further Research Directionsmentioning
confidence: 99%