Parallel SpGEMM

From Cs240aproject

Revision as of 08:40, 9 May 2007 by Aydozz (Talk | contribs)

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.

Retrieved from "http://editthis.info/cs240aproject/Parallel_SpGEMM"
Personal tools