-
Notifications
You must be signed in to change notification settings - Fork 4
[TEST] Benchmark pure Queue implementations #235
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: main
Are you sure you want to change the base?
Conversation
✨ Documentation preview for 80d8012:
|
Benchmark ResultsBenchmark files: Benchmarking the fromIter functionsColumns describe the number of elements in the input iter. Instructions
Heap
Garbage Collection
No previous results found "/home/runner/work/new-motoko-base/new-motoko-base/.bench/Skewed.bench.json" Compare queue implementationsInstructions
Heap
Garbage Collection
No previous results found "/home/runner/work/new-motoko-base/new-motoko-base/.bench/ZLongPopsLarge.bench.json" Compare queue implementationsPushFront 10_000 elements at step 0, then perform 110 steps of 50 x popBack Instructions
Heap
Garbage Collection
No previous results found "/home/runner/work/new-motoko-base/new-motoko-base/.bench/ZLongUniform.bench.json" Compare queue implementationsStart with empty, then perform 100 random steps of pushFront/popBack (each repeated 5 times) with push twice as likely. Spikes in real-time operations are due to rebalancing Instructions
Heap
Garbage Collection
Note: Renamed benchmarks cannot be compared. Refer to the current baseline for manual comparison. |
Implementations and their names in benchmarks:
Summary
Statistics
with queue sizes both ~10_000 and ~250 |
To be abandoned once the Real-Time queue gets merged.
TODO: