Sparse Matrix Computations on Bulk Synchronous Parallel Computers
Files
Publication date
1996-01-01
Authors
Bisseling, R.H.
Editors
Advisors
Supervisors
DOI
Document Type
Article
Metadata
Show full item recordCollections
License
Abstract
The Bulk Synchronous Parallel BSP programming model is studied in the context of sparse matrix computations. As a case study a BSP algorithm is developed for sparse Cholesky factorisation.