This a question from a High Performance Computing class:

Think about the tiling strategy for parallelizing and optimizing matrix multiplication. So far, weve been discussing this assuming that the matrices are dense. Would the tiling strategy for parallelization also work for sparse matrices? (Think about extremely large data.) Briefly elaborate/discuss your answer.