An evaluation of directory schemes for cache coherence

  • Agarwal A
  • Simoni R
  • Hennessy J
 et al. 
  • 65

    Readers

    Mendeley users who have this article in their library.
  • 190

    Citations

    Citations of this article.

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
sufficient

Author-supplied keywords

  • buffer storage
  • cache coherence
  • directory schemes
  • multiprocessor systems
  • parallel architectures
  • parallel machines
  • performance evaluation
  • shared-memory multiprocessors
  • snoopy cache systems
  • storage management
  • trace driven simulation

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • A Agarwal

  • R Simoni

  • J Hennessy

  • M Horowitz

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free