This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Exact Analysis of Bernoulli Superposition of Streams Into a Least Recently Used Cache
August 1995 (vol. 21 no. 8)
pp. 682-688
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.

[1] E.G. Coffman and P.J. Denning,Operating Systems Theory, Prentice-Hall Inc., Englewood Cliffs, N.J., 1973.
[2] A. Dan,P. Yu,, and J.Y. Chung,“Database access characterization for buffer hitprediction,” Ninth Int’l Conf. on Data Engineering,Vienna, Austria, pp. 134-152, 1993.
[3] J.G. Kemeny and J.L. Snell,Finite Markov Chains.New York: D. Van Nostrand Co., 1963.
[4] H. Levy,T.G. Messinger,, and R.J.T. Morris,“The cache assignment problem and its application to database buffermanagement,” preprint available from authors.
[5] R.L. Mattson,J. Gecsei,D.R. Slutz,, and I.L. Traiger,“Evaluation techniques for storage hierarchies,” IBM Systems J., vol. 9, no. 2, pp. 78-117, 1970.
[6] R.J.T. Morris,“Analysis of superposition of streams into a cachebuffer,” ACM Sigmetrics Conf. on Measurement and Modeling of Computer Systems,Santa Clara, Calif., May 1993.
[7] B. Samadi,“TUNEX: A knowledge-based system for performance tuning of the UNIXoperating system,” IEEE Transactions on Software Engineering, vol. 15, no. 7, pp. 861-874, July 1989.
[8] H.S. Stone, J. Turek, and J.L. Wolf, "Optimal Partitioning of Cache Memory," IEEE Trans. Computers, vol. 41, no. 9, pp. 1,054-1,068, Sept. 1992.
[9] J.Z. Teng and R.A. Gumaer,“Managing IBM database 2 buffers to maximizeperformance,” IBM Systems J., vol. 23, no. 2, 1984.

Index Terms:
Memory systems, cache memory, memory hierarchy, buffer management, least recently used, database buffer management.
Citation:
Hanoch Levy, Robert J.T. Morris, "Exact Analysis of Bernoulli Superposition of Streams Into a Least Recently Used Cache," IEEE Transactions on Software Engineering, vol. 21, no. 8, pp. 682-688, Aug. 1995, doi:10.1109/32.403792
Usage of this product signifies your acceptance of the Terms of Use.