Name
Abstract | ||
|---|---|---|
Upper bounding the execution time of tasks running on multicore processors is a hard challenge. This is especially so with commercial-off-the-shelf (COTS) hardware that conceals its internal operation. The main difficulty stems from the contention effects on access to hardware shared resources (e.g., buses) which cause task's timing behavior to depend on the load that co-runner tasks place on them. This dependence reduces time composability and constrains incremental verification. In this paper we introduce the concepts of resource-usage signatures and templates, to abstract the potential contention caused and incurred by tasks running on a multicore. We propose an approach that employs resource-usage signatures and templates to enable the analysis of individual tasks largely in isolation, with low integration costs, producing execution time estimates per task that are easily composable throughout the whole system integration process. We evaluate the proposal on a 4-core NGMP-like multicore architecture. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1145/2744769.2744901 | DAC |
Field | DocType | Citations |
Computer science,Real-time computing,Multicore architecture,Execution time,Template,Multi-core processor,Composability,Embedded system,Bounding overwatch,System integration | Conference | 2 |
PageRank | References | Authors |
0.41 | 18 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gabriel Fernandez | 1 | 17 | 2.85 |
| Javier Jalle | 2 | 58 | 3.22 |
| Jaume Abella | 3 | 1046 | 76.34 |
| Eduardo Quiñones | 4 | 528 | 31.18 |
| Tullio Vardanega | 5 | 633 | 54.28 |
| Francisco J. Cazorla | 6 | 1304 | 95.50 |