Synthesis of an Optimal Family of Matrix Multiplication Algorithms on Linear Arrays

Synthesis of a family of matrix multiplication algorithms on a linear array is described. All these algorithms are optimal in their area and time requirements. An important feature of the family of algorithms is that they are modularly extensible, that is, larger problem sizes can be handled by cascading smaller arrays consisting of processors having a… CONTINUE READING