Add benchmarks drawn from Herbie #43
Merged
Conversation
This file contains 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
|
Awesome! Thank you! |
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.
This PR adds 20 benchmarks from Herbie. A full run of Herbie on its entire benchmark suite extracts from 6918 e-graphs; after consulting with @mwillsey we decided to contribute just the 20 largest (by file size, out of laziness) to the benchmark suite. The names of the JSON files is random, though in two cases the JSON files have successive numbers and come from the same benchmark.
Enodes have associated costs. Herbie's extraction algorithm is relatively simple: minimum total cost over extracted nodes. Herbie uses tree-size not DAG-size but DAG-size is probably a better true measure. For Herbie-folk: this is the post-type-splitting e-graph.