Processing system and method for performing sparse matrix multiplication
by reordering vector blocks
    4.
    发明授权
    Processing system and method for performing sparse matrix multiplication by reordering vector blocks 失效
    通过重新排列矢量块来执行稀疏矩阵乘法的处理系统和方法

    公开(公告)号:US5905666A

    公开(公告)日:1999-05-18

    申请号:US931901

    申请日:1997-08-28

    IPC分类号: G06F17/16 G06F7/52 G06F19/00

    CPC分类号: G06F17/16

    摘要: A method, system, and data structure are provided which facilitate matrix multiplication with advantageous computational efficiency. The invention, as variously implemented as a processing system, method, or data structure in a recording medium such as a memory, has applicability to numerous fields, including linear programming, where a great deal of multiplication of large, sparse matrices is performed. The method of the invention includes the steps of creating a first submatrix block from non-zero terms of a sparse matrix, such that all of the terms within a given column of the submatrix block are form a respective column of the sparse matrix, creating a corresponding second index submatrix block of the same dimensions as the first block, such that each term of the second block identifies the position of the corresponding term of the first block within the sparse matrix, in terms of a row and column index. Finally, the method includes reordering terms of the first and second blocks correspondingly, as necessary to produce a final configuration within the first and second blocks such that all of the row indices within any given row of the second block are distinct.

    摘要翻译: 提供了一种有利于计算效率的方法,系统和数据结构,有利于矩阵乘法。 本发明作为诸如存储器的记录介质中的处理系统,方法或数据结构的各种实施方式具有适用于包括线性规划在内的许多领域,其中执行大量稀疏矩阵的大量乘法。 本发明的方法包括以下步骤:从稀疏矩阵的非零项创建第一子矩阵块,使得子矩阵块的给定列内的所有项都形成稀疏矩阵的相应列,从而创建 相应的与第一块相同尺寸的第二索引子矩阵块,使得第二块的每个项根据行和列索引识别稀疏矩阵内的第一块的对应项的位置。 最后,该方法包括根据需要重新排序第一和第二块的项,以产生第一和第二块内的最终配置,使得第二块的任何给定行内的所有行索引是不同的。