DocumentCode :
3311661
Title :
Willow: a scalable shared memory multiprocessor
Author :
Bennett, John K. ; Dwarkadas, Sandhya ; Greenwood, Jay ; Speight, Evan
Author_Institution :
Dept. of Electr. & Comput. Eng., Rice Univ., Houston, TX, USA
fYear :
1992
fDate :
16-20 Nov 1992
Firstpage :
336
Lastpage :
345
Abstract :
The authors are currently developing Willow, a shared memory multiprocessor whose design provides system capacity and performance capable of supporting over 1000 commercial microprocessors. Recently, they have focused their attention on the design of a 64-processor prototype that tests most of their ideas about scalability. In this paper, they describe the factors that traditionally limited the scalability of shared memory systems. These include enforcing sequential consistency, inefficient synchronization, memory latency and bandwidth limitations, bus and memory contention, the necessity to enforce inclusion on lower-level caches, and limited I/O (input/output) bandwidth. They then describe how the Willow architecture addresses each of these issues. Finally, they present data in order to evaluate the effect of the major architectural innovations in Willow on the performance of several parallel applications
Keywords :
performance evaluation; shared memory systems; 64-processor prototype; Willow; bandwidth limitations; inefficient synchronization; memory latency; performance; scalable shared memory multiprocessor; sequential consistency; system capacity; Bandwidth; Delay; Joining processes; Laboratories; Large-scale systems; Microprocessors; Programming profession; Prototypes; Scalability; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Supercomputing '92., Proceedings
Conference_Location :
Minneapolis, MN
Print_ISBN :
0-8186-2630-5
Type :
conf
DOI :
10.1109/SUPERC.1992.236669
Filename :
236669
Link To Document :
بازگشت