Iterative Solution of Sparse Linear Systems on Systolic Arrays.
Rami Melhem · Proceedings of the International Conference on Parallel Processing · 1987
Abstract : The idea of grouping the non-zero elements of a sparse matrix into few strips that are almost parallel is applied to the design of a systolic accelerator for sparse matrix operations. This accelerator is, then, integrated into a complete systolic system for the solution of large sparse linear systems of equations. The design demonstrates that the application of systolic arrays is not limited to regular computations, and that computationally irregular problems may be solved on systolic networks if local storage is provided in each systolic cell for buffering the irregularity in the data movement and for absorbing the irregularity in the computation.