Performance Comparison between Blocking and Non-Blocking Communications for a Three-Dimensional Poisson Problem

Thumbnail Image

Files

WangGobbertTR2009.pdf (140.11 KB)

Links to Files

https://userpages.umbc.edu/~gobbert/papers/WangGobbertTR2009.pdf

Permanent Link

http://hdl.handle.net/11603/11688

Collections

UMBC Mathematics and Statistics Department
UMBC Faculty Collection

Author/Creator

Author/Creator ORCID

Date

2009

Type of Work

technical report
Text

Department

Program

Citation of Original Publication

Rights

This item is likely protected under Title 17 of the U.S. Copyright Law. Unless on a Creative Commons license, for uses protected by Copyright Law, contact the copyright holder or the author.

Subjects

Performance
Blocking
Non-Blocking
Three-Dimensional Poisson Problem
UMBC High Performance Computing Facility (HPCF)

Abstract

The system of linear equations obtained by finite difference discretization of the three-dimensional Poisson problem is solved by a matrix-free parallel implementation of the Jacobi method. After checking the convergence of our implementation, we compare the speed of using blocking MPI_Ssend/MPI_Recv and non-blocking MPI_Isend/MPI_Irecv communications. The comparisons indicate that the non-blocking communications are slightly faster than the blocking ones but show the same speedup and efficiency behavior. The OpenMPI implementation of MPI is used in conjunction with the Portland Group C compiler.