GPU Coder™ supports some design patterns that map efficiently to GPU structures.
Stencil kernel operations compute each element of the output array as a function of a small region of the input array. You can express many filtering operations as a stencil operation. Examples include convolution, median filtering, and finite element methods.
In the GPU Coder implementation of the stencil kernel, each thread computes one element of the output array. Because a given input element is accessed repeatedly for computing multiple neighboring output elements, GPU Coder uses shared memory to improve memory bandwidth and data locality.
Many scientific applications contain matrix-matrix operations including the GEneral
Matrix to Matrix Multiplication (GEMM), of the form
C = AB where you can
B. The code for such
matrix-matrix operations typically takes the pattern:
for x = 1:M for y = 1:N for z = 1:K C(x,y) = F(A(x,z),B(z,y)); end end end
F() is a user-defined function. In these operations, a row from
one input matrix and a column from the second input matrix is used to compute the
corresponding element of the output matrix. Every thread reloads the row and column. This
design pattern allows optimization of this structure by reusing data and making each thread
compute multiple output elements.
F() can be a regular matrix multiply,
F()=@mtimes. For such patterns, GPU Coder provides the
MatrixMatrix kernel to create a highly
efficient, fast implementation of matrix-matrix operations on the GPU.