On the theory and potential of LRU-MRU collaborative cache management

Saved in:
Bibliographic Details
Title: On the theory and potential of LRU-MRU collaborative cache management
Authors: Xiaoming Gu, Chen Ding
Contributors: The Pennsylvania State University CiteSeerX Archives
Source: http://www.cs.rochester.edu/%7Ecding/Documents/Publications/ismm11a.pdf.
Collection: CiteSeerX
Subject Terms: Categories and Subject Descriptors D.3.4 [PROGRAMMING LANGUAGES, Processors- Compilers, Memory management General Terms Algorithms, Measurement, Performance Keywords collaborative caching, bipartite cache, cache replacement algorithm, LRU, MRU, OPT
Description: The goal of cache management is to maximize data reuse. Collaborative caching provides an interface for software to communicate access information to hardware. In theory, it can obtain optimal cache performance. In this paper, we study a collaborative caching system that allows a program to choose different caching methods for its data. As an interface, it may be used in arbitrary ways, sometimes optimal but probably suboptimal most times and even counter productive. We develop a theoretical foundation for collaborative caches to show the inclusion principle and the existence of a distance metric we call LRU-MRU stack distance. The new stack distance is important for program analysis and transformation to target a hierarchical collaborative cache system rather than a single cache configuration. We use 10 benchmark programs to show that optimal caching may reduce the average miss ratio by 24%, and a simple feedback-driven compilation technique can utilize collaborative cache to realize 50 % of the optimal improvement.
Document Type: text
File Description: application/pdf
Language: English
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.222.2944; http://www.cs.rochester.edu/%7Ecding/Documents/Publications/ismm11a.pdf
Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.222.2944
http://www.cs.rochester.edu/%7Ecding/Documents/Publications/ismm11a.pdf
Rights: Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Accession Number: edsbas.F1EFADA0
Database: BASE
Be the first to leave a comment!
You must be logged in first