Hexagonal systolic arrays for matrix multiplication
Michael P. Bekakos, Igor Ž. Milovanović, Emina I. Milovanovic, T.I. Tokic, Mile K Stojčev · WIT Press eBooks · 2001
We consider the problem of matrix multiplication on hexagonal systolic arrays (SA). We begin with the description of the procedure for systolic array designing which is based on data dependency and space-time mapping of the nested loop algorithms. Then we introduce some performance measures which are used throughout the chapter for comparison of various SAs. We proceed with modification of the standard design procedure which enables synthesis of systolic arrays with the optimal number of processing elements (PE) for a given problem size and minimal execution time for a given number of PEs. Then we analyse and compare different hexagonal arrays. Further, we show how execution time of matrix multiplication algorithm can be reduced if the number of PEs is increased with respect to the optimal one. Finally, we address the problem of fault-tolerant matrix multiplication on hexagonal arrays.