US 12,613,697 B2 · Tiled compressed sparse matrix format

Abstract

Approaches in accordance with various embodiments provide for the processing of sparse matrices for mathematical and programmatic operations. In particular, various embodiments utilize a tiling approach that divides a sparse matrix into submatrices, many of which will include only zero-value entities. These empty tiles can be ignored, and only the tiles with non-zero entries processed, which reduces resource and time requirements for the processing. An indexing approach can be used for each entity that is a combination of the tile identifier and an offset value, which enables the values to be multiplied correctly against, for example, values of a dense matrix. The tiles can be processed in parallel and the results accumulated to generate a matrix product. The matrix product can then be passed to the next step in a process or operation, such as to a next layer in a deep neural network.

Claims20

Dependent claims

A computer-implemented method, comprising:

causing one or more processors to:
access, from at least one first L1 cache of one or more L1 caches of the one or more processors, one or more matrix operands of one or more matrix operations to be performed by the one or more processors, wherein the one or more matrix operands comprise one or more indices to indicate one or more locations, within at least one other L1 cache of the one or more L1, of one or more separately compressed multi-element portions of the one or more matrix operands comprising one or more non-zero values;
and
perform the one or more matrix operations on the one or more matrix operands indicated by the one or more indices.

1 more element

Dependencies are inferred from the claim text.

Tiled compressed sparse matrix format

Life of this patent

Tiled compressed sparse matrix format

Life of this patent

Abstract

Claims20