Technologies for automatic reordering of sparse matrices
AssigneeIntel Corporation
InventorsHongbo Rong, Jongsoo Park, Todd A. Anderson
Life of this patent
Estimating the term…
Loading patent…
AssigneeIntel Corporation
InventorsHongbo Rong, Jongsoo Park, Todd A. Anderson
Estimating the term…
Technologies for automatic reordering of sparse matrices include a computing device to determine a distributivity of an expression defined in a code region of a program code. The expression is determined to be distributive if semantics of the expression are unaffected by a reordering of an input/output of the expression. The computing device performs inter-dependent array analysis on the expression to determine one or more clusters of inter-dependent arrays of the expression, wherein each array of a cluster of the one or more clusters is inter-dependent on each other array of the cluster, and performs bi-directional data flow analysis on the code region by iterative backward and forward propagation of reorderable arrays through expressions in the code region based on the one or more clusters of the inter-dependent arrays. The backward propagation is based on a backward transfer function and the forward propagation is based on a forward transfer function.
A computing device including a memory and one or more processors in communication with the memory for automatic reordering of sparse matrices, the computing device comprising:
One or more non-transitory machine-readable storage media comprising a plurality of instructions stored thereon that, in response to execution by a computing device, cause the computing device to:
A computer-implemented method of automatic reordering of sparse matrices, the method comprising:
Dependencies are inferred from the claim text.