- Measure how temporal reuse distance changes read performance on the same logical data.
- How quickly does the benefit of a second read decay as more work is inserted between touches?
reuse_distance_1reuse_distance_32reuse_distance_256reuse_distance_4096reuse_distance_full_span
- Build deterministic index schedules where each source element is read twice with a controlled gap.
- Keep total reads, writes, and arithmetic fixed while varying only the reuse distance.
- Median GPU time by reuse distance.
- Speedup relative to the far-distance baseline.
- Stability of the locality benefit across the reuse sweep.
- This experiment estimates a practical locality window rather than a literal cache size.
- It helps explain when reordering work or staging data is likely to matter.