Parallelization of two breadth-first search-based applications using different message-passing paradigms: an experimental evaluation

Author

Bae, Seungjo ; Ranka, Sanjay

Author_Institution

Sch. of Comput. & Inf. Sci., Syracuse Univ., NY, USA

fYear

1995

fDate

6-9 Feb 1995

Firstpage

12

Lastpage

19

Abstract

We present experimental results for parallelizing two breadth-first search-based applications on the CM-5 by using two different message-passing paradigms, one based on send/receive and the other based on active messages. The parallelization of these applications requires fine-grained communication. Our results show that the active messages-based implementation gives significant improvement over the send/receive-based implementation. The improvements can primarily be attributed to the lower latency of the active messages implementation

Keywords

message passing; parallel algorithms; search problems; CM-5; active messages; breadth-first search-based applications; fine-grained communication; latency; message-passing paradigms; parallelization; send/receive-based implementation; Application software; Clustering algorithms; Concurrent computing; Cost function; Delay; Information science; Libraries; Protocols;

fLanguage

English

Publisher

ieee

Conference_Titel

Frontiers of Massively Parallel Computation, 1995. Proceedings. Frontiers '95., Fifth Symposium on the

Conference_Location

McLean, VA

Print_ISBN

0-8186-6965-9

Type

conf

DOI

10.1109/FMPC.1995.380469

Filename

380469