Cache partitioning for sparse matrix–vector multiplication on the A64FX

One of the novel features of the Fujitsu A64FX CPU is the sector cache . This feature enables hardware-supported partitioning of the L1 and L2 caches and allows the programmer control of which partition is used to place data in. This paper performs an in-depth study of applying the sector cache to sparse matrix-vector multiplication (SpMV) in the Compressed Sparse Row (CSR) format using a collection of 490 sparse matrices. A performance model based on reuse analysis is used to better understand situations in which and how the sector cache leads to improved cache reuse and to predict cache behavior. The model predicts the number of L2 cache misses within an error of 2% without cache partitioning. With sector cache enabled, depending on the configuration, the model predicts the number of L2 cache missed within 2–3% and 4–18% for sequential and parallel SpMV with 48 threads, respectively. Further experiments show the effect of various sector cache configurations on performance. A median speedup of about 1.05 × is achieved, whereas the maximum speedup is about 1.6 × . • A comprehensive performance study and in-depth analysis of CSR SpMV on the A64FX, including the effect of the sector cache feature. • A locality analysis based on reuse distance of sparse matrices using their sparsity pattern. • A cache miss model for parallel codes on multicore architectures with multiple shared caches including the effect of cache partitioning.

Authors

Institutions

Publication Details

Journal
Parallel Computing
Published
2025-12-05
DOI
https://doi.org/10.1016/j.parco.2025.103169
Primary Topic
Parallel Computing and Optimization Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Cache partitioning for sparse matrix–vector multiplication on the A64FX

James Trotter, Karl Fürlinger, Sergej Breiter
Parallel Computing
Parallel Computing and Optimization Techniques
article

Cache partitioning for sparse matrix–vector multiplication on the A64FX

James Trotter, Karl Fürlinger, Sergej Breiter
article en

Abstract

One of the novel features of the Fujitsu A64FX CPU is the sector cache . This feature enables hardware-supported partitioning of the L1 and L2 caches and allows the programmer control of which partition is used to place data in. This paper performs an in-depth study of applying the sector cache to sparse matrix-vector multiplication (SpMV) in the Compressed Sparse Row (CSR) format using a collection of 490 sparse matrices. A performance model based on reuse analysis is used to better understand situations in which and how the sector cache leads to improved cache reuse and to predict cache behavior. The model predicts the number of L2 cache misses within an error of 2% without cache partitioning. With sector cache enabled, depending on the configuration, the model predicts the number of L2 cache missed within 2–3% and 4–18% for sequential and parallel SpMV with 48 threads, respectively. Further experiments show the effect of various sector cache configurations on performance. A median speedup of about 1.05 × is achieved, whereas the maximum speedup is about 1.6 × . • A comprehensive performance study and in-depth analysis of CSR SpMV on the A64FX, including the effect of the sector cache feature. • A locality analysis based on reuse distance of sparse matrices using their sparsity pattern. • A cache miss model for parallel codes on multicore architectures with multiple shared caches including the effect of cache partitioning.

Parallel ComputingVol. 127
Simula Research Laboratory (NO), Ludwig-Maximilians-Universität München (DE)
Openalex Percentile: Top 57%
Parallel Computing and Optimization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.