microsoft / microsoft/STL

<execution>: Parallelize more algorithms

Open
#7 6 comments 2 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

performance
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_copy
  • replace_copy_if

Scans:

  • copy_if
  • partition_copy
  • remove_copy
  • remove_copy_if
  • unique
  • unique_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_element
  • max_element
  • minmax_element

Divide and conquer:

  • inplace_merge
  • stable_partition

Divide range1 into chunks, binary search to find matching range2 chunks, scan:

  • merge
  • set_symmetric_difference
  • set_union

Other:

  • includes

Contributor guide

Open the contributing guide

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. 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

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.