Name
Abstract | ||
|---|---|---|
With real-time systems, feasibility analysis is based on worst-case scenarios. At run-time, worst-case situations are often very unlikely to occur. With the system being dimensioned for the worst-case, one faces low resource utilization and implicit loss in performance at run-time. We propose to use run-time monitoring for evaluating the deviation of job releases from their worst-case release bound. This allows us to compute a conservative bound on the future workload. Based on this, we design a scheme for reclaiming computation time, which has been originally allocated for jobs which are now known to be absent. By organizing the consumption of extra computing time in a dynamic and time-safe manner, we improve the run-time performance of applications and provably maintain the worst-case guarantees for their response times. We evaluate the usefulness of the presented approach by using randomly generated traces of job releases. |
Year | Venue | Keywords |
|---|---|---|
2016 | 2016 Design, Automation & Test in Europe Conference & Exhibition (DATE) | worst-case guarantees,real-time systems,feasibility analysis,low resource utilization,run-time monitoring,job release deviation,worst-case release bound |
Field | DocType | ISSN |
Workload,Computer science,Real-time computing,Jitter,Computation | Conference | 1530-1591 |
Citations | PageRank | References |
0 | 0.34 | 14 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Syed Md Jakaria Abdullah | 1 | 0 | 0.34 |
| Kai Lampka | 2 | 228 | 14.45 |
| Wang Yi | 3 | 4232 | 332.05 |