This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Instruction Cache Replacement Policies and Organizations
March 1985 (vol. 34 no. 3)
pp. 234-241
J.E. Smith, Department of Electrical and Computer Engineering, University of Wisconsin-Madison
Instruction cache replacement policies and organizations are analyzed both theoretically and experimentally. Theoretical analyses are based on a new model for cache references ?the loop model. First the loop model is used to study replacement policies and cache organizations. It is concluded theoretically that random replacement is better than LRU and FIFO, and that under certain circumstances, a direct-mapped or set-associative cache may perform better than a full-associative cache organization. Experimental results using instruction trace data are then given and analyzed. The experimental results indicate that the loop model provides a good explanation for observed cache performance.
Index Terms:
set-associative, Cache memories, direct-mapped, fully associative, loop model, memory organization, replacement algorithms
Citation:
J.E. Smith, J.R. Goodman, "Instruction Cache Replacement Policies and Organizations," IEEE Transactions on Computers, vol. 34, no. 3, pp. 234-241, March 1985, doi:10.1109/TC.1985.1676566
Usage of this product signifies your acceptance of the Terms of Use.