Affiliation:
1. City University of Hong Kong
2. University of California, San Diego
Abstract
Cache locking is a cache management technique to preclude the replacement of locked cache contents. Cache locking is often adopted to improve cache access predictability in Worst-Case Execution Time (WCET) analysis. Static cache locking methods have been proposed recently to improve Average-Case Execution Time (ACET) performance. This article presents an approach, Branch Prediction-directed Dynamic Cache Locking (BPDCL), to improve system performance through cache conflict miss reduction. In the proposed approach, the control flow graph of a program is first partitioned into disjoint execution regions, then memory blocks worth locking are determined by calculating the locking profit for each region. These two steps are conducted during compilation time. At runtime, directed by branch predictions, locking routines are prefetched into a small high-speed buffer. The predetermined cache locking contents are loaded and locked at specific execution points during program execution. Experimental results show that the proposed BPDCL method exhibits an average improvement of 25.9%, 13.8%, and 8.0% on cache miss rate reduction in comparison to cases with no cache locking, the static locking method, and the dynamic locking method, respectively.
Funder
Research Grants Council, University Grants Committee, Hong Kong
Publisher
Association for Computing Machinery (ACM)
Subject
Hardware and Architecture,Software
Reference23 articles.
1. Instruction cache locking inside a binary rewriter
2. ARM. 2000. ARM940T technical reference manual. http://infocenter.arm.com/help/topic/com.arm.doc.ddi 0144b/940T_TRM_S.pdf. ARM. 2000. ARM940T technical reference manual. http://infocenter.arm.com/help/topic/com.arm.doc.ddi 0144b/940T_TRM_S.pdf.
3. Branch prediction for free
4. An API for Runtime Code Patching
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献