Reproduce “How the Dirty Set Moves: Characterizing Schedule Reuse in Incremental Sparse Matrix Multiplication” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Hunter Horne, Eric Spencer, Alex Henningfield, Arslan Bisharat
The authors study exact incremental updates for a fixed sparse matrix when input rows change. Direct column-wise execution uses only columns for changed rows, called the dirty set; tiled P3 reuses prepared schedules but may also read unchanged columns. Across 837 moving-dirty-set workloads, direct CSC was faster in 779 and P3 in 55, in this CPU study.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.