Please use this identifier to cite or link to this item:
|Title:||Timing analysis of concurrent programs running on shared cache multi-cores|
|Citation:||Li, Y., Suhendra, V., Liang, Y., Mitra, T., Roychoudhury, A. (2009). Timing analysis of concurrent programs running on shared cache multi-cores. Proceedings - Real-Time Systems Symposium : 57-67. ScholarBank@NUS Repository. https://doi.org/10.1109/RTSS.2009.32|
|Abstract:||Memory accesses form an important source of timing unpredictability. Timing analysis of real-time embedded software thus requires bounding the time for memory accesses. Multiprocessing, a popular approach for performance enhancement, opens up the opportunity for concurrent execution. However due to contention for any shared memory by different processing cores, memory access behavior becomes more unpredictable, and hence harder to analyze. In this paper, we develop a timing analysis method for concurrent software running on multi-cores with a shared instruction cache. Communication across tasks is by message passing where the message mailboxes are accessed via interrupt service routines. We do not handle data cache, shared memory synchronization and code sharing across tasks. Our method progressively improves the lifetime estimates of tasks that execute concurrently on multiple cores, in order to estimate potential conflicts in the shared cache. Possible conflicts arising from overlapping task lifetimes are accounted for in the hit-miss classification of accesses to the shared cache, to provide safe execution time bounds. We show that our method produces lower worst-case response time (WCRT) estimates than existing shared-cache analysis on a real-world embedded application. © 2009 IEEE.|
|Source Title:||Proceedings - Real-Time Systems Symposium|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 19, 2019
WEB OF SCIENCETM
checked on Mar 5, 2019
checked on Mar 17, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.