Performance analysis of the doubly-linked list protocol family for distributed shared memory systems

Author

Lau, Albert C K ; Yung, Nelson H C ; Cheung, Y.S.

Author_Institution

Dept. of Electr. & Electron. Eng., Hong Kong Univ., Hong Kong

fYear

1996

fDate

11-13 Jun 1996

Firstpage

365

Lastpage

372

Abstract

The doubly-linked list (DLL) protocol provides a memory efficient, scalable, high-performance and yet easy to implement method to maintain memory coherence in distributed shared memory (DSM) systems. In this paper, the performance analysis of the DLL family of protocols is presented. Theoretically, the DLL protocol with stable owners has the shortest remote memory access latency among the DLL protocol family. According to the simulated performance evaluation, the DLL-S protocol is 65.7% faster than the DDM algorithm for the linear equation solver; and is 16.5% faster for the matrix multiplier. From the trend of the performance figures, it is predicted that the improvement in performance due to the DLL-S protocol will be considerably greater when a larger number of processors are used, indicating that the DLL-S protocol is also the most scalable of the protocols tested

Keywords

distributed memory systems; performance evaluation; protocols; shared memory systems; distributed shared memory systems; doubly-linked list protocol family; linear equation solver; matrix multiplier; memory coherence; performance analysis; remote memory access latency; simulated performance evaluation; Access protocols; Clustering algorithms; Delay; Distributed decision making; Equations; Parallel processing; Parallel programming; Performance analysis; Programming profession; Testing;

fLanguage

English

Publisher

ieee

Conference_Titel

Algorithms & Architectures for Parallel Processing, 1996. ICAPP 96. 1996 IEEE Second International Conference on

Print_ISBN

0-7803-3529-5

Type

conf

DOI

10.1109/ICAPP.1996.562897

Filename

562897