Skip to content
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

Update benchmarks and fix strictness bug in condensed tables #94

Merged
merged 2 commits into from
May 11, 2024

Conversation

Shimuuar
Copy link
Collaborator

Main change is we now run samples in a loop.

Shimuuar added 2 commits May 11, 2024 18:27
- Single sample is fast and comparable with overhead of setting up benchmark
  using PAPI. It's better to run several benchmarks in a loop. Here we however
  faced with overhead from loop. It's not clear which is

- Float out condensed table creation from benchmark that measures sampling
  performance. This is critical since before we measured table setup time
  instead of sample time
When result is returned strictly GHC is able to unbox it.
@Shimuuar Shimuuar merged commit 33c89e1 into haskell:master May 11, 2024
32 checks passed
@Shimuuar Shimuuar deleted the new-bench branch May 11, 2024 16:16
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant