DocumentCode :
2032377
Title :
Scalability Study of the KSR-1
Author :
Ramachandran, Umakishore ; Shah, Gautam ; Ravikumar, S. ; Muthukumarasamy, Jeyakumar
Author_Institution :
Georgia Institute of Technology, Atlanta, GA
Volume :
1
fYear :
1993
fDate :
16-20 Aug. 1993
Firstpage :
237
Lastpage :
240
Abstract :
There has been concern in the architectural community regarding the scalability of shared memory parallel architectures owing to the potential for large latencies for remote memory accesses. KSR-1 is a re cently introduced commercial shared memory parallel architecture, and the scalability of KSR-1 is the focus of this research. Our key conclusions are as follows: The communication network of KSR-1 is fairly re silient in supporting simultaneous remote memory ac cesses from several processors. The multiple communi cation paths realized through this pipelining help in the efficient implementation of tournament-style barrier synchronization algorithms. The architectural features of KSR-1 such as the poststore and prefetch are useful for boosting the performance of parallel applications. The network does saturate when there are simultane ous remote memory accesses from a fully populated (32 node) ring.
Keywords :
Concurrent computing; Delay; Message passing; Parallel algorithms; Parallel architectures; Parallel processing; Parallel programming; Prefetching; Random access memory; Scalability;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Processing, 1993. ICPP 1993. International Conference on
Conference_Location :
Syracuse, NY, USA
ISSN :
0190-3918
Print_ISBN :
0-8493-8983-6
Type :
conf
DOI :
10.1109/ICPP.1993.161
Filename :
4134146
Link To Document :
بازگشت