<execution>: Parallelize more algorithms
Nobody has claimed this yet.
- Dominant language
- C++
- Stars
- 11.2k
- Forks
- 1.7k
- Avg merge
- 4d 15h
- Merged PRs (30d)
- 22
Description
Some strategies that can be used:
Just call parallel transform:
replace_copyreplace_copy_if
Scans:
copy_ifpartition_copyremove_copyremove_copy_ifuniqueunique_copy
Same as serial nth_element but call the parallel partition op for large N:
nth_element
Predicate tests (like all_of):
lexicographical_compare
Summary statistics (like find / find_end):
min_elementmax_elementminmax_element
Divide and conquer:
inplace_mergestable_partition
Divide range1 into chunks, binary search to find matching range2 chunks, scan:
mergeset_symmetric_differenceset_union
Other:
includes
Contributor guide
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
Start with the algorithm groups and parallelization strategies listed in the issue, then inspect how the project currently handles the corresponding serial algorithms. Done means the listed algorithms have been parallelized using the proposed approaches and their behavior is covered by the project's validation process.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- cpp
- Domain
- tooling
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 25/100