DocumentCode
749765
Title
The Stanford Dash multiprocessor
Author
Lenoski, Daniel ; Laudon, James ; Gharachorloo, Kourosh ; Weber, Wolf-Dietrich ; Gupta, Anoop ; Hennessy, John ; Horowitz, Mark ; Lam, Monica S.
Author_Institution
Stanford Univ., CA, USA
Volume
25
Issue
3
fYear
1992
fDate
3/1/1992 12:00:00 AM
Firstpage
63
Lastpage
79
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.<>
Keywords
multiprocessing systems; parallel architectures; Dash architecture; Dash prototype machine; Stanford Dash multiprocessor; cache coherence; coherent caches; directory architecture; distributed directory-based protocol; memory accesses; near-linear performance growth; processing nodes; processor utilization; scalability; scalable bandwidth; scalable high-performance machine; shared data; shared memory; single address space; software support; Bandwidth; Computer architecture; Hardware; Laboratories; Memory architecture; Microprocessors; Protocols; Prototypes; Scalability; Software prototyping;
fLanguage
English
Journal_Title
Computer
Publisher
ieee
ISSN
0018-9162
Type
jour
DOI
10.1109/2.121510
Filename
121510
Link To Document