JuliaCI / JuliaCI/BaseBenchmarks.jl
benchmark ideas
Open
Nobody has claimed this yet.
- Dominant language
- Julia
- Stars
- 44
- Forks
- 45
- PR merge metrics
- No merged PRs in 30d
Description
I could have sworn I'd previously opened an issue here with an idea for a benchmark but now I can't find it. There was a discussion of some algorithms that are hard/impossible to do in a vectorized way, and a couple that came up were:
- PDE solver (@ChrisRackauckas)
- counting the frequency of all substrings of a large string (@jakobnissen)
Please post and discuss more ideas here!
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
No files, tests, or entry points are named. Review the proposed PDE solver and substring-frequency benchmark ideas, then clarify which benchmark should be added and define its expected inputs, measurements, and acceptance criteria before locating the relevant benchmark code.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- julia
- Domain
- performance
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 20/100