This Article 
 Bibliographic References 
 Add to: 
Evaluating Associativity in CPU Caches
December 1989 (vol. 38 no. 12)
pp. 1612-1630
The authors present new and efficient algorithms for simulating alternative direct-mapped and set-associative caches and use them to quantify the effect of limited associativity on the cache miss ratio. They introduce an algorithm, forest simulation, for simulating alternative direct-mapped caches and generalize one, which they call all-associativity simulation, for simulating alternative direc

[1] A. Agarwal, R.L. Sites, and M. Horowitz, "ATUM: A New Technique for Capturing Address Traces Using Microcode,"13th Int'l Symp. Computer Architecture, 1986, IEEE Computer Soc. Press, Los Alamitos, Calif., pp. 119-127.
[2] A. Agarwal, J. Hennessy, and M. Horowitz, "Cache performance of operating systems and multiprogramming workloads,"ACM Trans. Comput. Syst., vol. 6, pp. 393-431, Nov. 1988.
[3] A. Agarwal, M. Horowitz, and J. Hennessy, "An analytical cache model,"ACM Trans. Comput. Syst., vol. 7, pp. 184-215, May 1989.
[4] C. Alexander et al., "Cache Memory Performance in a Unix Environment,"Computer Architecture News, Vol. 14, No. 3, June 1986, pp. 14-70.
[5] J.-L. Baer and W.-H. Wang, "On the Inclusion Properties for Multi-Level Cache Hierarchies,"Proc. 15th Ann. Int'l Symp. Computer Architecture, IEEE-CS Press, Los Alamitos, Calif., Order No. 861, 1988, pp. 73-80.
[6] L. A. Belady, "A study of replacement algorithms for a virtual-storage computer,"IBM Syst. J., vol. 5, no. 2, pp. 78-101, 1966.
[7] J. Bell, D. Casasent, and C. G. Bell, "An investigation of alternative cache organizations,"IEEE Trans. Comput., vol. C-23, no. 4, pp. 346-351, Apr. 1974.
[8] B. T. Bennett and V. J. Kruskal, "LRU stack processing,"IBM J. Res. Develop., pp. 353-357, July 1975.
[9] J. M. Chambers, W. S. Cleveland, B. Kleiner, and P. A. Tukey,Graphical Methods for Data Analysis. Boston, MA: Duxbury, 1983.
[10] J. Cho, A. J. Smith, and H. Sachs, "The memory architecture and the cache and memory management unit for the Fairchild clipper processor," Comput. Sci. Div., Univ. Calif., Berkeley, CA, Tech. Rep. UCB/CSD 86/289, Apr. 1986.
[11] D.W. Clark, "Cache Performance in the VAX 11/780,"ACM Trans. Computer Systems, Vol. 1, No. 1, Feb. 1983, pp. 24-37.
[12] M. C. Easton and R. Fagin, "Cold-start versus warm-start miss ratios,"Commun. ACM, vol. 21, no. 10, pp. 866-872, Oct. 1978.
[13] I. J. Haikala and P. H. Kutvonen, "Split cache organizations," CS Rep. C-1984-40., Univ. of Helsinki, Aug. 1984.
[14] M. D. Hill, DineroIII Documentation, Unpublished Unix-style Man Page, Univ. of California, Berkeley, October 1985.
[15] M. D. Hill, "Aspects of cache memory and instruction buffer performance," Tech. Rep. UCB/CSD 87/381, Univ. of California at Berkeley, Berkeley, CA, Nov. 1987.
[16] M. D. Hill, "A case for direct-mapped caches,"IEEE Comput. Mag., vol. 21, pp. 25-40, Dec. 1988.
[17] K. R. Kaplan and R. O. Winder, "Cache-based computer systems,"IEEE Comput. Mag., vol. 6, pp. 30-36, Mar. 1973.
[18] J. S. Liptay, "Structural aspects of the System/360 Model 85, Part II: The cache,"IBM Syst. J., vol. 7, no. 1, pp. 15-21, 1968.
[19] R. L. Mattson, J. Gecsei, D. R. Slutz, and I. L. Traiger, "Evaluation techniques for storage hierarchies,"IBM Syst. J., vol. 9, no. 2, pp. 78-117, 1970.
[20] R. L. Mattson, "Evaluation of multilevel memories,"IEEE Trans. Magn., vol. MAG-7, no. 4, pp. 814-819, Dec. 1971.
[21] F. Olken, "Efficient methods for calculating the success function of fixed space replacement policies," Masters Report, Lawrence Berkeley Laboratory LBL-12370, Univ. of California, Berkeley, May 1981.
[22] S. Przybylski, M. Horowitz, and J. Hennessy, "Performance Trade-offs in Cache Design,"15th Ann. Int'l Symp. Computer Architecture, IEEE CS Press, Los Alamitos, CA, Order No. 861, 1988, pp. 290-298.
[23] T. Puzak, "An analysis of cache replacement algorithms," Ph.D. dissertation., Univ. of Massachusetts, Feb. 1985.
[24] D. R. Slutz and I. L. Traiger, "Evaluation techniques for cache memory hierarchies," IBM Tech. Rep. RJ 1045 (#17547), May 1972.
[25] A. J. Smith, "Two methods for the efficient analysis of memory address trace data,"IEEE Trans. Software Eng., vol. SE-3, no. 1, pp. 94-101, Jan. 1977.
[26] 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, pp. 121-130, Mar. 1978.
[27] A. Smith, "Cache Memories,"Computing Surveys, Vol. 14, No. 3, Sept. 1982, pp. 473- 530.
[28] A. J. Smith, "Cache evaluation and the impact of workload choice," inProc. 12th Annu. Symp. Comput. Architecture, Boston, MA, June 1985, pp. 64-73.
[29] A.J. Smith, "Bibliography and Readings on CPU Cache Memories and Related Topics,"Computer Architecture News, Jan. 1986, pp. 22-42.
[30] A. J. Smith, "Line (block) size choice for CPU cache memories,"IEEE Trans. Computers, vol. 36, no. 9, pp. 1063-1074, 1987.
[31] J. E. Smith and J. R. Goodman, "Instruction cache replacement policies and organizations,"IEEE Trans. Comput., vol. C-34, pp. 234-241, Mar. 1985.
[32] W. D. Strecker, "Cache memories for PDP-11 family computers," inProc. Third Annu. Conf. Comput. Architecture, 1976, pp. 155- 158.
[33] J. G. Thompson, "Efficient analysis of caching systems," Comput. Sci. Div. Tech. Rep. UCB/Comput. Sci. Dept. 87/374, Univ. of California, Berkeley, Oct. 1987.
[34] I. L. Traiger and D. R. Slutz, "One-pass techniques for the evaluation of memory hierarchies," IBM Tech. Rep. RJ 892 (#15563), July 1971.

Index Terms:
associativity; CPU caches; direct-mapped; set-associative; cache miss ratio; forest simulation; all-associativity simulation; stack simulation; buffer storage; content-addressable storage.
M.D. Hill, A.J. Smith, "Evaluating Associativity in CPU Caches," IEEE Transactions on Computers, vol. 38, no. 12, pp. 1612-1630, Dec. 1989, doi:10.1109/12.40842
Usage of this product signifies your acceptance of the Terms of Use.