An evaluation of directory schemes for cache coherence
Authors:
Open Access
- 1 August 1998
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 353-362
Abstract
The problem of cache coherence in shared-memory multiprocessors is addressed using two basic approaches: directory schemes and snoopy cache systems. Directory schemes for cache coherence are potentially attractive in large multiprocessor systems that are beyond the scaling limits of the snoopy cache schemes. Slight modifications to directory schemes can make them competitive in performance with snoopy cache schemes for small multiprocessors. Trace-driven simulation, using data collected from several real multiprocessor applications, is used to compare the performance of standard directory schemes, modifications to these schemes, and snoopy cache protocols. In addition, the simulations show that most blocks that are written into are present in only a small number of other caches, which makes broadcast invalidates inefficient. This result suggests that a directory structure that stores with each block only a small number of pointers to caches containing the block is sufficientKeywords
This publication has 6 references indexed in Scilit:
- Memory-reference characteristics of multiprocessor applications under MACH1988
- Cache coherence protocols: evaluation using a multiprocessor simulation modelACM Transactions on Computer Systems, 1986
- Dynamic decentralized cache schemes for mimd parallel processors1984
- A low-overhead coherence solution for multiprocessors with private cache memories1984
- Using cache memory to reduce processor-memory traffic1983
- Cache MemoriesACM Computing Surveys, 1982