Optimal Partitioning of Cache Memory
IEEE Transactions on Computers
Analysis of superposition of streams into a cache buffer
SIGMETRICS '93 Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems
The LRU-K page replacement algorithm for database disk buffering
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Goal-oriented memory allocation in database management systems
Goal-oriented memory allocation in database management systems
ACM Computing Surveys (CSUR)
Operating Systems Theory
Data Structures and Algorithms
Data Structures and Algorithms
Characterization of database access pattern for analytic prediction of buffer hit probability
The VLDB Journal — The International Journal on Very Large Data Bases
Exact Analysis of Bernoulli Superposition of Streams Into a Least Recently Used Cache
IEEE Transactions on Software Engineering
2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Cache hit ratios with geometric task switch intervals
ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
| Hi-index | 0.00 |
Given N request streams and L驴N LRU caches, the cache assignment problem asks to which cache each stream should be assigned in order to minimize the overall miss rate. An efficient solution to this problem is provided, based on characterizing each stream using the stack reference model and characterizing the interaction of the streams using a bursty stream model. It is shown that for Bernoulli (purely random) mixing of streams, the optimal cache assignment is to have one cache per stream. But in practice streams are mixed in a way that is much "burstier" than can be represented by the Bernoulli model. Therefore a method is presented for superposition of bursty streams. The performance of the methods developed for bursty stream superposition and cache assignment are tested using trace data obtained from the database system DB2. The resulting cache assignment recommendations are then applied to the DB2 system, and considerable performance improvement is found to result.