bd337854ec
Addresses #291.
1085 lines
38 KiB
C++
1085 lines
38 KiB
C++
//=============================================================================
|
||
//
|
||
// Copyright (c) Kitware, Inc.
|
||
// All rights reserved.
|
||
// See LICENSE.txt for details.
|
||
//
|
||
// This software is distributed WITHOUT ANY WARRANTY; without even
|
||
// the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
|
||
// PURPOSE. See the above copyright notice for more information.
|
||
//
|
||
// Copyright 2018 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
|
||
// Copyright 2018 UT-Battelle, LLC.
|
||
// Copyright 2018 Los Alamos National Security.
|
||
//
|
||
// Under the terms of Contract DE-NA0003525 with NTESS,
|
||
// the U.S. Government retains certain rights in this software.
|
||
// Under the terms of Contract DE-AC52-06NA25396 with Los Alamos National
|
||
// Laboratory (LANL), the U.S. Government retains certain rights in
|
||
// this software.
|
||
//
|
||
//=============================================================================
|
||
|
||
// Copyright 2010, Takuya Akiba
|
||
// All rights reserved.
|
||
//
|
||
// Redistribution and use in source and binary forms, with or without
|
||
// modification, are permitted provided that the following conditions are
|
||
// met:
|
||
//
|
||
// * Redistributions of source code must retain the above copyright
|
||
// notice, this list of conditions and the following disclaimer.
|
||
// * Redistributions in binary form must reproduce the above
|
||
// copyright notice, this list of conditions and the following disclaimer
|
||
// in the documentation and/or other materials provided with the
|
||
// distribution.
|
||
// * Neither the name of Takuya Akiba nor the names of its
|
||
// contributors may be used to endorse or promote products derived from
|
||
// this software without specific prior written permission.
|
||
//
|
||
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
||
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||
|
||
// Modifications of Takuya Akiba's original GitHub source code for inclusion
|
||
// in VTK-m:
|
||
//
|
||
// - Made parallelization library details generic (see "Threading Interface" below).
|
||
// - Added minimum threshold for parallel, will instead invoke serial radix sort (kxsort)
|
||
// - Added std::greater<T> and std::less<T> to interface for descending order sorts
|
||
// - Added linear scaling of threads used by the algorithm for more stable performance
|
||
// on machines with lots of available threads (KNL and Haswell)
|
||
//
|
||
// This file contains an implementation of Satish parallel radix sort
|
||
// as documented in the following citation:
|
||
//
|
||
// Fast sort on CPUs and GPUs: a case for bandwidth oblivious SIMD sort.
|
||
// N. Satish, C. Kim, J. Chhugani, A. D. Nguyen, V. W. Lee, D. Kim, and P. Dubey.
|
||
// In Proc. SIGMOD, pages 351–362, 2010
|
||
//
|
||
// Threading Interface:
|
||
//
|
||
// To use this implementation, an object containing the following members should
|
||
// be passed as the 'threader' argument at the entry points:
|
||
//
|
||
// struct ThreaderExample
|
||
// {
|
||
// // Return the number of cores available:
|
||
// size_t GetAvailableCores();
|
||
//
|
||
// // Run the supplied functor in a new thread. This task is likely to
|
||
// // generate children (through RunChildTasks), and must block until all
|
||
// // children complete.
|
||
// template <typename TaskType>
|
||
// void RunParentTask(TaskType task);
|
||
//
|
||
// // Run an child task in a new thread. The function may be blocking or
|
||
// // non-blocking, and 'data' is an abitrary object passed to the parent
|
||
// // task's operator() (See the TBB implementation for details).
|
||
// template <typename TaskType, typename ParentTaskThreadData>
|
||
// void RunChildTasks(ParentTaskThreadData data, TaskType left, TaskType right);
|
||
// };
|
||
//
|
||
// See the sample implementations and the RunTask struct below for examples.
|
||
|
||
#ifndef vtk_m_cont_internal_ParallelRadixSort_h
|
||
#define vtk_m_cont_internal_ParallelRadixSort_h
|
||
|
||
#include <vtkm/cont/internal/ParallelRadixSortInterface.h>
|
||
|
||
#include <algorithm>
|
||
#include <cassert>
|
||
#include <climits>
|
||
#include <cmath>
|
||
#include <cstring>
|
||
#include <functional>
|
||
#include <stdint.h>
|
||
#include <utility>
|
||
|
||
#include <vtkm/Types.h>
|
||
#include <vtkm/cont/Logging.h>
|
||
|
||
VTKM_THIRDPARTY_PRE_INCLUDE
|
||
|
||
#include <vtkm/cont/internal/KXSort.h>
|
||
|
||
namespace vtkm
|
||
{
|
||
namespace cont
|
||
{
|
||
namespace internal
|
||
{
|
||
namespace radix
|
||
{
|
||
|
||
namespace utility
|
||
{
|
||
// Return the number of threads that would be executed in parallel regions
|
||
inline size_t GetMaxThreads(size_t num_bytes, size_t available_cores)
|
||
{
|
||
const double CORES_PER_BYTE =
|
||
double(available_cores - 1) / double(BYTES_FOR_MAX_PARALLELISM - MIN_BYTES_FOR_PARALLEL);
|
||
const double Y_INTERCEPT = 1.0 - CORES_PER_BYTE * MIN_BYTES_FOR_PARALLEL;
|
||
|
||
const size_t num_cores = (size_t)(CORES_PER_BYTE * double(num_bytes) + Y_INTERCEPT);
|
||
if (num_cores < 1)
|
||
{
|
||
return 1;
|
||
}
|
||
if (num_cores > available_cores)
|
||
{
|
||
return available_cores;
|
||
}
|
||
return num_cores;
|
||
}
|
||
} // namespace utility
|
||
|
||
namespace internal
|
||
{
|
||
// Size of the software managed buffer
|
||
const size_t kOutBufferSize = 32;
|
||
|
||
// Ascending order radix sort is a no-op
|
||
template <typename PlainType,
|
||
typename UnsignedType,
|
||
typename CompareType,
|
||
typename ValueManager,
|
||
unsigned int Base>
|
||
struct ParallelRadixCompareInternal
|
||
{
|
||
inline static void reverse(UnsignedType& t) { (void)t; }
|
||
};
|
||
|
||
// Handle descending order radix sort
|
||
template <typename PlainType, typename UnsignedType, typename ValueManager, unsigned int Base>
|
||
struct ParallelRadixCompareInternal<PlainType,
|
||
UnsignedType,
|
||
std::greater<PlainType>,
|
||
ValueManager,
|
||
Base>
|
||
{
|
||
inline static void reverse(UnsignedType& t) { t = ((1 << Base) - 1) - t; }
|
||
};
|
||
|
||
// The algorithm is implemented in this internal class
|
||
template <typename PlainType,
|
||
typename CompareType,
|
||
typename UnsignedType,
|
||
typename Encoder,
|
||
typename ValueManager,
|
||
typename ThreaderType,
|
||
unsigned int Base>
|
||
class ParallelRadixSortInternal
|
||
{
|
||
public:
|
||
using CompareInternal =
|
||
ParallelRadixCompareInternal<PlainType, UnsignedType, CompareType, ValueManager, Base>;
|
||
|
||
ParallelRadixSortInternal();
|
||
~ParallelRadixSortInternal();
|
||
|
||
void Init(PlainType* data, size_t num_elems, const ThreaderType& threader);
|
||
|
||
PlainType* Sort(PlainType* data, ValueManager* value_manager);
|
||
|
||
static void InitAndSort(PlainType* data,
|
||
size_t num_elems,
|
||
const ThreaderType& threader,
|
||
ValueManager* value_manager);
|
||
|
||
private:
|
||
CompareInternal compare_internal_;
|
||
size_t num_elems_;
|
||
size_t num_threads_;
|
||
|
||
UnsignedType* tmp_;
|
||
size_t** histo_;
|
||
UnsignedType*** out_buf_;
|
||
size_t** out_buf_n_;
|
||
|
||
size_t *pos_bgn_, *pos_end_;
|
||
ValueManager* value_manager_;
|
||
ThreaderType threader_;
|
||
|
||
void DeleteAll();
|
||
|
||
UnsignedType* SortInternal(UnsignedType* data, ValueManager* value_manager);
|
||
|
||
// Compute |pos_bgn_| and |pos_end_| (associated ranges for each threads)
|
||
void ComputeRanges();
|
||
|
||
// First step of each iteration of sorting
|
||
// Compute the histogram of |src| using bits in [b, b + Base)
|
||
void ComputeHistogram(unsigned int b, UnsignedType* src);
|
||
|
||
// Second step of each iteration of sorting
|
||
// Scatter elements of |src| to |dst| using the histogram
|
||
void Scatter(unsigned int b, UnsignedType* src, UnsignedType* dst);
|
||
};
|
||
|
||
template <typename PlainType,
|
||
typename CompareType,
|
||
typename UnsignedType,
|
||
typename Encoder,
|
||
typename ValueManager,
|
||
typename ThreaderType,
|
||
unsigned int Base>
|
||
ParallelRadixSortInternal<PlainType,
|
||
CompareType,
|
||
UnsignedType,
|
||
Encoder,
|
||
ValueManager,
|
||
ThreaderType,
|
||
Base>::ParallelRadixSortInternal()
|
||
: num_elems_(0)
|
||
, num_threads_(0)
|
||
, tmp_(NULL)
|
||
, histo_(NULL)
|
||
, out_buf_(NULL)
|
||
, out_buf_n_(NULL)
|
||
, pos_bgn_(NULL)
|
||
, pos_end_(NULL)
|
||
{
|
||
assert(sizeof(PlainType) == sizeof(UnsignedType));
|
||
}
|
||
|
||
template <typename PlainType,
|
||
typename CompareType,
|
||
typename UnsignedType,
|
||
typename Encoder,
|
||
typename ValueManager,
|
||
typename ThreaderType,
|
||
unsigned int Base>
|
||
ParallelRadixSortInternal<PlainType,
|
||
CompareType,
|
||
UnsignedType,
|
||
Encoder,
|
||
ValueManager,
|
||
ThreaderType,
|
||
Base>::~ParallelRadixSortInternal()
|
||
{
|
||
DeleteAll();
|
||
}
|
||
|
||
template <typename PlainType,
|
||
typename CompareType,
|
||
typename UnsignedType,
|
||
typename Encoder,
|
||
typename ValueManager,
|
||
typename ThreaderType,
|
||
unsigned int Base>
|
||
void ParallelRadixSortInternal<PlainType,
|
||
CompareType,
|
||
UnsignedType,
|
||
Encoder,
|
||
ValueManager,
|
||
ThreaderType,
|
||
Base>::DeleteAll()
|
||
{
|
||
delete[] tmp_;
|
||
tmp_ = NULL;
|
||
|
||
for (size_t i = 0; i < num_threads_; ++i)
|
||
delete[] histo_[i];
|
||
delete[] histo_;
|
||
histo_ = NULL;
|
||
|
||
for (size_t i = 0; i < num_threads_; ++i)
|
||
{
|
||
for (size_t j = 0; j < 1 << Base; ++j)
|
||
{
|
||
delete[] out_buf_[i][j];
|
||
}
|
||
delete[] out_buf_n_[i];
|
||
delete[] out_buf_[i];
|
||
}
|
||
delete[] out_buf_;
|
||
delete[] out_buf_n_;
|
||
out_buf_ = NULL;
|
||
out_buf_n_ = NULL;
|
||
|
||
delete[] pos_bgn_;
|
||
delete[] pos_end_;
|
||
pos_bgn_ = pos_end_ = NULL;
|
||
|
||
num_elems_ = 0;
|
||
num_threads_ = 0;
|
||
}
|
||
|
||
template <typename PlainType,
|
||
typename CompareType,
|
||
typename UnsignedType,
|
||
typename Encoder,
|
||
typename ValueManager,
|
||
typename ThreaderType,
|
||
unsigned int Base>
|
||
void ParallelRadixSortInternal<PlainType,
|
||
CompareType,
|
||
UnsignedType,
|
||
Encoder,
|
||
ValueManager,
|
||
ThreaderType,
|
||
Base>::Init(PlainType* data,
|
||
size_t num_elems,
|
||
const ThreaderType& threader)
|
||
{
|
||
(void)data;
|
||
DeleteAll();
|
||
|
||
threader_ = threader;
|
||
|
||
num_elems_ = num_elems;
|
||
|
||
num_threads_ =
|
||
utility::GetMaxThreads(num_elems_ * sizeof(PlainType), threader_.GetAvailableCores());
|
||
|
||
tmp_ = new UnsignedType[num_elems_];
|
||
histo_ = new size_t*[num_threads_];
|
||
for (size_t i = 0; i < num_threads_; ++i)
|
||
{
|
||
histo_[i] = new size_t[1 << Base];
|
||
}
|
||
|
||
out_buf_ = new UnsignedType**[num_threads_];
|
||
out_buf_n_ = new size_t*[num_threads_];
|
||
for (size_t i = 0; i < num_threads_; ++i)
|
||
{
|
||
out_buf_[i] = new UnsignedType*[1 << Base];
|
||
out_buf_n_[i] = new size_t[1 << Base];
|
||
for (size_t j = 0; j < 1 << Base; ++j)
|
||
{
|
||
out_buf_[i][j] = new UnsignedType[kOutBufferSize];
|
||
}
|
||
}
|
||
|
||
pos_bgn_ = new size_t[num_threads_];
|
||
pos_end_ = new size_t[num_threads_];
|
||
}
|
||
|
||
template <typename PlainType,
|
||
typename CompareType,
|
||
typename UnsignedType,
|
||
typename Encoder,
|
||
typename ValueManager,
|
||
typename ThreaderType,
|
||
unsigned int Base>
|
||
PlainType* ParallelRadixSortInternal<PlainType,
|
||
CompareType,
|
||
UnsignedType,
|
||
Encoder,
|
||
ValueManager,
|
||
ThreaderType,
|
||
Base>::Sort(PlainType* data, ValueManager* value_manager)
|
||
{
|
||
UnsignedType* src = reinterpret_cast<UnsignedType*>(data);
|
||
UnsignedType* res = SortInternal(src, value_manager);
|
||
return reinterpret_cast<PlainType*>(res);
|
||
}
|
||
|
||
template <typename PlainType,
|
||
typename CompareType,
|
||
typename UnsignedType,
|
||
typename Encoder,
|
||
typename ValueManager,
|
||
typename ThreaderType,
|
||
unsigned int Base>
|
||
void ParallelRadixSortInternal<PlainType,
|
||
CompareType,
|
||
UnsignedType,
|
||
Encoder,
|
||
ValueManager,
|
||
ThreaderType,
|
||
Base>::InitAndSort(PlainType* data,
|
||
size_t num_elems,
|
||
const ThreaderType& threader,
|
||
ValueManager* value_manager)
|
||
{
|
||
ParallelRadixSortInternal prs;
|
||
prs.Init(data, num_elems, threader);
|
||
const PlainType* res = prs.Sort(data, value_manager);
|
||
if (res != data)
|
||
{
|
||
for (size_t i = 0; i < num_elems; ++i)
|
||
data[i] = res[i];
|
||
}
|
||
}
|
||
|
||
template <typename PlainType,
|
||
typename CompareType,
|
||
typename UnsignedType,
|
||
typename Encoder,
|
||
typename ValueManager,
|
||
typename ThreaderType,
|
||
unsigned int Base>
|
||
UnsignedType* ParallelRadixSortInternal<PlainType,
|
||
CompareType,
|
||
UnsignedType,
|
||
Encoder,
|
||
ValueManager,
|
||
ThreaderType,
|
||
Base>::SortInternal(UnsignedType* data,
|
||
ValueManager* value_manager)
|
||
{
|
||
|
||
value_manager_ = value_manager;
|
||
|
||
// Compute |pos_bgn_| and |pos_end_|
|
||
ComputeRanges();
|
||
|
||
// Iterate from lower bits to higher bits
|
||
const size_t bits = CHAR_BIT * sizeof(UnsignedType);
|
||
UnsignedType *src = data, *dst = tmp_;
|
||
for (unsigned int b = 0; b < bits; b += Base)
|
||
{
|
||
ComputeHistogram(b, src);
|
||
Scatter(b, src, dst);
|
||
|
||
std::swap(src, dst);
|
||
value_manager->Next();
|
||
}
|
||
|
||
return src;
|
||
}
|
||
|
||
template <typename PlainType,
|
||
typename CompareType,
|
||
typename UnsignedType,
|
||
typename Encoder,
|
||
typename ValueManager,
|
||
typename ThreaderType,
|
||
unsigned int Base>
|
||
void ParallelRadixSortInternal<PlainType,
|
||
CompareType,
|
||
UnsignedType,
|
||
Encoder,
|
||
ValueManager,
|
||
ThreaderType,
|
||
Base>::ComputeRanges()
|
||
{
|
||
pos_bgn_[0] = 0;
|
||
for (size_t i = 0; i < num_threads_ - 1; ++i)
|
||
{
|
||
const size_t t = (num_elems_ - pos_bgn_[i]) / (num_threads_ - i);
|
||
pos_bgn_[i + 1] = pos_end_[i] = pos_bgn_[i] + t;
|
||
}
|
||
pos_end_[num_threads_ - 1] = num_elems_;
|
||
}
|
||
|
||
template <typename PlainType,
|
||
typename UnsignedType,
|
||
typename Encoder,
|
||
unsigned int Base,
|
||
typename Function,
|
||
typename ThreaderType>
|
||
struct RunTask
|
||
{
|
||
RunTask(size_t binary_tree_height,
|
||
size_t binary_tree_position,
|
||
Function f,
|
||
size_t num_elems,
|
||
size_t num_threads,
|
||
const ThreaderType& threader)
|
||
: binary_tree_height_(binary_tree_height)
|
||
, binary_tree_position_(binary_tree_position)
|
||
, f_(f)
|
||
, num_elems_(num_elems)
|
||
, num_threads_(num_threads)
|
||
, threader_(threader)
|
||
{
|
||
}
|
||
|
||
template <typename ThreaderData = void*>
|
||
void operator()(ThreaderData tData = nullptr)
|
||
{
|
||
size_t num_nodes_at_current_height = (size_t)pow(2, (double)binary_tree_height_);
|
||
if (num_threads_ <= num_nodes_at_current_height)
|
||
{
|
||
const size_t my_id = binary_tree_position_ - num_nodes_at_current_height;
|
||
if (my_id < num_threads_)
|
||
{
|
||
f_(my_id);
|
||
}
|
||
}
|
||
else
|
||
{
|
||
RunTask left(binary_tree_height_ + 1,
|
||
2 * binary_tree_position_,
|
||
f_,
|
||
num_elems_,
|
||
num_threads_,
|
||
threader_);
|
||
RunTask right(binary_tree_height_ + 1,
|
||
2 * binary_tree_position_ + 1,
|
||
f_,
|
||
num_elems_,
|
||
num_threads_,
|
||
threader_);
|
||
threader_.RunChildTasks(tData, left, right);
|
||
}
|
||
}
|
||
|
||
size_t binary_tree_height_;
|
||
size_t binary_tree_position_;
|
||
Function f_;
|
||
size_t num_elems_;
|
||
size_t num_threads_;
|
||
ThreaderType threader_;
|
||
};
|
||
|
||
template <typename PlainType,
|
||
typename CompareType,
|
||
typename UnsignedType,
|
||
typename Encoder,
|
||
typename ValueManager,
|
||
typename ThreaderType,
|
||
unsigned int Base>
|
||
void ParallelRadixSortInternal<PlainType,
|
||
CompareType,
|
||
UnsignedType,
|
||
Encoder,
|
||
ValueManager,
|
||
ThreaderType,
|
||
Base>::ComputeHistogram(unsigned int b, UnsignedType* src)
|
||
{
|
||
// Compute local histogram
|
||
|
||
auto lambda = [=](const size_t my_id) {
|
||
const size_t my_bgn = pos_bgn_[my_id];
|
||
const size_t my_end = pos_end_[my_id];
|
||
size_t* my_histo = histo_[my_id];
|
||
|
||
memset(my_histo, 0, sizeof(size_t) * (1 << Base));
|
||
for (size_t i = my_bgn; i < my_end; ++i)
|
||
{
|
||
const UnsignedType s = Encoder::encode(src[i]);
|
||
UnsignedType t = (s >> b) & ((1 << Base) - 1);
|
||
compare_internal_.reverse(t);
|
||
++my_histo[t];
|
||
}
|
||
};
|
||
|
||
using RunTaskType =
|
||
RunTask<PlainType, UnsignedType, Encoder, Base, std::function<void(size_t)>, ThreaderType>;
|
||
|
||
RunTaskType root(0, 1, lambda, num_elems_, num_threads_, threader_);
|
||
this->threader_.RunParentTask(root);
|
||
|
||
// Compute global histogram
|
||
size_t s = 0;
|
||
for (size_t i = 0; i < 1 << Base; ++i)
|
||
{
|
||
for (size_t j = 0; j < num_threads_; ++j)
|
||
{
|
||
const size_t t = s + histo_[j][i];
|
||
histo_[j][i] = s;
|
||
s = t;
|
||
}
|
||
}
|
||
}
|
||
|
||
template <typename PlainType,
|
||
typename CompareType,
|
||
typename UnsignedType,
|
||
typename Encoder,
|
||
typename ValueManager,
|
||
typename ThreaderType,
|
||
unsigned int Base>
|
||
void ParallelRadixSortInternal<PlainType,
|
||
CompareType,
|
||
UnsignedType,
|
||
Encoder,
|
||
ValueManager,
|
||
ThreaderType,
|
||
Base>::Scatter(unsigned int b, UnsignedType* src, UnsignedType* dst)
|
||
{
|
||
|
||
auto lambda = [=](const size_t my_id) {
|
||
const size_t my_bgn = pos_bgn_[my_id];
|
||
const size_t my_end = pos_end_[my_id];
|
||
size_t* my_histo = histo_[my_id];
|
||
UnsignedType** my_buf = out_buf_[my_id];
|
||
size_t* my_buf_n = out_buf_n_[my_id];
|
||
|
||
memset(my_buf_n, 0, sizeof(size_t) * (1 << Base));
|
||
for (size_t i = my_bgn; i < my_end; ++i)
|
||
{
|
||
const UnsignedType s = Encoder::encode(src[i]);
|
||
UnsignedType t = (s >> b) & ((1 << Base) - 1);
|
||
compare_internal_.reverse(t);
|
||
my_buf[t][my_buf_n[t]] = src[i];
|
||
value_manager_->Push(my_id, t, my_buf_n[t], i);
|
||
++my_buf_n[t];
|
||
|
||
if (my_buf_n[t] == kOutBufferSize)
|
||
{
|
||
size_t p = my_histo[t];
|
||
for (size_t j = 0; j < kOutBufferSize; ++j)
|
||
{
|
||
size_t tp = p++;
|
||
dst[tp] = my_buf[t][j];
|
||
}
|
||
value_manager_->Flush(my_id, t, kOutBufferSize, my_histo[t]);
|
||
|
||
my_histo[t] += kOutBufferSize;
|
||
my_buf_n[t] = 0;
|
||
}
|
||
}
|
||
|
||
// Flush everything
|
||
for (size_t i = 0; i < 1 << Base; ++i)
|
||
{
|
||
size_t p = my_histo[i];
|
||
for (size_t j = 0; j < my_buf_n[i]; ++j)
|
||
{
|
||
size_t tp = p++;
|
||
dst[tp] = my_buf[i][j];
|
||
}
|
||
value_manager_->Flush(my_id, i, my_buf_n[i], my_histo[i]);
|
||
}
|
||
};
|
||
|
||
using RunTaskType =
|
||
RunTask<PlainType, UnsignedType, Encoder, Base, std::function<void(size_t)>, ThreaderType>;
|
||
RunTaskType root(0, 1, lambda, num_elems_, num_threads_, threader_);
|
||
this->threader_.RunParentTask(root);
|
||
}
|
||
} // namespace internal
|
||
|
||
// Encoders encode signed/unsigned integers and floating point numbers
|
||
// to correctly ordered unsigned integers
|
||
namespace encoder
|
||
{
|
||
class EncoderDummy
|
||
{
|
||
};
|
||
|
||
class EncoderUnsigned
|
||
{
|
||
public:
|
||
template <typename UnsignedType>
|
||
inline static UnsignedType encode(UnsignedType x)
|
||
{
|
||
return x;
|
||
}
|
||
};
|
||
|
||
class EncoderSigned
|
||
{
|
||
public:
|
||
template <typename UnsignedType>
|
||
inline static UnsignedType encode(UnsignedType x)
|
||
{
|
||
return x ^ (UnsignedType(1) << (CHAR_BIT * sizeof(UnsignedType) - 1));
|
||
}
|
||
};
|
||
|
||
class EncoderDecimal
|
||
{
|
||
public:
|
||
template <typename UnsignedType>
|
||
inline static UnsignedType encode(UnsignedType x)
|
||
{
|
||
static const size_t bits = CHAR_BIT * sizeof(UnsignedType);
|
||
const UnsignedType a = x >> (bits - 1);
|
||
const UnsignedType b = (-static_cast<int>(a)) | (UnsignedType(1) << (bits - 1));
|
||
return x ^ b;
|
||
}
|
||
};
|
||
} // namespace encoder
|
||
|
||
// Value managers are used to generalize the sorting algorithm
|
||
// to sorting of keys and sorting of pairs
|
||
namespace value_manager
|
||
{
|
||
class DummyValueManager
|
||
{
|
||
public:
|
||
inline void Push(int thread, size_t bucket, size_t num, size_t from_pos)
|
||
{
|
||
(void)thread;
|
||
(void)bucket;
|
||
(void)num;
|
||
(void)from_pos;
|
||
}
|
||
|
||
inline void Flush(int thread, size_t bucket, size_t num, size_t to_pos)
|
||
{
|
||
(void)thread;
|
||
(void)bucket;
|
||
(void)num;
|
||
(void)to_pos;
|
||
}
|
||
|
||
void Next() {}
|
||
};
|
||
|
||
template <typename PlainType, typename ValueType, int Base>
|
||
class PairValueManager
|
||
{
|
||
public:
|
||
PairValueManager()
|
||
: max_elems_(0)
|
||
, max_threads_(0)
|
||
, original_(NULL)
|
||
, tmp_(NULL)
|
||
, src_(NULL)
|
||
, dst_(NULL)
|
||
, out_buf_(NULL)
|
||
, tmp_size(0)
|
||
{
|
||
}
|
||
|
||
~PairValueManager() { DeleteAll(); }
|
||
|
||
void Init(size_t max_elems, size_t available_threads);
|
||
|
||
void Start(ValueType* original, size_t num_elems)
|
||
{
|
||
assert(num_elems <= max_elems_);
|
||
src_ = original_ = original;
|
||
dst_ = tmp_;
|
||
}
|
||
|
||
inline void Push(int thread, size_t bucket, size_t num, size_t from_pos)
|
||
{
|
||
out_buf_[thread][bucket][num] = src_[from_pos];
|
||
}
|
||
|
||
inline void Flush(int thread, size_t bucket, size_t num, size_t to_pos)
|
||
{
|
||
for (size_t i = 0; i < num; ++i)
|
||
{
|
||
dst_[to_pos++] = out_buf_[thread][bucket][i];
|
||
}
|
||
}
|
||
|
||
void Next() { std::swap(src_, dst_); }
|
||
|
||
ValueType* GetResult() { return src_; }
|
||
private:
|
||
size_t max_elems_;
|
||
int max_threads_;
|
||
|
||
static constexpr size_t kOutBufferSize = internal::kOutBufferSize;
|
||
ValueType *original_, *tmp_;
|
||
ValueType *src_, *dst_;
|
||
ValueType*** out_buf_;
|
||
vtkm::UInt64 tmp_size;
|
||
|
||
void DeleteAll();
|
||
};
|
||
|
||
template <typename PlainType, typename ValueType, int Base>
|
||
void PairValueManager<PlainType, ValueType, Base>::Init(size_t max_elems, size_t available_cores)
|
||
{
|
||
DeleteAll();
|
||
|
||
max_elems_ = max_elems;
|
||
max_threads_ = utility::GetMaxThreads(max_elems_ * sizeof(PlainType), available_cores);
|
||
|
||
{ // This allocation can be quite large, so log it:
|
||
tmp_size = max_elems * sizeof(ValueType);
|
||
VTKM_LOG_F(vtkm::cont::LogLevel::MemCont,
|
||
"Allocating working memory for radix sort-by-key: %s.",
|
||
vtkm::cont::GetSizeString(tmp_size).c_str());
|
||
tmp_ = new ValueType[max_elems];
|
||
}
|
||
|
||
out_buf_ = new ValueType**[max_threads_];
|
||
for (int i = 0; i < max_threads_; ++i)
|
||
{
|
||
out_buf_[i] = new ValueType*[1 << Base];
|
||
for (size_t j = 0; j < 1 << Base; ++j)
|
||
{
|
||
out_buf_[i][j] = new ValueType[kOutBufferSize];
|
||
}
|
||
}
|
||
}
|
||
|
||
template <typename PlainType, typename ValueType, int Base>
|
||
void PairValueManager<PlainType, ValueType, Base>::DeleteAll()
|
||
{
|
||
{ // This allocation can be quite large, so log it:
|
||
VTKM_LOG_F(vtkm::cont::LogLevel::MemCont,
|
||
"Freeing working memory for radix sort-by-key: %s.",
|
||
vtkm::cont::GetSizeString(tmp_size).c_str());
|
||
delete[] tmp_;
|
||
tmp_ = NULL;
|
||
tmp_size = 0;
|
||
}
|
||
|
||
for (int i = 0; i < max_threads_; ++i)
|
||
{
|
||
for (size_t j = 0; j < 1 << Base; ++j)
|
||
{
|
||
delete[] out_buf_[i][j];
|
||
}
|
||
delete[] out_buf_[i];
|
||
}
|
||
delete[] out_buf_;
|
||
out_buf_ = NULL;
|
||
|
||
max_elems_ = 0;
|
||
max_threads_ = 0;
|
||
}
|
||
} // namespace value_manager
|
||
|
||
// Frontend class for sorting keys
|
||
template <typename ThreaderType,
|
||
typename PlainType,
|
||
typename CompareType,
|
||
typename UnsignedType = PlainType,
|
||
typename Encoder = encoder::EncoderDummy,
|
||
unsigned int Base = 8>
|
||
class KeySort
|
||
{
|
||
using DummyValueManager = value_manager::DummyValueManager;
|
||
using Internal = internal::ParallelRadixSortInternal<PlainType,
|
||
CompareType,
|
||
UnsignedType,
|
||
Encoder,
|
||
DummyValueManager,
|
||
ThreaderType,
|
||
Base>;
|
||
|
||
public:
|
||
void InitAndSort(PlainType* data,
|
||
size_t num_elems,
|
||
const ThreaderType& threader,
|
||
const CompareType& comp)
|
||
{
|
||
(void)comp;
|
||
DummyValueManager dvm;
|
||
Internal::InitAndSort(data, num_elems, threader, &dvm);
|
||
}
|
||
};
|
||
|
||
// Frontend class for sorting pairs
|
||
template <typename ThreaderType,
|
||
typename PlainType,
|
||
typename ValueType,
|
||
typename CompareType,
|
||
typename UnsignedType = PlainType,
|
||
typename Encoder = encoder::EncoderDummy,
|
||
int Base = 8>
|
||
class PairSort
|
||
{
|
||
using ValueManager = value_manager::PairValueManager<PlainType, ValueType, Base>;
|
||
using Internal = internal::ParallelRadixSortInternal<PlainType,
|
||
CompareType,
|
||
UnsignedType,
|
||
Encoder,
|
||
ValueManager,
|
||
ThreaderType,
|
||
Base>;
|
||
|
||
public:
|
||
void InitAndSort(PlainType* keys,
|
||
ValueType* vals,
|
||
size_t num_elems,
|
||
const ThreaderType& threader,
|
||
const CompareType& comp)
|
||
{
|
||
(void)comp;
|
||
ValueManager vm;
|
||
vm.Init(num_elems, threader.GetAvailableCores());
|
||
vm.Start(vals, num_elems);
|
||
Internal::InitAndSort(keys, num_elems, threader, &vm);
|
||
ValueType* res_vals = vm.GetResult();
|
||
if (res_vals != vals)
|
||
{
|
||
for (size_t i = 0; i < num_elems; ++i)
|
||
{
|
||
vals[i] = res_vals[i];
|
||
}
|
||
}
|
||
}
|
||
|
||
private:
|
||
};
|
||
|
||
#define KEY_SORT_CASE(plain_type, compare_type, unsigned_type, encoder_type) \
|
||
template <typename ThreaderType> \
|
||
class KeySort<ThreaderType, plain_type, compare_type> \
|
||
: public KeySort<ThreaderType, \
|
||
plain_type, \
|
||
compare_type, \
|
||
unsigned_type, \
|
||
encoder::Encoder##encoder_type> \
|
||
{ \
|
||
}; \
|
||
template <typename V, typename ThreaderType> \
|
||
class PairSort<ThreaderType, plain_type, V, compare_type> \
|
||
: public PairSort<ThreaderType, \
|
||
plain_type, \
|
||
V, \
|
||
compare_type, \
|
||
unsigned_type, \
|
||
encoder::Encoder##encoder_type> \
|
||
{ \
|
||
};
|
||
|
||
// Unsigned integers
|
||
KEY_SORT_CASE(unsigned int, std::less<unsigned int>, unsigned int, Unsigned);
|
||
KEY_SORT_CASE(unsigned int, std::greater<unsigned int>, unsigned int, Unsigned);
|
||
KEY_SORT_CASE(unsigned short int, std::less<unsigned short int>, unsigned short int, Unsigned);
|
||
KEY_SORT_CASE(unsigned short int, std::greater<unsigned short int>, unsigned short int, Unsigned);
|
||
KEY_SORT_CASE(unsigned long int, std::less<unsigned long int>, unsigned long int, Unsigned);
|
||
KEY_SORT_CASE(unsigned long int, std::greater<unsigned long int>, unsigned long int, Unsigned);
|
||
KEY_SORT_CASE(unsigned long long int,
|
||
std::less<unsigned long long int>,
|
||
unsigned long long int,
|
||
Unsigned);
|
||
KEY_SORT_CASE(unsigned long long int,
|
||
std::greater<unsigned long long int>,
|
||
unsigned long long int,
|
||
Unsigned);
|
||
|
||
// Unsigned char
|
||
KEY_SORT_CASE(unsigned char, std::less<unsigned char>, unsigned char, Unsigned);
|
||
KEY_SORT_CASE(unsigned char, std::greater<unsigned char>, unsigned char, Unsigned);
|
||
KEY_SORT_CASE(char16_t, std::less<char16_t>, uint16_t, Unsigned);
|
||
KEY_SORT_CASE(char16_t, std::greater<char16_t>, uint16_t, Unsigned);
|
||
KEY_SORT_CASE(char32_t, std::less<char32_t>, uint32_t, Unsigned);
|
||
KEY_SORT_CASE(char32_t, std::greater<char32_t>, uint32_t, Unsigned);
|
||
KEY_SORT_CASE(wchar_t, std::less<wchar_t>, uint32_t, Unsigned);
|
||
KEY_SORT_CASE(wchar_t, std::greater<wchar_t>, uint32_t, Unsigned);
|
||
|
||
// Signed integers
|
||
KEY_SORT_CASE(char, std::less<char>, unsigned char, Signed);
|
||
KEY_SORT_CASE(char, std::greater<char>, unsigned char, Signed);
|
||
KEY_SORT_CASE(short, std::less<short>, unsigned short, Signed);
|
||
KEY_SORT_CASE(short, std::greater<short>, unsigned short, Signed);
|
||
KEY_SORT_CASE(int, std::less<int>, unsigned int, Signed);
|
||
KEY_SORT_CASE(int, std::greater<int>, unsigned int, Signed);
|
||
KEY_SORT_CASE(long, std::less<long>, unsigned long, Signed);
|
||
KEY_SORT_CASE(long, std::greater<long>, unsigned long, Signed);
|
||
KEY_SORT_CASE(long long, std::less<long long>, unsigned long long, Signed);
|
||
KEY_SORT_CASE(long long, std::greater<long long>, unsigned long long, Signed);
|
||
|
||
// |signed char| and |char| are treated as different types
|
||
KEY_SORT_CASE(signed char, std::less<signed char>, unsigned char, Signed);
|
||
KEY_SORT_CASE(signed char, std::greater<signed char>, unsigned char, Signed);
|
||
|
||
// Floating point numbers
|
||
KEY_SORT_CASE(float, std::less<float>, uint32_t, Decimal);
|
||
KEY_SORT_CASE(float, std::greater<float>, uint32_t, Decimal);
|
||
KEY_SORT_CASE(double, std::less<double>, uint64_t, Decimal);
|
||
KEY_SORT_CASE(double, std::greater<double>, uint64_t, Decimal);
|
||
|
||
#undef KEY_SORT_CASE
|
||
|
||
template <typename T, typename CompareType>
|
||
struct run_kx_radix_sort_keys
|
||
{
|
||
static void run(T* data, size_t num_elems, const CompareType& comp)
|
||
{
|
||
std::sort(data, data + num_elems, comp);
|
||
}
|
||
};
|
||
|
||
#define KX_SORT_KEYS(key_type) \
|
||
template <> \
|
||
struct run_kx_radix_sort_keys<key_type, std::less<key_type>> \
|
||
{ \
|
||
static void run(key_type* data, size_t num_elems, const std::less<key_type>& comp) \
|
||
{ \
|
||
(void)comp; \
|
||
kx::radix_sort(data, data + num_elems); \
|
||
} \
|
||
};
|
||
|
||
KX_SORT_KEYS(unsigned short int);
|
||
KX_SORT_KEYS(int);
|
||
KX_SORT_KEYS(unsigned int);
|
||
KX_SORT_KEYS(long int);
|
||
KX_SORT_KEYS(unsigned long int);
|
||
KX_SORT_KEYS(long long int);
|
||
KX_SORT_KEYS(unsigned long long int);
|
||
KX_SORT_KEYS(unsigned char);
|
||
|
||
#undef KX_SORT_KEYS
|
||
|
||
template <typename T, typename CompareType>
|
||
bool use_serial_sort_keys(T* data, size_t num_elems, const CompareType& comp)
|
||
{
|
||
size_t total_bytes = (num_elems) * sizeof(T);
|
||
if (total_bytes < MIN_BYTES_FOR_PARALLEL)
|
||
{
|
||
run_kx_radix_sort_keys<T, CompareType>::run(data, num_elems, comp);
|
||
return true;
|
||
}
|
||
return false;
|
||
}
|
||
|
||
// Generate radix sort interfaces for key and key value sorts.
|
||
#define VTKM_INTERNAL_RADIX_SORT_INSTANTIATE(threader_type, key_type) \
|
||
VTKM_CONT_EXPORT void parallel_radix_sort_key_values( \
|
||
key_type* keys, vtkm::Id* vals, size_t num_elems, const std::greater<key_type>& comp) \
|
||
{ \
|
||
using namespace vtkm::cont::internal::radix; \
|
||
PairSort<threader_type, key_type, vtkm::Id, std::greater<key_type>> ps; \
|
||
ps.InitAndSort(keys, vals, num_elems, threader_type(), comp); \
|
||
} \
|
||
VTKM_CONT_EXPORT void parallel_radix_sort_key_values( \
|
||
key_type* keys, vtkm::Id* vals, size_t num_elems, const std::less<key_type>& comp) \
|
||
{ \
|
||
using namespace vtkm::cont::internal::radix; \
|
||
PairSort<threader_type, key_type, vtkm::Id, std::less<key_type>> ps; \
|
||
ps.InitAndSort(keys, vals, num_elems, threader_type(), comp); \
|
||
} \
|
||
VTKM_CONT_EXPORT void parallel_radix_sort( \
|
||
key_type* data, size_t num_elems, const std::greater<key_type>& comp) \
|
||
{ \
|
||
using namespace vtkm::cont::internal::radix; \
|
||
if (!use_serial_sort_keys(data, num_elems, comp)) \
|
||
{ \
|
||
KeySort<threader_type, key_type, std::greater<key_type>> ks; \
|
||
ks.InitAndSort(data, num_elems, threader_type(), comp); \
|
||
} \
|
||
} \
|
||
VTKM_CONT_EXPORT void parallel_radix_sort( \
|
||
key_type* data, size_t num_elems, const std::less<key_type>& comp) \
|
||
{ \
|
||
using namespace vtkm::cont::internal::radix; \
|
||
if (!use_serial_sort_keys(data, num_elems, comp)) \
|
||
{ \
|
||
KeySort<threader_type, key_type, std::less<key_type>> ks; \
|
||
ks.InitAndSort(data, num_elems, threader_type(), comp); \
|
||
} \
|
||
}
|
||
|
||
#define VTKM_INSTANTIATE_RADIX_SORT_FOR_THREADER(ThreaderType) \
|
||
VTKM_INTERNAL_RADIX_SORT_INSTANTIATE(ThreaderType, short int) \
|
||
VTKM_INTERNAL_RADIX_SORT_INSTANTIATE(ThreaderType, unsigned short int) \
|
||
VTKM_INTERNAL_RADIX_SORT_INSTANTIATE(ThreaderType, int) \
|
||
VTKM_INTERNAL_RADIX_SORT_INSTANTIATE(ThreaderType, unsigned int) \
|
||
VTKM_INTERNAL_RADIX_SORT_INSTANTIATE(ThreaderType, long int) \
|
||
VTKM_INTERNAL_RADIX_SORT_INSTANTIATE(ThreaderType, unsigned long int) \
|
||
VTKM_INTERNAL_RADIX_SORT_INSTANTIATE(ThreaderType, long long int) \
|
||
VTKM_INTERNAL_RADIX_SORT_INSTANTIATE(ThreaderType, unsigned long long int) \
|
||
VTKM_INTERNAL_RADIX_SORT_INSTANTIATE(ThreaderType, unsigned char) \
|
||
VTKM_INTERNAL_RADIX_SORT_INSTANTIATE(ThreaderType, signed char) \
|
||
VTKM_INTERNAL_RADIX_SORT_INSTANTIATE(ThreaderType, char) \
|
||
VTKM_INTERNAL_RADIX_SORT_INSTANTIATE(ThreaderType, char16_t) \
|
||
VTKM_INTERNAL_RADIX_SORT_INSTANTIATE(ThreaderType, char32_t) \
|
||
VTKM_INTERNAL_RADIX_SORT_INSTANTIATE(ThreaderType, wchar_t) \
|
||
VTKM_INTERNAL_RADIX_SORT_INSTANTIATE(ThreaderType, float) \
|
||
VTKM_INTERNAL_RADIX_SORT_INSTANTIATE(ThreaderType, double)
|
||
|
||
VTKM_THIRDPARTY_POST_INCLUDE
|
||
}
|
||
}
|
||
}
|
||
} // end namespace vtkm::cont::internal::radix
|
||
|
||
#endif // vtk_m_cont_internal_ParallelRadixSort_h
|