Sparse Cholesky Factorization

Trace Distribution

  • Compressed, ASCII format (115KB)

    Related Information

  • A. Acharya, M. Uysal, A. Sussman, J. Saltz, J. Hollingsworth, M. Beynon, A. Mendelson, and R. Bennett. Tuning the Performance of I/O-Intensive Parallel Applications. Proceedings of the Fourth Annual Workshop on I/O in Parallel and Distributed Systems, Philadelphia, Pennsylvania, May 27, 1996.
  • Applications for Measurement and Benchmarking of I/O on Parallel Computers

    This application computes Cholesky decomposition for sparse, symmetric positive-definite matrices. It stores the sparse matrix as panels. This application performs I/O using synchronous read/write operations.

    Input Dataset

    To drive this application, we used the skirt matrix from NASA that contains over 45 million double-precision nonzeros and 45,361 columns for a total of 437 MB. The dataset was stored in 8 files, one per processor.