Skip to content
Free planNo credit card requiredStart writing

article · 1990

Cache Coherence Protocols for Large-Scale Multiprocessors

C. Smith, David Lars Chaiken, David Lars Chaiken

Cited by 0Abstract and details only

Abstract

Caches have the potential to provide multiprocessors with an automatic mechanism for reducing both network traffic and average memory access latency. However, cachebased systems must address the problem of cache coherence. This thesis presents the results of the search for a cache coherence solution for Alewife, a large-scale multiprocessor being built at MIT. The research focuses on coherence protocols that use a directory, a list of cached copies of data, to avoid the need for a system-wide broadcast mechanism. The structure and the implementation of a number of coherence schemes are evaluated with coupled and decoupled simulation techniques. In addition to comparing the protocols in terms of hardware overhead and performance, the thesis reports on the experience gained by implementing several different schemes in ASIM, the Alewife machine simulator. The protocol search reaches two major conclusions: First, by using system-level optimizations, it is possible to use caches to build la...

Cite this paper

APA 7

Smith, C., Chaiken, D. L., & Chaiken, D. L. (1990). Cache Coherence Protocols for Large-Scale Multiprocessors.

MLA 9

Smith, C., et al. “Cache Coherence Protocols for Large-Scale Multiprocessors.” 1990.

Chicago

Smith, C., David Lars Chaiken, and David Lars Chaiken. 1990. “Cache Coherence Protocols for Large-Scale Multiprocessors.”

Harvard

Smith, C., Chaiken, D.L. and Chaiken, D.L. (1990) ‘Cache Coherence Protocols for Large-Scale Multiprocessors’.

BibTeX
@article{smith1990cache,
  title = {{Cache Coherence Protocols for Large-Scale Multiprocessors}},
  author = {Smith, C. and Chaiken, David Lars and Chaiken, David Lars},
  year = {1990}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.