Repository navigation
Benchmarks: 95% confidence intervals and a long 50-run measurement - #13
Merged
Merged
Conversation
Each repeat runs both transports back to back, alternating which goes first, so the ratio of their durations is one speedup measured under the same conditions on a shared runner. benchmarks.compare now reports the median of these paired speedups and a distribution-free 95% confidence interval for it from order statistics: the k-th smallest and k-th largest of n runs, with the largest k whose binomial coverage stays at least 95%. Six runs give the first such interval. The table shows it in parentheses and the matrix in small type under each speedup. The workflow runs 20 repeats on releases, six on pull requests, which only check that the benchmark works, and takes the number as an input on manual runs. Job summaries are written in UTF-8, so Windows no longer garbles × and –. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Replace the matrix, table and raw reports with a manual run of the benchmark workflow: py-sharedmemory 4.3.1, Python 3.14.8, NumPy 2.5.4, 50 paired runs per size on each platform. Each cell now shows the median speedup and its 95% confidence interval. From 1 MB, a pair is 2.8-7.9x faster than multiprocessing.Queue on Linux, 2.1-3.5x on Windows x64, 1.12x at 1 MB and 3-3.5x from 10 MB on Windows ARM64, and 5.7-27x on macOS at every size; most Linux and Windows intervals are within a few percent of their medians. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Summary
Benchmarks now report how certain each speedup is, and the published matrix comes from one long, fresh run.
Statistics
benchmarks.comparereports the median of the paired speedups and a distribution-free 95% confidence interval for that median from order statistics: the k-th smallest and k-th largest of n runs, with the largest k whose binomial coverage, 1 − 2·P(B < k) for B ~ Binomial(n, ½), stays at least 95%. Deterministic, no assumption about the noise distribution; six runs give the first interval (n = 50 → 18th and 33rd values).Workflow
repeatsinput for manual runs; the job timeout rises to 90 minutes for long runs.×and–.Results
🤖 Generated with Claude Code