Name
Abstract | ||
|---|---|---|
Modern multiprocessor and multicore architectures adopt shared resources to meet increased performance requirements. Adaptive arbiters, such as FlexRay, have been adopted to grant access to shared resources. While increasing the performance, timing analysis is more challenging with this kind of arbiter. This paper considers real-time tasks that are composed of super blocks, while super blocks themselves are composed of phases. Phases are characterized by their worst-case computation time on their processing element and their worst-case number of access requests to a shared resource. Resource accesses, such as access to caches or scratchpad memory, are synchronous and cause the processing element to stall until the access is served. Based on dynamic programming, we develop an algorithm that safely derives an upper-bound of the worst-case response time of a phase. The worst-case response time of a task can then be determined for both sequential or time-triggered execution of super blocks. Experimental results are conducted for a real-world application. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/RTAS.2011.28 | IEEE Real-Time and Embedded Technology and Applications Symposium |
Keywords | DocType | ISSN |
access request,performance requirement,worst-case response time,resource access interference,adaptive arbiter,super block,shared resource,timing analysis,worst-case computation time,worst-case number,processing element,resource access,adaptive resource arbiters,interference,resource allocation,computational complexity,dynamic scheduling,dynamic programming,algorithm design and analysis | Conference | 1545-3421 |
Citations | PageRank | References |
30 | 1.16 | 15 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andreas Schranzhofer | 1 | 234 | 9.10 |
| Rodolfo Pellizzoni | 2 | 1020 | 53.85 |
| Jian-Jia Chen | 3 | 2007 | 129.20 |
| Lothar Thiele | 4 | 14025 | 957.82 |
| Marco Caccamo | 5 | 425 | 31.84 |