This repository was archived by the owner on Apr 15, 2024. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
Data Parallelism
Christian Trott edited this page Jan 19, 2021
·
7 revisions
Parallel execution patterns for composing algorithms.
| Function | Description |
|---|---|
| parallel_for | Executes user code in parallel |
| parallel_reduce | Executes user code to perform a reduction in parallel |
| parallel_scan | Executes user code to generate a prefix sum in parallel |
| fence | Fences execution spaces |
Reducer objects used in conjunction with parallel_reduce.
| Reducer | Description |
|---|---|
| BAnd | Binary 'And' reduction |
| BOr | Binary 'Or' reduction |
| LAnd | Logical 'And' reduction |
| LOr | Logical 'Or' reduction |
| Max | Maximum reduction |
| MaxLoc | Reduction providing maximum and an associated index |
| Min | Minimum reduction |
| MinLoc | Reduction providing minimum and an associated index |
| MinMax | Reduction providing both minimum and maximum |
| MinMaxLoc | Reduction providing both minimum and maximum and associated indices |
| Prod | Multiplicative reduction |
| Sum | Sum reduction |
Tags passed to team_size_max or team_size_recommended to identify whether the pattern for which the team size for a functor is being requested
| Tag | pattern |
|---|---|
| ParallelForTag | parallel_for |
| ParallelReduceTag | parallel_reduce |
| ParallelScanTag | parallel_scan |
Home:
- Introduction
- Machine Model
- Programming Model
- Compiling
- Initialization
- View
- Parallel Dispatch
- Hierarchical Parallelism
- Custom Reductions
- Atomic Operations
- Subviews
- Interoperability
- Kokkos and Virtual Functions
- Initialization and Finalization
- View
- Data Parallelism
- Execution Policies
- Spaces
- Task Parallelism
- Utilities
- STL Compatibility
- Numerics
- Detection Idiom