reduce.h 1.47 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
// Copyright (c) Microsoft Corporation.
// Licensed under the MIT License.
#pragma once

#include "common.h"

namespace tl {

struct SumOp {
  template <typename T>
  TL_DEVICE T operator()(T const& x, T const& y) {
    return x + y;
  }
};

struct MaxOp {
  template <typename T>
  TL_DEVICE T operator()(T const& x, T const& y) {
    return cutlass::fast_max(x, y);
  }
};

struct MinOp {
  template <typename T>
  TL_DEVICE T operator()(T const& x, T const& y) {
    return cutlass::fast_min(x, y);
  }
};

template <class Reducer, int threads, int scale>
struct AllReduce {
  static_assert(threads == 1024 or threads == 512 or threads == 256 or threads == 128 or
                threads == 64 or threads == 32 or threads == 16 or threads == 8 or threads == 4 or
                threads == 2);
  static_assert(threads % scale == 0);
  template <typename T>
  static TL_DEVICE T run(T x, T* red_buf = nullptr) {
    constexpr int offset = threads / 2;
    if constexpr (offset >= 32) {
      __syncthreads();
      // asm volatile("bar.sync %0, %1;" : : "r"(1), "r"(256));
      red_buf[threadIdx.x] = x;
      __syncthreads();
      // asm volatile("bar.sync %0, %1;" : : "r"(2), "r"(256));
      x = Reducer()(x, red_buf[threadIdx.x ^ offset]);
    } else {
      x = Reducer()(x, T(__shfl_xor_sync(uint32_t(-1), x, offset)));
    }
    if constexpr (offset == scale) {
      return x;
    } else {
      return AllReduce<Reducer, offset, scale>::run(x, red_buf);
    }
  }
};

}  // namespace tl