Show simple item record

dc.contributor.authorTan, Yudongen_US
dc.contributor.authorMooney, Vincent John, III
dc.date.accessioned2005-06-17T17:35:19Z
dc.date.available2005-06-17T17:35:19Z
dc.date.issued2004en_US
dc.identifier.urihttp://hdl.handle.net/1853/6487
dc.description.abstractIn this paper, we propose an approach to estimate the Worst Case Response Time (WCRT) of each task in a preemptive multi-tasking single-processor real-time system with an L1 cache. The approach combines inter-task cache eviction analysis and intra-task cache access analysis to estimate the number of cache lines that can possibly be evicted by the preempting task and also be accessed again by the preempted task after preemptions (thus requiring the preempted task to reload the cache line(s)). This cache reload delay caused by preempting tasks is then incorporated into WCRT analysis. Two sets of applications are used to test our approach. Each set of applications contains three tasks. The experimental results show that our approach can tighten the WCRT estimate by 38% (1.6X) to 56% (2.3X) over prior state-of-the-art.en_US
dc.format.extent165268 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.publisherGeorgia Institute of Technologyen_US
dc.relation.ispartofseriesCC Technical Report; GIT-CC-04-02en_US
dc.subjectCaching
dc.subjectResponse time
dc.subjectReal-time systems
dc.titleTiming Analysis for Preemptive Multi-tasking Real-Time Systems with Cachesen_US
dc.typeTechnical Reporteng_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record