Name
Abstract | ||
|---|---|---|
It remains a challenging problem to tightly estimate the worst-case response time of an application in a distributed embedded system, especially when there are dependencies between tasks. Recently, a holistic worst-case response time analysis approach called scheduling time bound analysis has been proposed to find a tight upper bound of the worst-case response times of applications specified by a set of task graphs. Since it assumes that the starting offsets of applications are known and fixed, it fails to make a tight estimation despite increased computation time when the starting offsets are dynamic. To overcome this problem, we propose a novel conservative performance analysis, called hybrid performance analysis, combining the response time analysis technique and the scheduling time bound analysis technique to compute a tighter bound faster. The proposed scheme is proven to be conservative formally. Through extensive experiments with real-life benchmarks and synthetic examples, the superior performance of our proposed approach compared with previous methods is confirmed. |
Year | DOI | Venue |
|---|---|---|
2018 | https://doi.org/10.1007/s11241-018-9307-x | Real-Time Systems |
Keywords | DocType | Volume |
Worst-case response time,Performance analysis,Response time analysis,Partitioned scheduling,Data dependency,Task graph | Journal | abs/1604.04951 |
Issue | ISSN | Citations |
3 | 0922-6443 | 0 |
PageRank | References | Authors |
0.34 | 18 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Junchul Choi | 1 | 49 | 4.34 |
| Hyunok Oh | 2 | 457 | 40.49 |
| Soonhoi Ha | 3 | 1684 | 174.65 |