Some primitives might require temporary space while performing the computations. For instance, the operations that do not have enough independent work to utilize all cores on a system might use parallelization over the reduction axis (e.g. k-axis in matrix-matrix multiplication). In this case the threads compute partial results in a temporary buffer and once finished the library reduces partial results into the final one. Another example is a convolution implementation that uses GEMM. Before using a GEMM the source images needs to be rearranged by so-called im2col
transformation. The rearrangement happens to an intermediate buffer that is then used as an input for GEMM.
In both of these examples, the temporary memory is not required once the computations are done. Intel MKL-DNN refers to such memory as a scratchpad.
The amount of space required for the scratchpad depends on the primitive and the actual implementation. The GEMM-based convolutions require a scratchpad for the im2col
data, while directly implemented convolutions can work with the original data.
Both types of implementation might need extra space for the reduction in case there are too few independent tasks. The im2col
size is proportional to the size of the source image multiplied by the weights spatial size. The size of a buffer for reduction is proportional to the tensor size to be reduced (e.g., diff_weights
in the case of backward by weights) multiplied by the number of threads in the reduction groups (the upper bound is the overall number of threads).
As you can see, the scratchpad in these cases might be significant. By contrast, some other primitives might require very little extra space. For instance, one of the implementation of the mkldnn::sum primitive requires temporary space only to store the pointers to data for each and every input array (that is, the size of the scratchpad is n * sizeof(void *)
, where n
is the number of summands).
Intel MKL-DNN supports two modes of dealing with scratchpads:
MKLDNN_ARG_SCRATCHPAD
tag). This enables the user to reuse the memory as well as to make the primitives thread-safe. However, this requires a good memory manager (in terms of speed and locality) on the user's side and some extra boilerplate code.The attributes (Primitive Attributes) are used to control who provides a scratchpad:
It is worth mentioning that all primitives support both scratchpad modes. That is, primitive descriptor creation success or failure cannot depend on the scratchpad mode used.
If the user provides scratchpad memory to a primitive, this memory must be created using the same engine that the primitive uses.
As mentioned above, this is a default behavior. We only want to highlight how a user can query the amount of memory consumed by a primitive due to a scratchpad.