Stack-Based Single-Pass Cache Simulation
Memory systems composed of cache memories are so crucial to high-performance computer architecture design that performance evaluation of cache memories has received phenomenal attention. In 1991, Smith catalogued 487 technical papers and reports that dealt with some aspect of caching . This chapter and the following chapter address the problem of simulating cache-based memory systems, To do this optimally requires measurement of the performance of a large number of cache designs. This process is called memory system prototyping here, since this process uses software to construct a prototype memory system. The performance of the prototype is then tested for a set of benchmarks. This software performance evaluation process must be fast yet accurate. A fast method is important so that memory address traces from long-running benchmarks can be used to explore a large design space of potential prototypes.
Unable to display preview. Download preview PDF.
- T. M. Conte, “Systematic computer archiecture prototyping,” Ph.D. dissertation, Department of Electrical and Computer Engineering, University of Illinois, Urbana, IL, 1992.Google Scholar
- I. J. Haikala, “Cache hit ratios with geometric task switch intervals,” in Proc. 11th Ann. Int’l Symp. Computer Architecture, (Ann Arbor, MI), pp. 364–371, June 1984.Google Scholar
- W. W. Hwu and T. M. Conte, “The susceptibility of programs to context switching,” IEEE Transactions on Computers, vol. C-43, no. 9, pp. 993–1003, Sep. 1994.Google Scholar
- J. G. Thompson, Efficient analysis of caching systems, Ph.D. dissertation, Computer Science Division, University of California, Berkeley, CA, Oct. 1987. Report No. UCB/CSD 87/374.Google Scholar
- I. L. Traiger and D. R. Slutz, “One-pass techniques for the evaluation of memory hierarchies,” IBM Research Report RJ 892, IBM, San Jose, CA, July 1971.Google Scholar