2018 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS) 2018
DOI: 10.1109/rtas.2018.00037
|View full text |Cite
|
Sign up to set email alerts
|

Firmness Analysis of Real-Time Applications Under Static-Priority Preemptive Scheduling

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 18 publications
0
2
0
Order By: Relevance
“…4.1(a). By taking the periodicity into account and by choosing a different offset (which does not change the problem), we see that the time domain is composed of consecutive intervals [0, 10], (10,22), [22,32], (32,55) . .…”
Section: Dms Quantification: Timed-automata Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…4.1(a). By taking the periodicity into account and by choosing a different offset (which does not change the problem), we see that the time domain is composed of consecutive intervals [0, 10], (10,22), [22,32], (32,55) . .…”
Section: Dms Quantification: Timed-automata Methodsmentioning
confidence: 99%
“…The scalability of FAn for SPP policies is compared with that of three existing approaches: 1) a brute force approach which verifies all the possible alignments between the requested and available computing resources in a window of k consecutive jobs inspired by [14]; 2) a MILP-based method inspired by [69]; 3) a timed-automata model of the problem inspired by [10]. The FAn method scales substantially better to the problem instances with a large k and a high number of tasks than the timed-automata, brute force and the MILP approaches.…”
Section: Motivationmentioning
confidence: 99%