@inproceedings{6029d8d3fd694c4fa6e2f497a92e42ed,
title = "On the synthesis of multi-linear arrays with flexible compute time",
abstract = "This paper overviews a systematic method to design and analyze flexible multi-linear systolic arrays. The arrays have time-optimal performance for general dense matrices and can be modified to use efficiently certain sparsity patterns. The method reported here can be divided into two major parts. The first is a general design method to create a regular graph representation of algorithms. The resulting graph can be mapped onto time-optimal multi-linear arrays to implement the generic form of the algorithm. The second part develops procedures to analyze and modify the graph representation of the algorithm. The analysis is used to detect sparsity patterns that can be used to reduce the overall execution time for specific algorithm realizations.",
author = "Barada, {H. R.} and Barbir, {A. O.}",
note = "Publisher Copyright: {\textcopyright} 1991 IEEE.; 23rd Southeastern Symposium on System Theory, SSST 1991 ; Conference date: 10-03-1991 Through 12-03-1991",
year = "1991",
doi = "10.1109/SSST.1991.138531",
language = "British English",
series = "Proceedings - 23rd Southeastern Symposium on System Theory, SSST 1991",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "133--137",
booktitle = "Proceedings - 23rd Southeastern Symposium on System Theory, SSST 1991",
address = "United States",
}