Remote memory access: A case for portable, efficient and library independent parallel programming

Document Type

Article

Publication Date

1-1-2004

Abstract

In this work we make a strong case for remote memory access (RMA) as the effective way to program a parallel computer by proposing a framework that supports RMA in a library independent, simple and intuitive way. If one uses our approach the parallel code one writes will run transparently under MPI-2 enabled libraries but also bulk-synchronous parallel libraries. The advantage of using RMA is code simplicity, reduced programming complexity, and increased efficiency. We support the latter claims by implementing under this framework a collection of benchmark programs consisting of a communication and synchronization performance assessment program, a dense matrix multiplication algorithm, and two variants of a parallel radix-sort algorithm and examine their performance on a LINUX-based PC cluster under three different RMA enabled libraries: LAM MPI, BSPlib, and PUB. We conclude that implementations of such parallel algorithms using RMA communication primitives lead to code that is as efficient as the message-passing equivalent code and in the case of radix-sort substantially more efficient. In addition our work can be used as a comparative study of the relevant capabilities of the three libraries. © 2004 - IOS Press and the authors. All rights reserved.

Identifier

22044452114 (Scopus)

Publication Title

Scientific Programming

External Full Text Location

https://doi.org/10.1155/2004/934718

ISSN

10589244

First Page

169

Last Page

183

Issue

3

Volume

12

Grant

9977508

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS