This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Model of Workloads and its Use in Miss-Rate Prediction for Fully Associative Caches
July 1992 (vol. 41 no. 7)
pp. 811-825

A mathematical model for the behavior of programs or workloads is presented and from it is extracted the miss ratio of a finite, fully associative cache (or other first-level memory) using least-recently-used replacement under those workloads. To obtain miss ratios, the function u(t, L), defined to be the number of unique lines of size L referenced before time t, is modeled. Empirical observations show that this function appears to have the form u(t, L)=(W L/sup a/t/sup b/) (d/sup log/ /sup L log t/) where W, a, b, d are constants that are related, respectively, to the working set size, locality of references to nearby addresses (spatial locality), temporal locality (locality in time not attributable to spatial locality), and interactions between spatial locality and temporal locality. The miss ratio of a finite fully associative cache can be approximated as the time derivative of u(t, L) evaluated where the function has a value equal to the size of the cache. When the miss ratios from this model are compared to measured miss ratios for a representative trace, the accuracy is high for large caches. For smaller caches, the model is close but not highly precise.

[1] A. Agarwal, private communication, Jan. 1989.
[2] A. Agarwal, M. Horowitz, and J. Hennessy, "An analytical cache model,"ACM Trans. Comput. Syst., vol. 7, pp. 184-215, May 1989.
[3] C. K. Chow, "On optimization of storage hierarchy,"IBM J. Res. Develop., vol. 18, pp. 194-203, May 1974.
[4] C. K. Chow, "Determining the optimum capacity of a cache memory,"IBM Tech. Discl. Bull., vol. 17, no. 10, pp. 3163-3166, Mar. 1975.
[5] C. K. Chow, "Determination of a cache's capacity and its matching storage hierarchy,"IEEE Trans. Comput., vol. C-25, no. 2, pp. 157-164, Feb. 1976.
[6] P. J. Denning and S. C. Schwartz, "Properties of the working-set model,"Commun. ACM, vol. 15, no. 3, pp. 191-198, Mar. 1972.
[7] M. C. Easton, "Computations of cold-start miss ratios,"IEEE Trans. Comput., vol. C-27, no. 5, pp. 404-408, May 1978.
[8] M. C. Easton and R. Fagin, "Cold-start versus warm-start miss ratios,"Commun. ACM, vol. 21, no. 10, pp. 866-872, Oct. 1978.
[9] J. E. Gillis and G. H. Weiss, "Expected number of distinct sites visited by a random walk with an infinite variance,"J. Math. Phys., vol. 11, no. 4, pp. 1307-1312, Apr. 1970.
[10] J.R. Goodman, "Using Cache Memory to Reduce Processor Memory Traffic,"Proc. 10th Symp. Computer Architecture, IEEE CS Press, Los Alamitos, Calif., Order No. 473 (microfiche only), 1983, pp. 124-131.
[11] M. D. Hill, "Correction to 'Evaluating associativity in caches',"IEEE Trans. Comput., vol. 40, no. 3, p. 371, Mar. 1991.
[12] M. D. Hill and A. J. Smith, "Evaluating associativity in caches,"IEEE Trans. Comput., vol. 38, no. 12, pp. 1612-1630, Dec. 1989.
[13] M. Kobayashi and M. H. MacDougall, "The stack growth function: Cache line reference models,"IEEE Trans. Comput., vol. 38, no. 6, pp. 798-805, June 1989.
[14] B. Mandelbrot,The Fractal Geometry of Nature. San Francisco, CA: Freeman, 1983.
[15] G. S. Rao, "Performance analysis of cache memories,"J. ACM, vol. 25, no. 3, pp. 378-385, July 1978.
[16] J. H. Saltzer, "A simple linear model of demand paging performance,"Commun. ACM, vol. 17, no. 4, pp. 181-186, Apr. 1974.
[17] A. J. Smith, "A comparative study of set-associative memory mapping algorithms and their use for cache and main memory,"IEEE Trans. Software Eng., vol. SE-4, no. 2, pp. 121-130, Mar. 1978.
[18] A. J. Smith, "Line (block) size choice for CPU cache memories,"IEEE Trans. Computers, vol. 36, no. 9, pp. 1063-1074, 1987.
[19] W. D. Strecker, "Transient behavior of cache memories,"ACM Trans. Comput. Syst., vol. 1, no. 4, pp. 281-293, Nov. 1983.
[20] D. Thiébaut, "Influence of program transients in computer cache memories, Ph.D. dissertation, Univ. of Massachusetts, Amherst, MA, Feb. 1988.
[21] D. F. Thiebaut, "On the fractal dimension of computer programs and its application to the prediction of the cache miss ratio,"IEEE Trans. Comput.vol. 38, no. 7, pp. 1012-1026, July 1989.
[22] D. F. Thiebaut and H. S. Stone, "Footprints in the cache,"ACM Trans. Comput. Syst., vol. 5, no. 4, pp. 305-329, Nov. 1987.
[23] D. F. Thiebaut, H. S. Stone, and J. L. Wolf, "A theory of cache behavior," IBM Res. Rep. RC 13309, Nov. 1987.
[24] J. Voldmanet al., "Fractal nature of software-cache interaction,"IBM J. Res. Develop., vol. 27, pp. 164-170, Mar. 1983.

Index Terms:
model of workloads; miss-rate prediction; fully associative caches; mathematical model; behavior of programs; fully associative cache; least-recently-used replacement; spatial locality; temporal locality; buffer storage; content-addressable storage; memory architecture.
Citation:
J.P. Singh, H.S. Stone, D.F. Thiebaut, "A Model of Workloads and its Use in Miss-Rate Prediction for Fully Associative Caches," IEEE Transactions on Computers, vol. 41, no. 7, pp. 811-825, July 1992, doi:10.1109/12.256450
Usage of this product signifies your acceptance of the Terms of Use.