Inspecting the Benchmark Cache¶
WarpConvNet benchmarks sparse convolution algorithms at runtime and caches the results for fast reuse across sessions. Two scripts are available:
scripts/inspect_benchmark_cache.py-- Pretty-prints cached results per configurationscripts/analyze_autotune_cache.py-- Statistical analysis of algorithm win rates, margins, and coverage
What the cache contains¶
- Namespaces: Logical groups of cached results:
AB_gather_scatter-- AB (gather-scatter) algorithm selection for forward and dgradAtB_gather_gather-- AtB (gather-gather) algorithm selection for wgradimplicit_gemm_AD_gather_scatter/cute_gemm_AD_gather_scatter-- MMA tile + split-K tuning for per-offset kernelsimplicit_gemm_trAB_gather/cute_gemm_trAB_gather-- MMA tile + split-K tuning for TrAB kernels- Per-configuration results: For each input configuration (log10(N), channels, kernel volume, dtype, SM), the cache stores all benchmarked algorithms sorted by time.
- Ordering: Results are stored best-first within each configuration.
Quick start¶
Run without arguments to see the namespace tree:
python scripts/inspect_benchmark_cache.py
Show details for a specific namespace:
python scripts/inspect_benchmark_cache.py namespace=AB_gather_scatter
Only show the best algorithm per configuration:
python scripts/inspect_benchmark_cache.py namespace=AB_gather_scatter --best-only
Show the top K results per configuration:
python scripts/inspect_benchmark_cache.py namespace=AB_gather_scatter --top-k 3
Search namespaces or keys when passing extra arguments:
# Search inside a specific namespace
python scripts/inspect_benchmark_cache.py namespace=AB_gather_scatter mask
Sample output¶
Below is an excerpt from inspecting the AB_gather_scatter namespace. Times are in milliseconds; lower is better.
Loading benchmark cache...
Cache file location: /home/<user>/.cache/warpconvnet/benchmark_cache_generic.msgpack
============================================================
NAMESPACE TREE
============================================================
- AB_gather_scatter: 148 entry(ies)
- AtB_gather_gather: 146 entry(ies)
- implicit_gemm_AD_gather_scatter: 37 entry(ies)
============================================================
NAMESPACE: AB_GATHER_SCATTER
============================================================
Total configurations: 148
----------------------------------------
Configuration 1:
----------------------------------------
Config Parameters:
log_num_in_coords: 21
log_num_out_coords: 21
in_channels: 3
out_channels: 32
kernel_volume: 27
in_dtype: torch.float16
Results:
[
[
"implicit_gemm"
{
fwd_block_size: 16
}
4.149
]
[
"implicit_gemm"
{
fwd_block_size: 32
}
7.833
]
["wmma_implicit_gemm", {}, 10.814]
["explicit_gemm", {}, 13.789]
[
"implicit_gemm"
{
fwd_block_size: 4
}
15.120
]
]
----------------------------------------
Configuration 2:
----------------------------------------
Config Parameters:
log_num_in_coords: 21
log_num_out_coords: 21
in_channels: 32
out_channels: 32
kernel_volume: 27
in_dtype: torch.float16
Results:
[
["cutlass_implicit_gemm", {}, 4.613]
[
"implicit_gemm"
{
fwd_block_size: 16
}
8.107
]
["wmma_implicit_gemm", {}, 14.126]
["explicit_gemm", {}, 19.792]
]
Interpreting results¶
- Configuration: A unique combination of problem shape and dtype:
log_num_in_coords,log_num_out_coords(ceil(log2(N)) for quantization),in_channels,out_channels,kernel_volume, andin_dtype. - Algorithms: Each entry is
[algo_name, params, time_ms]. implicit_gemm: includesfwd_block_size(forward) orgemm_block_size,split_k_factor(backward)cutlass_implicit_gemm: typically{}(auto-tunes MMA tile internally)cute_grouped: includesmma_tile(CuTe 3.x tile shape index)cutlass_grouped_hybrid,implicit_gemm_grouped: includesaturation_m(grouping threshold)explicit_gemm:{}(no tunable parameters)- Best-first: The first result per configuration is the fastest among those benchmarked.
Statistical analysis¶
For aggregate analysis across all cached configs (win rates, margins, per-channel breakdowns), use:
python scripts/analyze_autotune_cache.py --markdown --output analysis.md
This generates:
- Algorithm win rates and top-3 rates
- Wins broken down by channel pair, kernel volume, and problem size
- Margin analysis (how close is the runner-up to the winner)
- Recommendations for reduced candidate sets
Relationship to environment variables¶
The cache reflects runs filtered by your environment variable settings in warpconvnet/constants.py:
WARPCONVNET_FWD_ALGO_MODE:auto(adaptive reduced set),all(exhaustive), single algorithm, or bracket listWARPCONVNET_BWD_ALGO_MODE: same options
When set to auto (default), the system uses an adaptive candidate set that varies by channel size. See Sparse Convolutions for details on auto vs all mode.
Benchmark cache management¶
The benchmark cache is automatically managed:
- Persistent Storage: Results are saved to
~/.cache/warpconvnet/ - Configuration-Specific: Different cache entries exist for different input sizes, channels, kernel volumes, and dtypes
- Background Saving: Cache updates can happen in background threads
- Manual Reset: Clear cache with
rm -rf ~/.cache/warpconvnet/if needed
Tips and troubleshooting¶
- Clear cache when switching GPUs or after significant software changes:
rm -rf ~/.cache/warpconvnet/ - Algorithm availability depends on your GPU and toolchain:
- CUTLASS requires compatible compute capability.
- WMMA requires Tensor Cores and compatible compute capability.
- First run is slower: Benchmarking is performed once per unique configuration; subsequent runs reuse the cached best.
- Focus the search: Use env var lists to limit benchmarking to known-good algorithms during development.
Script location¶
The inspector script lives at:
scripts/inspect_benchmark_cache.py
You can open it for more flags and formatting logic, or invoke it directly as shown above.