Sparse boolean matrices for CFPQ #29
Description
Current GPU-based implementations utilize dense matrices, but real graphs are sparse.
We should try to utilize sparse boolen matrices for CFPQ.
- Try to find works/papers/projects on sparse boolean matrices multiplication.
- Try to adopt classical libraries for sparse matrices for boolean matrices processing
- NSparse: paper and implementation
- Try to check CUTLASS
- Regularizing Irregularity: Bitmap-based and Portable Sparse Matrix Multiplication for Graph Data on GPUs
- An Efficient Storage Format for Large Sparse Matrices based on Quadtree. Investigate Quadtree-based BMM representation and multiplication.
- Implement CFPQ by using sparse atrices
- Evaluate
- Publish (GRADES-NDA)