DocumentCode :
3304650
Title :
A performance evaluation of tree-based coherent distributed shared memory
Author :
Wada, K. ; Obata, M. ; Nakamura, M. ; Yamazaki, T.
Author_Institution :
Inst. of Inf. Sci. & Electron., Tsukuba Univ., Ibaraki, Japan
Volume :
2
fYear :
1993
fDate :
19-21 May 1993
Firstpage :
390
Abstract :
The system is organized based on the tree-based coherent algorithm, in which the coherence is maintained at the network nodes, in a fully distributed and localized manner. The system has an overlapped tree structure, where the processors are located on the leaves. The proposed coherence protocol relies only on one-to-one message passing. Simulation shows that, in a matrix multiplication program, the 32-processor system can execute 21 times faster than the single processor. How the performance of network nodes and block size affect overall system performance is also discussed. As regards performance, only the copy-request and the invalidate message are thought to be insufficient
Keywords :
coherence; computational complexity; distributed algorithms; distributed memory systems; matrix multiplication; memory protocols; message passing; performance evaluation; shared memory systems; block size; coherence protocol; distributed shared memory; matrix multiplication; one-to-one message passing; overall system performance; overlapped tree structure; tree-based coherent algorithm; Broadcasting; Clustering algorithms; Message passing; National electric code; Partitioning algorithms; Protocols; Scalability; Space technology; System performance; Tree data structures;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, Computers and Signal Processing, 1993., IEEE Pacific Rim Conference on
Conference_Location :
Victoria, BC
Print_ISBN :
0-7803-0971-5
Type :
conf
DOI :
10.1109/PACRIM.1993.407339
Filename :
407339
Link To Document :
بازگشت