A recursive algebraic coloring technique for hardware-efficient symmetric sparse matrix-vector multiplication

C Alappat, A Basermann, AR Bishop… - ACM Transactions on …, 2020 - dl.acm.org
The symmetric sparse matrix-vector multiplication (SymmSpMV) is an important building
block for many numerical linear algebra kernel operations or graph traversal applications …

Caspmv: A customized and accelerative spmv framework for the sunway taihulight

G **ao, K Li, Y Chen, W He… - IEEE Transactions on …, 2019 - ieeexplore.ieee.org
The Sunway TaihuLight, equipped with 10 million cores, is currently the world's third fastest
supercomputer. SpMV is one of core algorithms in many high-performance computing …

A GPU-based multilevel additive schwarz preconditioner for cloth and deformable body simulation

B Wu, Z Wang, H Wang - ACM Transactions on Graphics (TOG), 2022 - dl.acm.org
In this paper, we wish to push the limit of real-time cloth and deformable body simulation to a
higher level with 50K to 500K vertices, based on the development of a novel GPU-based …

Bringing order to sparsity: A sparse matrix reordering study on multicore cpus

JD Trotter, S Ekmekçibaşı, J Langguth, T Torun… - Proceedings of the …, 2023 - dl.acm.org
Many real-world computations involve sparse data structures in the form of sparse matrices.
A common strategy for optimizing sparse matrix operations is to reorder a matrix to improve …

Automating wavefront parallelization for sparse matrix computations

A Venkat, MS Mohammadi, J Park… - SC'16: Proceedings …, 2016 - ieeexplore.ieee.org
This paper presents a compiler and runtime framework for parallelizing sparse matrix
computations that have loop-carried dependences. Our approach automatically generates a …

SparseX: A library for high-performance sparse matrix-vector multiplication on multicore platforms

A Elafrou, V Karakasis, T Gkountouvas… - ACM Transactions on …, 2018 - dl.acm.org
The Sparse Matrix-Vector Multiplication (SpMV) kernel ranks among the most important and
thoroughly studied linear algebra operations, as it lies at the heart of many iterative methods …

A Conflict-aware Divide-and-Conquer Algorithm for Symmetric Sparse Matrix-Vector Multiplication

H Qiu, C Xu, J Fang, J Zhang, L Deng… - … Conference for High …, 2024 - ieeexplore.ieee.org
Exploiting matrix symmetry to halve memory footprint offers an opportunity for accelerating
memory-bound computations like Sparse Matrix-Vector Multiplication (SpMV). However …

Conflict-free symmetric sparse matrix-vector multiplication on multicore architectures

A Elafrou, G Goumas, N Koziris - … of the International Conference for High …, 2019 - dl.acm.org
Exploiting the numeric symmetry in sparse matrices to reduce their memory footprint is very
tempting for optimizing the memory-bound Sparse Matrix-Vector Multiplication (SpMV) …

FPGA-Based Sparse Matrix Multiplication Accelerators: From State-of-the-art to Future Opportunities

Y Liu, R Chen, S Li, J Yang, S Li… - ACM Transactions on …, 2024 - dl.acm.org
Sparse matrix multiplication (SpMM) plays a critical role in high-performance computing
applications, such as deep learning, image processing, and physical simulation. Field …

Evolving reordering algorithms using an ant colony hyperheuristic approach for accelerating the convergence of the ICCG method

SLG de Oliveira, LM Silva - Engineering with Computers, 2020 - Springer
This paper proposes a novel ant colony hyperheuristic approach for reordering the rows and
columns of symmetric positive definite matrices. This ant colony hyperheuristic approach …