Parallel SpGEMM
From Cs240aproject
(Difference between revisions)
| Line 6: | Line 6: | ||
== Project Description == | == Project Description == | ||
| - | The project is to write a parallel implementation of the sparse matrix times sparse matrix routine. | + | The project is to write a 2D parallel implementation of the sparse matrix times sparse matrix routine. It is projected to be implemented in C++ using MPI. The project will have multiple iterations: |
| + | |||
| + | 1) The simplest decomposition is the regular [block checkerboard partitioning]. The project assumes the existence of a fast sequential algorithm for sparse matrix multiplication that is used as a block box. | ||
Revision as of 08:40, 9 May 2007
This is the Spring 2007 project of Aydin Buluc and Fenglin Liao.
Project Description
The project is to write a 2D parallel implementation of the sparse matrix times sparse matrix routine. It is projected to be implemented in C++ using MPI. The project will have multiple iterations:
1) The simplest decomposition is the regular [block checkerboard partitioning]. The project assumes the existence of a fast sequential algorithm for sparse matrix multiplication that is used as a block box.
