A performance comparison of DSM, PVM, and MPI

Author

Werstein, Paul ; Pethick, Mark ; Huang, Zhiyi

Author_Institution

Otago Univ., Dunedin, New Zealand

fYear

2003

fDate

27-29 Aug. 2003

Firstpage

476

Lastpage

482

Abstract

We compare the performance of the Treadmarks DSM system with two popular message passing systems (PVM and MPI). The comparison is done on 1, 2, 4, 8, 16, 24, and 32 nodes. Applications are chosen to represent three classes of problems: loosely synchronous, embarrassingly parallel, and synchronous. The results show DSM has similar performance to message passing for the embarrassingly parallel class. However the performance of DSM is lower than PVM and MPI for the synchronous and loosely synchronous classes of problems. An analysis of the reasons is presented.

Keywords

application program interfaces; distributed shared memory systems; message passing; parallel programming; software performance evaluation; virtual machines; MPI; Message Passing Interface; PVM; Parallel Virtual Machine; Treadmarks DSM system; distributed computing; distributed shared memory; message passing systems; synchronous class problem; Computer networks; Concurrent computing; Distributed computing; Libraries; Message passing; Microcomputers; Multiprocessing systems; Parallel processing; Programming profession; Testing;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Computing, Applications and Technologies, 2003. PDCAT'2003. Proceedings of the Fourth International Conference on

Print_ISBN

0-7803-7840-7

Type

conf

DOI

10.1109/PDCAT.2003.1236348

Filename

1236348