Parallel sparse matrix-vector multiplication as a test case for hybrid MPI+OpenMP programming

Details Parallel sparse matrix-vector multiplication as a test case for hybrid MPI+OpenMP programming Parallel sparse matrix-vector multiplication as a test case for hybrid MPI+OpenMP programming

2010-12-30

arxiv.org/abs/1101.0091v1

Computer Science

Performance

12 pages, 6 figures

Scientific paper

10.1109/IPDPS.2011.332

We evaluate optimized parallel sparse matrix-vector operations for two representative application areas on widespread multicore-based cluster configurations. First the single-socket baseline performance is analyzed and modeled with respect to basic architectural properties of standard multicore chips. Going beyond the single node, parallel sparse matrix-vector operations often suffer from an unfavorable communication to computation ratio. Starting from the observation that nonblocking MPI is not able to hide communication cost using standard MPI implementations, we demonstrate that explicit overlap of communication and computation can be achieved by using a dedicated communication thread, which may run on a virtual core. We compare our approach to pure MPI and the widely used "vector-like" hybrid programming strategy.

Affiliated with

Also associated with

No associations

Rating

Parallel sparse matrix-vector multiplication as a test case for hybrid MPI+OpenMP programming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Parallel sparse matrix-vector multiplication as a test case for hybrid MPI+OpenMP programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parallel sparse matrix-vector multiplication as a test case for hybrid MPI+OpenMP programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-400899