Please use this identifier to cite or link to this item:
Title: Integrated instruction cache analysis and locking in multitasking real-time systems
Authors: Ding, H.
Liang, Y.
Mitra, T. 
Keywords: Cache locking
Issue Date: 2013
Source: Ding, H.,Liang, Y.,Mitra, T. (2013). Integrated instruction cache analysis and locking in multitasking real-time systems. Proceedings - Design Automation Conference : -. ScholarBank@NUS Repository.
Abstract: Cache locking improves timing predictability at the cost of performance. We explore a novel approach that opportunistically employs both cache analysis and locking to enhance schedulability in preemptive multi-tasking real-time systems. The cache is spatially shared among the tasks by statically locking a portion of the cache per task. To overcome the issue of limited cache space per task, we keep a portion of the cache unlocked and let all the tasks use it through time-multiplexing. Compared to locking the entire cache for each task during execution, our approach obviates the cost of reloading locked blocks at preemption. But we require static cache analysis for WCET estimation and cache related preemption delay (CRPD) analysis of the unlocked cache space. We design an algorithm to make appropriate locking decisions through accurate costbenefit analysis. Experimental results show that our integrated approach leads to substantially improved schedulability results compared to cache analysis and cache locking employed individually. Categories and Subject Descriptors C.3 [Special-purpose and Application-based Systems]: [Realtime and embedded systems] General Terms Algorithm, Design, Performance. Copyright © 2013 ACM.
Source Title: Proceedings - Design Automation Conference
ISBN: 9781450320719
ISSN: 0738100X
DOI: 10.1145/2463209.2488916
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Mar 8, 2018

Page view(s)

checked on Mar 10, 2018

Google ScholarTM



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