Performance Comparison between Blocking and Non-Blocking Communications for a Three-Dimensional Poisson Problem
MetadataShow full item record
Type of Work7 pages
RightsThis 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.
Three-Dimensional Poisson Problem
High Performance Computing Facility (HPCF)
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.