Highly Parallel Sparse Matrix-Matrix Multiplication

Computer Science – Distributed – Parallel – and Cluster Computing

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Generalized sparse matrix-matrix multiplication is a key primitive for many high performance graph algorithms as well as some linear solvers such as multigrid. We present the first parallel algorithms that achieve increasing speedups for an unbounded number of processors. Our algorithms are based on two-dimensional block distribution of sparse matrices where serial sections use a novel hypersparse kernel for scalability. We give a state-of-the-art MPI implementation of one of our algorithms. Our experiments show scaling up to thousands of processors on a variety of test scenarios.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Highly Parallel Sparse Matrix-Matrix Multiplication 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 Highly Parallel Sparse Matrix-Matrix Multiplication, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Highly Parallel Sparse Matrix-Matrix Multiplication will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-76783

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.