Array operations fuzzer operates on smaller arrays#7743
Merged
robert3005 merged 2 commits intodevelopfrom May 1, 2026
Merged
Conversation
Signed-off-by: Robert Kruszewski <github@robertk.io>
Merging this PR will degrade performance by 39.88%
|
| Mode | Benchmark | BASE |
HEAD |
Efficiency | |
|---|---|---|---|---|---|
| ❌ | WallTime | mix[50%_in/50%_out] |
340 µs | 393.2 µs | -13.54% |
| ⚡ | WallTime | mix[100%_in/0%_out] |
500.7 µs | 449.5 µs | +11.39% |
| ❌ | WallTime | for[10M_u16] |
72.3 µs | 120.3 µs | -39.88% |
| ❌ | WallTime | for[10M_u32] |
114.6 µs | 164.5 µs | -30.34% |
| ⚡ | WallTime | dynamic_dispatch_u32[10M] |
142.3 µs | 94.2 µs | +51.09% |
| ❌ | WallTime | dynamic_dispatch_f32[10M] |
114.7 µs | 166.9 µs | -31.29% |
| ⚡ | Simulation | decompress_rd[f64, (10000, 0.01)] |
138.6 µs | 121.9 µs | +13.7% |
| ❌ | Simulation | decompress_rd[f32, (100000, 0.01)] |
495.1 µs | 582.7 µs | -15.04% |
| ⚡ | Simulation | decompress_rd[f64, (10000, 0.1)] |
138.7 µs | 122 µs | +13.63% |
| ❌ | Simulation | decompress_rd[f32, (100000, 0.1)] |
495.1 µs | 582.7 µs | -15.04% |
| ⚡ | Simulation | decompress_rd[f32, (10000, 0.0)] |
94.6 µs | 85.9 µs | +10.14% |
| ❌ | Simulation | decompress_rd[f64, (100000, 0.01)] |
842.6 µs | 1,020.5 µs | -17.44% |
| ⚡ | Simulation | decompress_rd[f32, (10000, 0.1)] |
90.2 µs | 82 µs | +10% |
| ❌ | Simulation | decompress_rd[f64, (100000, 0.1)] |
842.5 µs | 1,020.7 µs | -17.46% |
| ⚡ | Simulation | decompress_rd[f64, (10000, 0.0)] |
138.5 µs | 122.1 µs | +13.46% |
| ⚡ | Simulation | decompress_rd[f32, (100000, 0.0)] |
583.5 µs | 495.7 µs | +17.7% |
Comparing rk/arrayopsfuzzer (964b3f1) with develop (cb9b138)
joseph-isaacs
approved these changes
May 1, 2026
Contributor
joseph-isaacs
left a comment
There was a problem hiding this comment.
We can do this. But we do really want the 16k size going forwards
Contributor
Author
|
I kept the file fuzzer working on 16k arrays since that looked fine. I think we need to spend some time on reference impls in the fuzzer |
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.
I believe some of the reference implementations are very slow so we can't
operate on bigger arrays
Signed-off-by: Robert Kruszewski github@robertk.io