PM/Ethernet-kRMA: a high performance remote memory access facility using multiple gigabit ethernet cards

2003 ◽  
Author(s):  
S. Sumimoto ◽  
K. Kumon
Keyword(s):  
High Performance ◽  
Memory Access ◽  
Remote Memory ◽  
Gigabit Ethernet ◽  
Remote Memory Access

High Performance Remote Memory Access Communication: The Armci Approach

2006 ◽  
Vol 20 (2) ◽  
pp. 233-253 ◽  
Author(s):  
J. Nieplocha ◽  
V. Tipparaju ◽  
M. Krishnan ◽  
D. K. Panda
Keyword(s):  
High Performance ◽  
Memory Access ◽  
Remote Memory ◽  
Remote Memory Access

scholarly journals Remote Memory Access: A Case for Portable, Efficient and Library Independent Parallel Programming

2004 ◽  
Vol 12 (3) ◽  
pp. 169-183 ◽  
Author(s):  
Alexandros V. Gerbessiotis ◽  
Seung-Yeop Lee
Keyword(s):  
Message Passing ◽  
Matrix Multiplication ◽  
Memory Access ◽  
Parallel Computer ◽  
Remote Memory ◽  
Dense Matrix ◽  
Radix Sort ◽  
Matrix Multiplication Algorithm ◽  
Bulk Synchronous Parallel ◽  
Remote Memory Access

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.

Sign in / Sign up

Export Citation Format

Share Document