A performance evaluation of tree-based coherent distributed shared memory
Koichi Wada, Motoko Obata, Maki Nakamura, Takeshi Yamazaki · 2002
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.>