research-article

The Stanford Dash Multiprocessor

Authors:

Daniel Lenoski,

Kourosh Gharachorloo,

Wolf-Dietrich Weber,

Monica S. LamAuthors Info & Claims

Computer, Volume 25, Issue 3

Pages 63 - 79

https://doi.org/10.1109/2.121510

Published: 01 March 1992 Publication History

Abstract

The overall goals and major features of the directory architecture for shared memory (Dash) are presented. The fundamental premise behind the architecture is that it is possible to build a scalable high-performance machine with a single address space and coherent caches. The Dash architecture is scalable in that it achieves linear or near-linear performance growth as the number of processors increases from a few to a few thousand. This performance results from distributing the memory among processing nodes and using a network with scalable bandwidth to connect the nodes. The architecture allows shared data to be cached, significantly reducing the latency of memory accesses and yielding higher processor utilization and higher overall performance. A distributed directory-based protocol that provides cache coherence without compromising scalability is discussed in detail. The Dash prototype machine and the corresponding software support are described.

References

[1]

1. J. Archibald and J.-L. Baer, "Cache Coherence Protocols: Evaluation Using a Multiprocessor Simulation Model," ACM Trans. Computer Systems, Vol. 4, No. 4, Nov. 1986, pp. 273-298.

Digital Library

[2]

2. L. Censier and P. Feautrier, "A New Solution to Coherence Problems in Multicache Systems," IEEE Trans. Computers, Vol. C-27, No. 12, Dec. 1978, pp. 1,112-1,118.

[3]

1. A. Gupta, W.-D. Weber, and T. Mowry, "Reducing Memory and Traffic Requirements for Scalable Directory-Based Cache Coherence Schemes," Proc. 1990 Int'l Conf. Parallel Processing, IEEE Computer Society Press, Los Alamitos, Calif., Order No. 2101, pp. 312-321.

[4]

2. B.W. O'Krafka and A.R. Newton, "An Empirical Evaluation of Two Memory-Efficient Directory Methods," Proc. 17th Int'l Symp. Computer Architecture, IEEE CS Press, Los Alamitos, Calif., Order No. 2047, 1990, pp. 138-147.

[5]

3. L. Lamport, "How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs," IEEE Trans. Computers, Sept. 1979, Vol. C-28, No. 9, pp. 241-248.

[6]

4. C. Scheurich and M. Dubois, "Dependency and Hazard Resolution in Multiprocessors," Proc. 14th Int'l Symp. Computer Architecture, IEEE CS Press, Los Alamitos, Calif., Order No. 776, 1987, pp. 234-243.

[7]

5. K. Gharachorloo, A. Gupta, and J. Hennessy, "Performance Evaluation of Memory Consistency Models for Shared-Memory Multiprocessors," Proc. Fourth Int'l Conf. Architectural Support for Programming Languages and Operating Systems, ACM, New York, 1991, pp. 245- 257.

[8]

6. T. Mowry and A. Gupta, "Tolerating Latency Through Software in Shared-Memory Multiprocessors," J. Parallel and Distributed Computing, Vol. 12, No. 6, June 1991, pp. 87-106.

Digital Library

[9]

7. J.R. Goodman, M.K. Vernon, and P.J. Woest, "Efficient Synchronization Primitives for Large-Scale Cache-Coherent Multiprocessors," Proc. Third Int'l Conf. Architectural Support for Programming Languages and Operating Systems, IEEE CS Press, Los Alamitos, Calif., Order No. 1936, 1989, pp. 64-73.

[10]

8. D. Lenoski et al., "The Directory-Based Cache Coherence Protocol for the Dash Multiprocessor," Proc. 17th Int'l Symp. Computer Architecture, IEEE CS Press, Los Alamitos, Calif., Order No. 2047, 1990, pp. 148-159.

[11]

9. A.W. Wilson, Jr., "Hierarchical Cache/ Bus Architecture for Shared Memory Multiprocessors," Proc. 14th Int'l Symp. Computer Architecture, IEEE CS Press, Los Alamitos, Calif., Order No. 776, 1987, pp. 244-252.

[12]

10. D.R. Cheriton, H.A. Goosen, and P.D. Boyle, "Paradigm: A Highly Scalable Shared-Memory Multicomputer Architecture," Computer, Vol. 24, No. 2, Feb. 1991, pp. 33-46.

Digital Library

[13]

11. D.V. James et al., "Distributed-Directory Scheme: Scalable Coherent Interface," Computer, Vol. 23, No. 6, June 1990, pp. 74-77.

Digital Library

[14]

12. A. Agarwal et al., "Limitless Directories: A Scalable Cache Coherence Scheme," Proc. Fourth Int'l Conf. Architectural Support for Programming Languages and Operating Systems, ACM, New York, 1991, pp. 224-234.

[15]

13. A. Gupta et al., "Comparative Evaluation of Latency Reducing and Tolerating Techniques," Proc. 18th Int'l Symp. Computer Architecture, IEEE CS Press, Los Alamitos, Calif., Order No. 2146, 1991, pp. 254-263.

Cited By

Zhang MMa THua JLiu ZChen KDing NDu FJiang JMa TWu YDruschel PKaufmann AMace JFlinn JSeltzer M(2023)Partial Failure Resilient Memory Management System for (CXL-based) Distributed Shared MemoryProceedings of the 29th Symposium on Operating Systems Principles10.1145/3600006.3613135(658-674)Online publication date: 23-Oct-2023
https://dl.acm.org/doi/10.1145/3600006.3613135
Liu MBaumann ACrooks NSchwarzkopf M(2023)Fabric-Centric ComputingProceedings of the 19th Workshop on Hot Topics in Operating Systems10.1145/3593856.3595907(118-126)Online publication date: 22-Jun-2023
https://dl.acm.org/doi/10.1145/3593856.3595907
Reed DGannon DDongarra J(2023)HPC ForecastCommunications of the ACM10.1145/355230966:2(82-90)Online publication date: 20-Jan-2023
https://dl.acm.org/doi/10.1145/3552309
Show More Cited By

Index Terms

The Stanford Dash Multiprocessor

Recommendations

The performance impact of flexibility in the Stanford FLASH multiprocessor

A flexible communication mechanism is a desirable feature in multiprocessors because it allows support for multiple communication protocols, expands performance monitoring capabilities, and leads to a simpler design and debug process. In the Stanford ...
The performance impact of flexibility in the Stanford FLASH multiprocessor
ASPLOS VI: Proceedings of the sixth international conference on Architectural support for programming languages and operating systems

A flexible communication mechanism is a desirable feature in multiprocessors because it allows support for multiple communication protocols, expands performance monitoring capabilities, and leads to a simpler design and debug process. In the Stanford ...
Managing wire delay in chip multiprocessor caches

Comments

Information & Contributors

Information

Published In

cover image Computer

Computer Volume 25, Issue 3

March 1992

82 pages

ISSN:0018-9162

Editor:
Jon T. Butler
Naval Postgraduate School

Issue’s Table of Contents

Copyright © Copyright © 1992 IEEE. All Rights Reserved.

Publisher

IEEE Computer Society Press

Washington, DC, United States

Publication History

Published: 01 March 1992

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

353
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zhang MMa THua JLiu ZChen KDing NDu FJiang JMa TWu YDruschel PKaufmann AMace JFlinn JSeltzer M(2023)Partial Failure Resilient Memory Management System for (CXL-based) Distributed Shared MemoryProceedings of the 29th Symposium on Operating Systems Principles10.1145/3600006.3613135(658-674)Online publication date: 23-Oct-2023
https://dl.acm.org/doi/10.1145/3600006.3613135
Liu MBaumann ACrooks NSchwarzkopf M(2023)Fabric-Centric ComputingProceedings of the 19th Workshop on Hot Topics in Operating Systems10.1145/3593856.3595907(118-126)Online publication date: 22-Jun-2023
https://dl.acm.org/doi/10.1145/3593856.3595907
Reed DGannon DDongarra J(2023)HPC ForecastCommunications of the ACM10.1145/355230966:2(82-90)Online publication date: 20-Jan-2023
https://dl.acm.org/doi/10.1145/3552309
Shi WTang ZShi J(2023)Using confidence interval to summarize the evaluating results of DSM systemsJournal of Computer Science and Technology10.1007/BF0295192915:1(73-83)Online publication date: 22-Mar-2023
https://dl.acm.org/doi/10.1007/BF02951929
Srivatsa AMansour MRheindt SGabriel DWild THerkersdorf A(2021)DynaCo: Dynamic Coherence Management for Tiled Manycore ArchitecturesInternational Journal of Parallel Programming10.1007/s10766-020-00688-649:4(570-599)Online publication date: 1-Aug-2021
https://dl.acm.org/doi/10.1007/s10766-020-00688-6
Oswald NNagarajan VSorin DMartínez JDuato JEeckhout L(2020)HieraGenProceedings of the ACM/IEEE 47th Annual International Symposium on Computer Architecture10.1109/ISCA45697.2020.00077(888-899)Online publication date: 30-May-2020
https://dl.acm.org/doi/10.1109/ISCA45697.2020.00077
Zhao BHou RDong JHuang MMckee SZhang QLiu YLi YZhang LMeng D(2019)VeniceACM Transactions on Computer Systems10.1145/331036036:1(1-26)Online publication date: 14-Mar-2019
https://dl.acm.org/doi/10.1145/3310360
Srivatsa ARheindt SGabriel DWild THerkersdorf A(2019)CoD: Coherence-on-Demand – Runtime Adaptable Working Set Coherence for DSM-Based Manycore ArchitecturesEmbedded Computer Systems: Architectures, Modeling, and Simulation10.1007/978-3-030-27562-4_2(18-33)Online publication date: 7-Jul-2019
https://dl.acm.org/doi/10.1007/978-3-030-27562-4_2
Han KLee JLee JLee WPedram M(2018)TEI-NoCIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2017.269326937:2(458-471)Online publication date: 1-Feb-2018
https://dl.acm.org/doi/10.1109/TCAD.2017.2693269
Forsell MRoivainen JLeppänen V(2018)REPLICA MBTACThe Journal of Supercomputing10.1007/s11227-017-2199-z74:5(1911-1933)Online publication date: 1-May-2018
https://dl.acm.org/doi/10.1007/s11227-017-2199-z
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents