Repository navigation
docs: refresh README benchmarks for the optimized stack - #69
Merged
Merged
Conversation
Re-measure every table in the benchmark section on the final stack and add scripts/readme_benchmarks.py, which regenerates the Python tables as reStructuredText (median of seven runs, each the best of seven timeit repeats). It replaces the .benchmarks/batch_measure.py the README cited, which is not in the repository. * Rust (Criterion) and Python tables re-measured; the malformed matrix tables are rebuilt with column widths that fit their headers. * New "Large catalogs" table for single-query scans on the thread pool. * Catalog index table re-measured against the now-parallel free function, noting the planner's linear choice at radius 12. * The check_hexstrings_within_dist row uses the same early-exit inputs as the test suite's benchmark, sliced once outside the timed call. * The x86 notes describe the SDE and Benchmark PR CI jobs; the AVX-512 table is labelled as measured before the current block scanners. * Batch-API interpretation updated for the faster per-call path and the serial prefix of early-exit batches. Co-authored-by: Copilot <223556219+Copilot@users.noreply.github.com> Copilot-Session: c7edd725-5714-4044-acf4-c9afc6ec8cf8
📊 Benchmark Comparison Results✅ All benchmarks within noise104 benchmarks compared, no significant changes detected. Legend: ✅ Faster (>5%) · |
The Benchmark PR run for #63 landed on an AVX-512 host (Xeon Platinum 8573C), comparing the AVX-512 block scanners with the AVX2 ones on the same machine: 2.5-4.8x faster for 16-, 32- and 64-byte records. Co-authored-by: Copilot <223556219+Copilot@users.noreply.github.com> Copilot-Session: c7edd725-5714-4044-acf4-c9afc6ec8cf8
23 tasks
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.
Top of the stack. This PR re-measures every table in the README benchmark section on the final stack, and adds
scripts/readme_benchmarks.pyto regenerate the Python ones.Changes
scripts/readme_benchmarks.pyprints the Python tables as reStructuredText, ready to paste. Each value is the median of--runspasses, and each pass is the best of seventimeitrepeats. It replaces.benchmarks/batch_measure.py, which the README cited but the repository doesn't contain.main, docutils rejected one of them as malformed.check_hexstrings_within_distrow uses the test suite's early-exit inputs, sliced once outside the timed call..github/copilot-instructions.mdexplains how to regenerate the tables.main→ this stack, same script and machine (Apple M4 Max, CPython 3.14.7, local builds without PGO;mainis the median of 3 runs, this stack of 7):mainhamming_distance_string, 3 charshamming_distance_string, 1024 charscheck_bytes_within_dist, 127 Bfirst_within_dist512×16, match at endfirst_within_dist16384×64, match at endbest_within_dist16384×64, match at midall_within_dist16384×64all, 1024×16, random no-matchinto, 10,000×32best_many100×1024×16all_into, 1024×16, all matchingfirst, 16 MiB, no matchbest, 64 MiB, no match (memory-bound)first_many100×1024×16, permissivefirst_within_dist512×16, match at record 0The last two rows are about even. Block scanners compare 16 records before an early match can end the scan, so a match on the very first record costs a whole block.
Documentation and a benchmark script only; no library changes.