CUTLASS
CUDA Templates for Linear Algebra Subroutines and Solvers
|
This defines a "fragment" iterator for visiting the fragments of an accumulator tile that participate in one warp-level store operation. More...
#include "cutlass/array.h"
#include "cutlass/layout/matrix.h"
#include "cutlass/gemm/gemm.h"
#include "cutlass/epilogue/warp/volta_tensor_op_policy.h"
Go to the source code of this file.
Classes | |
class | cutlass::epilogue::warp::FragmentIteratorVoltaTensorOp< WarpShape, InterleavedTileShape, ElementC, Layout > |
class | cutlass::epilogue::warp::FragmentIteratorVoltaTensorOp< WarpShape_, gemm::GemmShape< 32, 32, 4 >, half_t, layout::RowMajor > |
Partial specialization for row-major shared memory. More... | |
class | cutlass::epilogue::warp::FragmentIteratorVoltaTensorOp< WarpShape_, gemm::GemmShape< 32, 32, 4 >, float, layout::RowMajor > |
Partial specialization for row-major shared memory. More... | |
Namespaces | |
cutlass | |
cutlass::epilogue | |
cutlass::epilogue::warp | |
Typically, the accumulator tile is the largest single block of register-backed storage within the kernel. Storing it to memory is best accomplished by partitioning it into smaller tiles and storing these sequentially.
Round trips through shared memory during the Epilogue phase require partitioning, as shared memory capacity is typically insufficient for a threadblock's total accumulator size.