15095

A Survey Of Techniques for Cache Locking

Sparsh Mittal
Oak Ridge National Laboratory (ORNL)
ACM Transactions on Design Automation of Electronic Systems (TODAES), 2016

@article{mittal2016surveyCacheLocking,

   title={A Survey Of Techniques for Cache Locking},

   year={2016},

   author={Sparsh Mittal},

   journal={ACM Transactions on Design Automation of Electronic Systems (TODAES)},

   url={https://www.academia.edu/19668626/A_Survey_Of_Techniques_for_Cache_Locking},

   urllink={https://www.researchgate.net/publication/286925817_A_Survey_Of_Techniques_for_Cache_Locking}

}

Download Download (PDF)   View View   Source Source   

440

views

Cache memory, although important for boosting application performance, is also a source of execution time variability, and this makes its use difficult in systems requiring worst case execution time (WCET) guarantees. Cache locking is a promising approach for simplifying WCET estimation and providing predictability and hence, several commercial processors provide ability for locking cache. However, cache locking also has several disadvantages (e.g. extra misses for unlocked blocks, complex algorithms required for selection of locking contents, etc.) and hence, a careful management is required to realize the full potential of cache locking. In this paper, we present a survey of techniques proposed for cache locking. We categorize the techniques in several groups to underscore their similarities and differences. We also discuss the opportunities and obstacles in using cache locking. We hope that this paper will help researchers in getting insights into cache locking schemes and will also stimulate further work in this area.
VN:F [1.9.22_1171]
Rating: 3.0/5 (2 votes cast)
A Survey Of Techniques for Cache Locking, 3.0 out of 5 based on 2 ratings

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: