mirror of
https://github.com/ROCm/composable_kernel.git
synced 2026-05-16 02:54:21 +00:00
* Tiny fix in dynamic_buffer.hpp to support vectorized AtomicAdd for double type
* Update to host layer and host reduction
* Merge and remove reduction kernels
* Merge and remove reduction device interfaces and update pooling device interface
* Merge and remove useless reduction device instances
* Update to reduction profiler and reduction ctests
* Update to reduction and pooling examples and add one reduction example
* Change to reduction examples to let them testable by ctest
* Add explicit pass checking for reduction and pooling examples
* Explicit assignment of tensor shapes in example reduce_blockwise_two_call
* Use atomic_add to repace atomicAdd and add atomic_add for double type
* Add reduce ctest support for double data type
* Replace to_int_vector() by using c++ std::vector::assign()
* Keep DeviceReduceThreadWise separated from DeviceReduceBlockWise
* Merge DeviceReduceBlockWise and DeviceReduceMultiBlockAtomicAdd into DeviceReduceMultiBlock
* Add GetAtomicOperationZeroValue() support for AtomicMax
* Tiny change to reduce example README.md
* Fix some tiny issues due to branch merging
* Revoke previous change in dynamic_buffer.hpp and add atomic_add for double2_t
* Add reduce multiblock_atomic_add instances for fp64 to verify vectorized atomic_add on fp64
* Renaming
* Clean the header includings in device_reduce instances header files
[ROCm/composable_kernel commit: 63eee2d999]
202 lines
6.2 KiB
C++
202 lines
6.2 KiB
C++
/*******************************************************************************
|
|
*
|
|
* MIT License
|
|
*
|
|
* Copyright (c) 2020 Advanced Micro Devices, Inc.
|
|
*
|
|
* 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.
|
|
*
|
|
*******************************************************************************/
|
|
#ifndef CK_REDUCTION_OPERATOR_HPP
|
|
#define CK_REDUCTION_OPERATOR_HPP
|
|
|
|
#include "config.hpp"
|
|
#include "data_type.hpp"
|
|
|
|
namespace ck {
|
|
|
|
namespace reduce {
|
|
|
|
// Every binary operator used in reduction is represented by a templated functor class. Each functor
|
|
// class must provide at least
|
|
// three members:
|
|
// 1) GetReductionZeroVal() -- the interface to return the "identity element" for the binary
|
|
// operator, "identity element" is the unique
|
|
// element in the algebraic space that doesn't affect the value of other elements
|
|
// when operated against them, and the concept is similar to zero vector in
|
|
// vector space
|
|
// (http://pages.cs.wisc.edu/~matthewb/pages/notes/pdf/linearalgebra/VectorSpaces.pdf).
|
|
// 2) IsCompatibleInMemoryDataOperation() -- return true if the reduction task corresponding to this
|
|
// operator can use the InMemoryDataOperation to finalize, or else it return false 3) operator() --
|
|
// the first argument of the operator must be both an input & output, and the corresponding variable
|
|
// usually stores
|
|
// the accumulated result of many operator() calls; the second argument is only an
|
|
// input. For indexable binary
|
|
// operator, the second version of operator() has third argument (which is an
|
|
// output) to indicate whether the
|
|
// accumulated value (the first argument) has changed, in which case the recorded
|
|
// accumulated index also need be
|
|
// changed.
|
|
|
|
template <class T>
|
|
struct Add
|
|
{
|
|
using dataType = T;
|
|
|
|
__host__ __device__ static constexpr T GetReductionZeroVal() { return static_cast<T>(0.0f); };
|
|
|
|
__device__ static constexpr bool
|
|
IsCompatibleInMemoryDataOperation(InMemoryDataOperationEnum operation)
|
|
{
|
|
return operation == InMemoryDataOperationEnum::AtomicAdd ||
|
|
operation == InMemoryDataOperationEnum::Set;
|
|
};
|
|
|
|
__host__ __device__ inline constexpr void operator()(T& a, T b) const { a = a + b; }
|
|
};
|
|
|
|
template <class T>
|
|
struct Mul
|
|
{
|
|
using dataType = T;
|
|
|
|
__host__ __device__ static constexpr T GetReductionZeroVal() { return static_cast<T>(1.0f); };
|
|
|
|
__device__ static constexpr bool
|
|
IsCompatibleInMemoryDataOperation(InMemoryDataOperationEnum operation)
|
|
{
|
|
return operation == InMemoryDataOperationEnum::Set;
|
|
};
|
|
|
|
__host__ __device__ inline constexpr void operator()(T& a, T b) const { a = a * b; }
|
|
};
|
|
|
|
template <class T>
|
|
struct Max
|
|
{
|
|
using dataType = T;
|
|
|
|
__host__ __device__ static constexpr T GetReductionZeroVal()
|
|
{
|
|
return NumericLimits<T>::Lowest();
|
|
};
|
|
|
|
__device__ static constexpr bool
|
|
IsCompatibleInMemoryDataOperation(InMemoryDataOperationEnum operation)
|
|
{
|
|
// ToChange: atomic_max to be added
|
|
return operation == InMemoryDataOperationEnum::Set;
|
|
};
|
|
|
|
__host__ __device__ inline constexpr void operator()(T& a, T b) const
|
|
{
|
|
if(a < b)
|
|
a = b;
|
|
}
|
|
|
|
__host__ __device__ inline constexpr void operator()(T& a, T b, bool& changed) const
|
|
{
|
|
if(a < b)
|
|
{
|
|
a = b;
|
|
changed = true;
|
|
}
|
|
}
|
|
};
|
|
|
|
template <class T>
|
|
struct Min
|
|
{
|
|
using dataType = T;
|
|
|
|
__host__ __device__ static constexpr T GetReductionZeroVal()
|
|
{
|
|
return NumericLimits<T>::Max();
|
|
};
|
|
|
|
__device__ static constexpr bool
|
|
IsCompatibleInMemoryDataOperation(InMemoryDataOperationEnum operation)
|
|
{
|
|
// ToChange: atomic_min to be added
|
|
return operation == InMemoryDataOperationEnum::Set;
|
|
};
|
|
|
|
__host__ __device__ inline constexpr void operator()(T& a, T b) const
|
|
{
|
|
if(a > b)
|
|
a = b;
|
|
}
|
|
|
|
__host__ __device__ inline constexpr void operator()(T& a, T b, bool& changed) const
|
|
{
|
|
if(a > b)
|
|
{
|
|
a = b;
|
|
changed = true;
|
|
}
|
|
}
|
|
};
|
|
|
|
template <class T>
|
|
struct AMax
|
|
{
|
|
using dataType = T;
|
|
|
|
__host__ __device__ static constexpr T GetReductionZeroVal() { return static_cast<T>(0.0f); };
|
|
|
|
__device__ static constexpr bool
|
|
IsCompatibleInMemoryDataOperation(InMemoryDataOperationEnum operation)
|
|
{
|
|
// ToChange: atomic_max to be added
|
|
return operation == InMemoryDataOperationEnum::Set;
|
|
};
|
|
|
|
__host__ __device__ inline constexpr void operator()(T& a, T b) const
|
|
{
|
|
if(a < b)
|
|
a = b;
|
|
}
|
|
|
|
__host__ __device__ inline constexpr void operator()(T& a, T b, bool& changed) const
|
|
{
|
|
if(a < b)
|
|
{
|
|
a = b;
|
|
changed = true;
|
|
}
|
|
}
|
|
};
|
|
|
|
template <typename T>
|
|
T GetReductionZeroValueForInMemoryDataOperation(InMemoryDataOperationEnum operation)
|
|
{
|
|
T result = ck::type_convert<T>(0.0f);
|
|
|
|
if(operation == InMemoryDataOperationEnum::AtomicMax)
|
|
result = ck::NumericLimits<T>::Lowest();
|
|
|
|
return (result);
|
|
};
|
|
|
|
}; // end of namespace reduce
|
|
|
|
} // end of namespace ck
|
|
|
|
#endif
|