Stack Evaluation of Arbitrary Set-Associative Multiprocessor Caches

We propose a simple solution to the problem of efficient stack evaluation of LRU multiprocessor cache memories with arbitrary set-associative mapping. It is an extension of the existing stack evaluation techniques for all set-associative LRU uniprocessor caches. Special marker entries are used in the stack to represent data blocks (or lines) deleted by an invalidation-based cache coherence protocol. A method of marker-splitting is employed when a data block below a marker in the stack is accessed. Using this technique, one-pass trace evaluation of memory access trace yields hit ratios for all cache sizes and set-associative mappings of multiprocessor caches in a single pass over a memory reference trace. Simulation experiments on some multiprocessor trace data show an order-of-magnitude speed-up in simulation time using this one-pass technique. >

[1]  Leonidas J. Guibas,et al.  A dichromatic framework for balanced trees , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[2]  Mark D. Hill,et al.  A case for direct-mapped caches , 1988, Computer.

[3]  Susan J. Eggers,et al.  On the validity of trace-driven simulation for multiprocessors , 1991, ISCA '91.

[4]  Irving L. Traiger,et al.  Evaluation Techniques for Storage Hierarchies , 1970, IBM Syst. J..

[5]  Michel Dubois,et al.  Cache inclusion and processor sampling in multiprocessor simulations , 1993, SIGMETRICS '93.

[6]  Yarsun Hsu,et al.  Efficient Stack Simulation for Shared Memory Set-Associative Multiprocessor Caches , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[7]  Paul Feautrier,et al.  A New Solution to Coherence Problems in Multicache Systems , 1978, IEEE Transactions on Computers.

[8]  Robert E. Tarjan,et al.  Self-adjusting binary search trees , 1985, JACM.

[9]  Per Stenström,et al.  A Survey of Cache Coherence Schemes for Multiprocessors , 1990, Computer.

[10]  Yuval Tamir,et al.  Hierarchical Coherency Management for Shared Virtual Memory Multicomputers , 1992, J. Parallel Distributed Comput..

[11]  Alan Jay Smith,et al.  Efficient (stack) algorithms for analysis of write-back and sector memories , 1989, TOCS.

[12]  Alexander V. Veidenbaum,et al.  A cache coherence scheme with fast selective invalidation , 1988, ISCA '88.

[13]  Wen-Hann Wang,et al.  Multilevel cache hierarchies , 1989 .

[14]  Christopher J. Van Wyk,et al.  Data Structures and C Programs, 2nd Ed. (Addison-Wesley Series in Computer Science) , 1991 .

[15]  James K. Archibald,et al.  Cache coherence protocols: evaluation using a multiprocessor simulation model , 1986, TOCS.

[16]  Paul Hudak,et al.  Memory coherence in shared virtual memory systems , 1989, TOCS.

[17]  Wen-Hann Wang,et al.  Efficient trace-driven simulation methods for cache performance analysis , 1991, TOCS.

[18]  Michel Dubois,et al.  Effects of Cache Coherency in Multiprocessors , 1982, IEEE Trans. Computers.

[19]  Abhinav Gupta,et al.  Analysis of cache invalidation patterns in multiprocessors , 1989, ASPLOS 1989.

[20]  Alan Jay Smith,et al.  Efficient Analysis of Caching Systems , 1987 .

[21]  M. M. Cherian.  A STUDY OF BACKOFF BARRIER SYNCHRONIZATION , 1989 .

[22]  Jan Gecsei.  Determining Hit Ratios for Multilevel Hierarchies , 1974, IBM J. Res. Dev..

[23]  Yarsun Hsu,et al.  Stack simulation for set-associative V/R-type caches , 1992, [1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference.

[24]  Michel Dubois,et al.  Synchronization, coherence, and event ordering in multiprocessors , 1988, Computer.

[25]  Alan Jay Smith,et al.  Evaluating Associativity in CPU Caches , 1989, IEEE Trans. Computers.

[26]  Anant Agarwal,et al.  Directory-based cache coherence in large-scale multiprocessors , 1990, Computer.

[27]  Rabin A. Sugumar,et al.  Multi-configuration simulation algorithms for the evaluation of computer architecture designs , 1993 .

[28]  Alan Jay Smith,et al.  Cache Memories , 1982, CSUR.