The DOI matches its Crossref record.
The directory-based cache coherence protocol for the DASH multiprocessor
Abstract
DASH is a scalable shared-memory multiprocessor currently being developed at Stanford's Computer Systems Laboratory. The architecture consists of powerful processing nodes, each with a portion of the shared-memory, connected to a scalable interconnection network. A key feature of DASH is its distributed directory-based cache coherence protocol. Unlike traditional snoopy coherence protocols, the DASH protocol does not rely on broadcast; instead it uses point-to-point messages sent between the processors and memories to keep caches consistent. Furthermore, the DASH system does not contain any single serialization or control point. While these features provide the basis for scalability, they also force a reevaluation of many fundamental issues involved in the design of a protocol. These include the issues of correctness, performance and protocol complexity. In this paper, we present the design of the DASH coherence protocol and discuss how it addresses the above issues. We also discuss our strategy for verifying the correctness of the protocol and briefly compare our protocol to the IEEE Scalable Coherent Interface protocol.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Multifacet's general execution-driven multiprocessor simulator (GEMS) toolset
Martin, M. M. K., Sorin, D. J., Beckmann, B. M., Marty, M. R., Xu, M., Alameldeen, A. R., Moore, K. E., Hill, M. D., & Wood, D. A. (2005) · ACM SIGARCH Computer Architecture News · doi:10.1145/1105734.1105747 · Cited by 1,558
The SGI Origin: a ccNUMA highly scalable server
Laudon, J., & Lenoski, D. (1997) · Proceedings of the 24th annual international symposium on Computer architecture · doi:10.1145/264107.264206 · Cited by 775
Self-citationImplementation and performance of Munin
Carter, J. B., Bennett, J. K., & Zwaenepoel, W. (1991) · Proceedings of the thirteenth ACM symposium on Operating systems principles · doi:10.1145/121132.121159 · Cited by 689
An asymmetric distributed shared memory model for heterogeneous parallel systems
Gelado, I., Stone, J. E., Cabezas, J., Patel, S., Navarro, N., & Hwu, W.-M. W. (2010) · ACM SIGARCH Computer Architecture News · doi:10.1145/1735970.1736059 · Cited by 25
Metadata
- Authors
- Lenoski, D., Laudon, J., Gharachorloo, K., Gupta, A., & Hennessy, J.
- Venue
- Proceedings of the 17th annual international symposium on Computer Architecture - ISCA '90
- Publisher
- ACM Press
- Published
- 1990
- Pages
- 148-159
- ISSN
- 1063-6897 (ISSN-L)
- OpenAlex
- W4251549117
- Cited by
- 170
- References
- 0
- FWCI
- 16.02
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The directory-based cache coherence protocol for the DASH multiprocessor. https://app.cochat.ai/papers/10.1145/325164.325132
- The paper
- Lenoski, D., Laudon, J., Gharachorloo, K., Gupta, A., & Hennessy, J. (1990). The directory-based cache coherence protocol for the DASH multiprocessor. Proceedings of the 17th annual international symposium on Computer Architecture - ISCA '90. https://doi.org/10.1145/325164.325132
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.