Invention Application
- Patent Title: SPARSE MATRIX DATA STRUCTURE
- Patent Title (中): 稀疏矩阵数据结构
-
Application No.: PCT/US2014053316Application Date: 2014-08-29
-
Publication No.: WO2015031700A3Publication Date: 2015-05-07
- Inventor: STRAUSS KARIN , FOWERS JEREMY , OVTCHAROV KALIN
- Applicant: MICROSOFT CORP
- Assignee: MICROSOFT CORP
- Current Assignee: MICROSOFT CORP
- Priority: US201314015894 2013-08-30
- Main IPC: G06F17/16
- IPC: G06F17/16
Abstract:
Various embodiments relating to encoding a sparse matrix into a data structure format that may be efficiently processed via parallel processing of a computing system are provided. In one embodiment, a sparse matrix may be received. A set of designated rows of the sparse matrix may be traversed until all non-zero elements in the sparse matrix have been placed in a first array. Each time a row in the set is traversed, a next non-zero element in that row may be placed in the first array. If all non-zero elements for a given row of the set of designated rows have been placed in the first array, the given row may be replaced in the set of designated rows with a next unprocessed row of the sparse matrix. The data structure in which the sparse matrix is encoded may be outputted. The data structure may include the first array.
Information query