ASaP: Automatic Software Prefetching for Sparse Tensor Computations in MLIR

Sparse tensor computations suffer from irregular memory access patterns that degrade cache performance. While software prefetching can mitigate this, existing compiler approaches lack the semantic insight needed for effective optimization.

Authors

Institutions

Publication Details

Published
2025-11-07
DOI
https://doi.org/10.1145/3731599.3767477
Citations
1
Primary Topic
Parallel Computing and Optimization Techniques
Type
article
Field-Weighted Citation Impact
2.27
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

ASaP: Automatic Software Prefetching for Sparse Tensor Computations in MLIR

Jonas Skeppstedt, Per Stenström, Konstantinos Sotiropoulos
1 citations
Parallel Computing and Optimization Techniques
2.27
article

ASaP: Automatic Software Prefetching for Sparse Tensor Computations in MLIR

Jonas Skeppstedt, Per Stenström, Konstantinos Sotiropoulos
article en
1 citations

Abstract

Sparse tensor computations suffer from irregular memory access patterns that degrade cache performance. While software prefetching can mitigate this, existing compiler approaches lack the semantic insight needed for effective optimization.

Lund University (SE), Chalmers University of Technology (SE), University of Gothenburg (SE)
Openalex Percentile: Top 10%
Parallel Computing and Optimization Techniques
2.27
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.