Formalizes benchmarking as identifying the fastest program via consistent estimators of performance contrasts that cancel stateful biases under tenable assumptions.
Robust benchmarking in noisy environments
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
abstract
We propose a benchmarking strategy that is robust in the presence of timer error, OS jitter and other environmental fluctuations, and is insensitive to the highly nonideal statistics produced by timing measurements. We construct a model that explains how these strongly nonideal statistics can arise from environmental fluctuations, and also justifies our proposed strategy. We implement this strategy in the BenchmarkTools Julia package, where it is used in production continuous integration (CI) pipelines for developing the Julia language and its ecosystem.
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Proposes a path-finding algorithm with A* as an alternative to Edmonds' blossom algorithm for computing minimal-weight-matching centrosymmetry parameter.
citing papers explorer
-
The Right Call for Software Benchmarking: Consistent Decisions in Stateful Environments
Formalizes benchmarking as identifying the fastest program via consistent estimators of performance contrasts that cancel stateful biases under tenable assumptions.
-
A path-finding algorithm for computing minimal-weight-matching centrosymmetry parameter
Proposes a path-finding algorithm with A* as an alternative to Edmonds' blossom algorithm for computing minimal-weight-matching centrosymmetry parameter.