TUNEX: A Knowledge-Based System for Performance Tuning of the UNIX Operating System
IEEE Transactions on Software Engineering
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
Operating Systems Theory
Database Access Characterization for Buffer Hit Prediction
Proceedings of the Ninth International Conference on Data Engineering
The Cache Assignment Problem and Its Application to Database Buffer Management
IEEE Transactions on Software Engineering
Approximate models for general cache networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
| Hi-index | 0.00 |
We present an exact analysis of the superposition of address streams into a cache buffer which is managed according to a least recently used (LRU) replacement policy. Each of the streams is characterized by a stack depth distribution, and we seek the cache hit ratio for each stream, when the combined, or superposed, stream is applied to a shared LRU cache. In this paper the combining process is taken to be a Bernoulli switching process. This problem arises in a number of branches of computer science, particularly in database systems and processor architecture. Previously, a number of approximation techniques of various complexities have been proposed for the solution of this problem. The main contribution of this paper is the description of an exact technique. We evaluate the performance of the exact and an approximate technique on realistic data, both in a lab environment and a large database installation. The results allow comparisons of the techniques, and provide insight into the validity of the Bernoulli switching assumption.