Proceedings of the 22nd International Conference on Real-Time Networks and Systems 2014
DOI: 10.1145/2659787.2659799
|View full text |Cite
|
Sign up to set email alerts
|

Distributed run-time WCET controller for concurrent critical tasks in mixed-critical systems

Abstract: International audienceWhen integrating mixed critical systems on a multi/many-core, one challenge is to ensure predictability for high crit-icality tasks and an increased utilization for low criticality tasks. In this paper, we address this problem when several high criticality tasks with different deadlines, periods and offsets are concurrently executed on the system. We pro-pose a distributed run-time WCET controller that works as follows: (1) locally, each critical task regularly checks if the interferences… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
26
0
1

Year Published

2015
2015
2022
2022

Publication Types

Select...
3
2
1

Relationship

2
4

Authors

Journals

citations
Cited by 33 publications
(27 citation statements)
references
References 23 publications
0
26
0
1
Order By: Relevance
“…Following similar reasoning to the ready phase, the response time of the controller for the update phase is the cost of executing one iteration of the control-loop plus the waiting times to gain access to the required critical sections. The cost of one loop-iteration is C [11−12] +|K| * C [13][14][15]19] +deg + (v) * C [16−18] . The worst-case waiting time to gain access to the required critical sections is when all cores execute a ready phase or update phase (whichever is greater) that tries to gain access to the same critical sections.…”
Section: Update Phasementioning
confidence: 99%
See 3 more Smart Citations
“…Following similar reasoning to the ready phase, the response time of the controller for the update phase is the cost of executing one iteration of the control-loop plus the waiting times to gain access to the required critical sections. The cost of one loop-iteration is C [11−12] +|K| * C [13][14][15]19] +deg + (v) * C [16−18] . The worst-case waiting time to gain access to the required critical sections is when all cores execute a ready phase or update phase (whichever is greater) that tries to gain access to the same critical sections.…”
Section: Update Phasementioning
confidence: 99%
“…For the update phase, the worst case for C T A U is equal to the execution of one iteration of the for-loop without taking the branch at line 16, i.e. |K| * C [13][14][15][16]19] . This time delay is sufficient because: i) the waiting times to gain access to the required critical sections have already been accounted for in the response time of the update phase, and ii) the branch is considered to be taken once, which has also been accounted for in the response time of the update phase.…”
Section: Timing Alignmentmentioning
confidence: 99%
See 2 more Smart Citations
“…However, it involves speculation, reducing partitioning guarantees, as summarized in Figure 9. In [33] Kritikakou et al propose a distributed run-time WCET controller, another regulation software solution enabling the user to run a critical application at the same time as non-critical applications.…”
Section: B Regulation Software Paradigmmentioning
confidence: 99%