Parallel symmetric sparse matrix-vector product on scalar multi-core CPUs

DOI10.1016/j.parco.2010.02.003zbMath1204.68045OpenAlexW2092013581MaRDI QIDQ991098

M. Krotkiewski, Marcin Dabrowski

Publication date: 2 September 2010

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.parco.2010.02.003

zbMATH Keywords

unstructured meshesmulti-core architecturesmemory bounded algorithmssymmetric sparse matrix vector multiplication

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Computer system organization (68M99)

Related Items (3)

Fast native-MATLAB stiffness assembly for SIPG linear elasticity ⋮ Topology optimization design of 3D electrothermomechanical actuators by using GPU as a co-processor ⋮ Rapid non-linear finite element analysis of continuous and discontinuous Galerkin methods in MATLAB

Uses Software

• PETSc
• ParMETIS
• OSKI
• PT-Scotch
• Sparsity
• MILAMIN

Cites Work

• Unnamed Item
• Unnamed Item
• When cache blocking of sparse matrix vector multiply works and why
• Effects of Ordering Strategies and Programming Paradigms on Sparse Matrix Computations
• Krylov Subspace Methods on Supercomputers
• A numerical evaluation of sparse direct solvers for the solution of large sparse symmetric linear systems of equations
• Using Mixed Precision for Sparse Matrix Computations to Enhance the Performance while Achieving 64-bit Accuracy
• Multiscale Methods and Streamline Simulation for Rapid Reservoir Performance Prediction
• A Comparison of Several Bandwidth and Profile Reduction Algorithms
• A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication
• Towards a fast parallel sparse symmetric matrix-vector multiplication

This page was built for publication: Parallel symmetric sparse matrix-vector product on scalar multi-core CPUs