Hypergraph Partitioning Based Models and Methods for Exploiting Cache Locality in Sparse Matrix-Vector Multiplication

DOI10.1137/100813956zbMath1278.65047arXiv1202.3856OpenAlexW3103552514MaRDI QIDQ2847753

Cevdet Aykanat, Kadir Akbudak, Enver Kayaaslan

Publication date: 11 September 2013

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.3856

zbMATH Keywords

sparse matrix traveling salesman problem cache locality matrix-vector multiplication hypergraph partitioning matrix reordering computational hypergraph model

Mathematics Subject Classification ID

Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).

Related Items (1)

Hypergraph Cuts with General Splitting Functions

Uses Software

This page was built for publication: Hypergraph Partitioning Based Models and Methods for Exploiting Cache Locality in Sparse Matrix-Vector Multiplication