Computer-implemented memory allocation method for sparse matrix multiplication applications
AssigneeAlibaba (China) Co., Ltd.
InventorsZhaoyang DU, Yijin GUAN, Dimin NIU, Hongzhong ZHENG
Life of this patent
Estimating the term…
Loading patent…
AssigneeAlibaba (China) Co., Ltd.
InventorsZhaoyang DU, Yijin GUAN, Dimin NIU, Hongzhong ZHENG
Estimating the term…
This application describes an accelerator, a computer system, and a method for memory optimization in sparse matrix-matrix multiplications (spGEMM). The memory optimization includes accurate memory pre-allocation for a to-be-generated output matrix of spGEMM between two sparse matrices. An exemplary method may include: sampling a plurality of first rows in the first sparse matrix; identifying, based on indices of non-zero data in the plurality of first rows, a plurality of second rows in a second sparse matrix; performing symbolic multiplication operations between the non-zero data in the plurality of first and second rows; determining an estimated compression ratio of the output matrix; determining an estimated mean row size for each row in the output matrix based on the estimated compression ratio; and allocating, according to the estimated mean row size and a total number of rows of the output matrix, a memory space in a hardware memory.
A computer-implemented method for memory allocation in performing sparse matrix-matrix multiplications (spGEMM), comprising:
An sparse matrix-matrix multiplications (spGEMM) accelerator for memory allocation in performing spGEMM between a first sparse matrix and a second sparse matrix, comprising:
A non-transitory computer-readable storage medium for memory allocation in executing sparse matrix-matrix multiplications (spGEMM) between a first sparse matrix and a second sparse matrix, the storage medium storing instructions that, when executed by one or more processors, cause the one or more processors to perform operations comprising:
Dependencies are inferred from the claim text.