Title :
Impact of resource sharing on performance and performance prediction
Author :
Reineke, Jan ; Wilhelm, Reinhard
Author_Institution :
FR Inf., Univ. des Saarlandes, Saarbrucken, Germany
Abstract :
Multi-core processors are increasingly considered as execution platforms for embedded systems because of their good performance/energy ratio. Many applications implemented on multi-core platforms are safety- and some also time-critical. A critical issue for these applications is the reduced predictability of such systems resulting from the interference of different applications on shared resources. These interferences can be at least of two kinds: Several applications may request a resource at the same time, but the resource can only admit one access at a time. As a consequence, an arbitration mechanism may delay the request of all but one application, thus slowing down the other applications. This is the case of resources like buses, typically called bandwidth resources. On the other hand, one application may also change the state of a shared resource such that another application using that resource will suffer from a slowdown. This is the case with shared memories, such as shared caches and shared dynamic random-access memories, which fall into the class of storage resources. Interference on shared resources makes worst-case execution time (WCET) analysis of applications more difficult since a task or a thread can no longer be analyzed for its timing behavior in isolation. All potential interferences slowing down (or speeding up) the task under analysis have to be considered. This leads to a combinatorial explosion of the analysis complexity, as all possible interleavings of different threads have to be analyzed. The survey [1] considers several aspects of the execution of sets of tasks on multi-core platforms that have to do with the interference of the tasks on shared resources. One question is how the actual performance of tasks is slowed down by other co-running tasks. Another is how to compute bounds on the slow-down in order to derive sound guarantees for the timing behavior. A major problem is the increased complexity of this task compared to the single-t- sk single-core case. This has led to the situation that industry is developing embedded systems for multi-core platforms while there exist no timing-analysis methods and tools that are both sound and precise.
Keywords :
cache storage; embedded systems; microprocessor chips; random-access storage; shared memory systems; WCET; analysis complexity; arbitration mechanism; bandwidth resources; combinatorial explosion; embedded systems; execution platforms; multicore processors; performance prediction; performance-energy ratio; resource sharing; shared caches; shared dynamic random-access memories; shared memories; timing analysis methods; timing behavior; worst-case execution time analysis; Aerospace electronics; Bandwidth; Benchmark testing; Complexity theory; Hardware; Interference; Timing;
Conference_Titel :
Design, Automation and Test in Europe Conference and Exhibition (DATE), 2014
Conference_Location :
Dresden
DOI :
10.7873/DATE.2014.109