Projects‎ > ‎

Parallel Algorithms for Sparse Matrices

Project description

  • Parallel I/O for very large sparse matrices
  • Memory optimal sparse matrix storage formats
  • Memory optimal implementations of algorithms for sparse matrix computations
  • Efficient visualization of very large sparse matrices on distributed architectures

State of the art

kam jste se v projektu dostali

Future research

co planujete nadale zkoumat

Soucre codes

Mascot source codes (currently available through Git repository)