Representing sparse binary matrices as straight-line programs for fast matrix-vector multiplication

@article{Neves2012RepresentingSB,
  title={Representing sparse binary matrices as straight-line programs for fast matrix-vector multiplication},
  author={Samuel Neves and F. Ara{\'u}jo},
  journal={2012 International Conference on High Performance Computing & Simulation (HPCS)},
  year={2012},
  pages={520-526}
}
  • Samuel Neves, F. Araújo
  • Published 2012
  • Computer Science
  • 2012 International Conference on High Performance Computing & Simulation (HPCS)
  • Sparse matrix-vector multiplication dominates the performance of many scientific and industrial problems. For example, iterative methods for solving linear systems rely on the performance of this critical operation. The particular case of binary matrices shows up in many important areas of computing, such as graph theory and cryptography. Unfortunately, irregular memory access patterns cause poor memory throughput, slowing down this operation. To maximize memory throughput, we transform the… CONTINUE READING
    1 Citations
    Consolidation of multi-tier workloads with performance and reliability constraints
    • 13
    • PDF

    References

    SHOWING 1-10 OF 30 REFERENCES
    Optimizing Sparse Matrix Computations for Register Reuse in SPARSITY
    • E. Im, K. Yelick
    • Computer Science
    • International Conference on Computational Science
    • 2001
    • 154
    • PDF
    Optimizing the Performance of Sparse Matrix-Vector Multiplication
    • E. Im
    • Computer Science
    • 2000
    • 151
    • Highly Influential
    • PDF
    Performance Optimizations and Bounds for Sparse Matrix-Vector Multiply
    • 140
    • PDF
    Sparsity: Optimization Framework for Sparse Matrix Kernels
    • 326
    • PDF
    Automatic performance tuning of sparse matrix kernels
    • 247
    • PDF
    A Block Lanczos Algorithm for Finding Dependencies Over GF(2)
    • 185
    • PDF
    Solving homogeneous linear equations over GF (2) via block Wiedemann algorithm
    • 220
    • PDF
    OSKI: A Library of Automatically Tuned Sparse Matrix Kernels
    • 516
    • PDF
    Using a grid platform for solving large sparse linear systems over GF(2)
    • 11
    • PDF