This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Cache Operations by MRU Change
June 1988 (vol. 37 no. 6)
pp. 700-709
The performance of set associative caches is analyzed. The method used is to group the cache lines into regions according to their positions in the replacement stacks of a cache, and then to observe how the memory access of a CPU is distributed over these regions. Results from the preserved CPU traces show that the memory accesses are heavily concentrated on the most recently used (MRU) region

[1] J.-L. Baer and G. R. Sager, "Dynamic improvement of locality in virtual memory systems,"IEEE Trans. Software Eng., vol. SE-1, pp. 54-62, Mar. 1976.
[2] L. A. Belady, "A study of replacement algorithms for a virtual-storage computer,"IBM Syst. J., vol. 5, no. 2, pp. 78-101, 1966.
[3] E. G. Coffman and P. J. Denning,Operating Systems Theory. Englewood Cliffs, NJ: Prentice-Hall, 1973.
[4] The version of Fluid Dynamics, called NASAVA3D, was written in September, 1981 by Benek and revised by Pulliam in June 1983 at NASA, Ames Research, CA.
[5] J. D. Gindele, "Buffer block prefetching method,"IBM Tech. Disclos. Bull., vol. 20, pp. 696-697, July 1984.
[6] F. A. Giraud, R. N. Rechtschaffen, P. L. Rosenfeld, and K. So, "Cache prefetching with chaining,"IBM Tech Disclos. Bull., vol. 27, p. 2437, Sept. 1984.
[7] IBM Corp., "IBM 3081 functional characteristics," GA22-7076, Poughkeepsie, 1982.
[8] J. S. Liptay, "Structure aspects of the System/360 model 85: II The cache,"IBM Syst. J., vol. 7, no. 1, pp. 15-21, 1968.
[9] 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.
[10] W. C. McGee, "The IMS/VS system,"IBM Syst. J., vol. 16, no. 2, pp. 84-168, 1977.
[11] IBM,OS/VS2 MVS Overview, GC28-0984, May 1980.
[12] T. Puzak, "An analysis of cache replacement algorithms," Ph.D. dissertation., Univ. of Massachusetts, Feb. 1985.
[13] A. J. Smith, "Two methods for the efficient analysis of memory address trace data,"IEEE Trans. Software Eng., vol. SE-3, pp. 94- 101, Jan. 1977.
[14] A. J. Smith, "Sequential program prefetching in memory hierarchies,"IEEE Comput., vol. 11, pp. 7-21, Dec. 1978.
[15] A. Smith, "Cache Memories,"Computing Surveys, Vol. 14, No. 3, Sept. 1982, pp. 473- 530.

Index Terms:
MRU change; performance; set associative caches; memory access; CPU; most recently used; replacement algorithms; prefetch algorithms; cache simulation; content-addressable storage; performance evaluation; storage management; virtual storage.
Citation:
K. So, R.N. Rechtschaffen, "Cache Operations by MRU Change," IEEE Transactions on Computers, vol. 37, no. 6, pp. 700-709, June 1988, doi:10.1109/12.2208
Usage of this product signifies your acceptance of the Terms of Use.