Please use this identifier to cite or link to this item:
DC FieldValue
dc.titleTiming analysis of concurrent programs running on shared cache multi-cores
dc.contributor.authorLI YAN
dc.identifier.citationLI YAN (2010-01-13). Timing analysis of concurrent programs running on shared cache multi-cores. ScholarBank@NUS Repository.
dc.description.abstractMemory 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 thesis, we develop a timing analysis method for concurrent software running on multi-cores with a shared instruction cache. We do not handle data cache, shared memory synchronization and code sharing across tasks. The method progressively refines 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 tighter worst-case response time (WCRT) estimates than existing shared-cache analysis on a real-world embedded application.
dc.subjectWCET, Abstract Interpretation, Shared Cache, Multi-Core, WCRT, Message Sequence Chart
dc.contributor.departmentCOMPUTER SCIENCE
dc.contributor.supervisorTULIKA MITRA
dc.description.degreeconferredMASTER OF SCIENCE
Appears in Collections:Master's Theses (Open)

Show simple item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
MSc_Thesis_SoC_Li_Yan_HT080127J.pdf791.62 kBAdobe PDF



Page view(s)

checked on May 17, 2019


checked on May 17, 2019

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.