-
Notifications
You must be signed in to change notification settings - Fork 104
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #1638 from LLNL/v2024.02.2-RC
V2024.02.2 RC merge to main
- Loading branch information
Showing
74 changed files
with
5,284 additions
and
2,033 deletions.
There are no files selected for viewing
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
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
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
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
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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,21 @@ | ||
MIT License | ||
|
||
Copyright (c) 2017-2024 Advanced Micro Devices, Inc. All rights reserved. | ||
|
||
Permission is hereby granted, free of charge, to any person obtaining a copy | ||
of this software and associated documentation files (the "Software"), to deal | ||
in the Software without restriction, including without limitation the rights | ||
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell | ||
copies of the Software, and to permit persons to whom the Software is | ||
furnished to do so, subject to the following conditions: | ||
|
||
The above copyright notice and this permission notice shall be included in all | ||
copies or substantial portions of the Software. | ||
|
||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR | ||
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, | ||
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE | ||
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER | ||
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, | ||
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE | ||
SOFTWARE. |
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
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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,23 @@ | ||
.. ## | ||
.. ## Copyright (c) 2016-24, Lawrence Livermore National Security, LLC | ||
.. ## and RAJA project contributors. See the RAJA/LICENSE file | ||
.. ## for details. | ||
.. ## | ||
.. ## SPDX-License-Identifier: (BSD-3-Clause) | ||
.. ## | ||
.. _cook-book-label: | ||
|
||
************************ | ||
RAJA Cook Book | ||
************************ | ||
|
||
The following sections show common use case patterns and the recommended | ||
RAJA features and policies to use with them. They are intended | ||
to provide users with complete beyond usage examples beyond what can be found in other parts of the RAJA User Guide. In particular, the examples and discussion provide guidance on RAJA execution policy selection to improve performance of user application codes. | ||
|
||
.. toctree:: | ||
:maxdepth: 2 | ||
|
||
cook_book/reduction | ||
|
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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,110 @@ | ||
.. ## | ||
.. ## Copyright (c) 2016-24, Lawrence Livermore National Security, LLC | ||
.. ## and other RAJA project contributors. See the RAJA/LICENSE file | ||
.. ## for details. | ||
.. ## | ||
.. ## SPDX-License-Identifier: (BSD-3-Clause) | ||
.. ## | ||
.. _cook-book-reductions-label: | ||
|
||
======================= | ||
Cooking with Reductions | ||
======================= | ||
|
||
Please see the following section for overview discussion about RAJA reductions: | ||
|
||
* :ref:`feat-reductions-label`. | ||
|
||
|
||
---------------------------- | ||
Reductions with RAJA::forall | ||
---------------------------- | ||
|
||
Here is the setup for a simple reduction example:: | ||
|
||
const int N = 1000; | ||
|
||
int vec[N]; | ||
|
||
for (int i = 0; i < N; ++i) { | ||
|
||
vec[i] = 1; | ||
|
||
} | ||
|
||
Here a simple sum reduction is performed in a for loop:: | ||
|
||
int vsum = 0; | ||
|
||
// Run a kernel using the reduction objects | ||
for (int i = 0; i < N; ++i) { | ||
|
||
vsum += vec[i]; | ||
|
||
} | ||
|
||
The results of these operations will yield the following values: | ||
|
||
* ``vsum == 1000`` | ||
|
||
RAJA uses policy types to specify how things are implemented. | ||
|
||
The forall *execution policy* specifies how the loop is run by the ``RAJA::forall`` method. The following discussion includes examples of several other RAJA execution policies that could be applied. | ||
For example ``RAJA::seq_exec`` runs a C-style for loop sequentially on a CPU. The | ||
``RAJA::cuda_exec_with_reduce<256>`` runs the loop as a CUDA GPU kernel with | ||
256 threads per block and other CUDA kernel launch parameters, like the | ||
number of blocks, optimized for performance with reducers.:: | ||
|
||
using exec_policy = RAJA::seq_exec; | ||
// using exec_policy = RAJA::omp_parallel_for_exec; | ||
// using exec_policy = RAJA::omp_target_parallel_for_exec<256>; | ||
// using exec_policy = RAJA::cuda_exec_with_reduce<256>; | ||
// using exec_policy = RAJA::hip_exec_with_reduce<256>; | ||
// using exec_policy = RAJA::sycl_exec<256>; | ||
|
||
The reduction policy specifies how the reduction is done and must match the | ||
execution policy. For example ``RAJA::seq_reduce`` does a sequential reduction | ||
and can only be used with sequential execution policies. The | ||
``RAJA::cuda_reduce_atomic`` policy uses atomics, if possible with the given | ||
data type, and can only be used with cuda execution policies. Similarly for other RAJA execution back-ends, such as HIP and OpenMP. Here are example RAJA reduction policies whose names are indicative of which execution policies they work with:: | ||
|
||
using reduce_policy = RAJA::seq_reduce; | ||
// using reduce_policy = RAJA::omp_reduce; | ||
// using reduce_policy = RAJA::omp_target_reduce; | ||
// using reduce_policy = RAJA::cuda_reduce_atomic; | ||
// using reduce_policy = RAJA::hip_reduce_atomic; | ||
// using reduce_policy = RAJA::sycl_reduce; | ||
|
||
|
||
Here a simple sum reduction is performed using RAJA:: | ||
|
||
RAJA::ReduceSum<reduce_policy, int> vsum(0); | ||
|
||
RAJA::forall<exec_policy>( RAJA::RangeSegment(0, N), | ||
[=](RAJA::Index_type i) { | ||
|
||
vsum += vec[i]; | ||
|
||
}); | ||
|
||
The results of these operations will yield the following values: | ||
|
||
* ``vsum.get() == 1000`` | ||
|
||
|
||
Another option for the execution policy when using the cuda or hip backends are | ||
the base policies which have a boolean parameter to choose between the general | ||
use ``cuda/hip_exec`` policy and the ``cuda/hip_exec_with_reduce`` policy.:: | ||
|
||
// static constexpr bool with_reduce = ...; | ||
// using exec_policy = RAJA::cuda_exec_base<with_reduce, 256>; | ||
// using exec_policy = RAJA::hip_exec_base<with_reduce, 256>; | ||
|
||
Another option for the reduction policy when using the cuda or hip backends are | ||
the base policies which have a boolean parameter to choose between the atomic | ||
``cuda/hip_reduce_atomic`` policy and the non-atomic ``cuda/hip_reduce`` policy.:: | ||
|
||
// static constexpr bool with_atomic = ...; | ||
// using reduce_policy = RAJA::cuda_reduce_base<with_atomic>; | ||
// using reduce_policy = RAJA::hip_reduce_base<with_atomic>; |
Oops, something went wrong.