Abstract
Cache is a processor feature that can greatly affect the performance of programs. The average-case performance of most recently used(MRU) Cache replacement policy was studied. Research results showed that MRU outperforms LRU in some circumstances. By analyzing loop structures with sequential memory accesses, the condition for this phenomenon is given and formally proved. Extensive experiments were conducted on real-time timing analysis benchmarks for different Cache configurations, which shows that MRU outperforms LRU in lots of execution scenarios. Combining this result and recent results on the real-time performance of MRU replacement policy, it can be concluded that MRU has very high performance in both average-case and real-time metrics.
Original language | English |
---|---|
Pages (from-to) | 1554-1557 |
Number of pages | 4 |
Journal | Dongbei Daxue Xuebao/Journal of Northeastern University |
Volume | 34 |
Issue number | 11 |
Publication status | Published - 26 Dec 2013 |
Externally published | Yes |
Keywords
- Average-case performance
- Cache
- MRU(most recently used)
- Real-time performance
- Replacement policy
ASJC Scopus subject areas
- General Engineering
- Computer Science Applications
- Applied Mathematics