Refining algorithm mappings for linear systolic arrays

Nested FOR loop algorithms are the most common applications of systolic arrays. All the techniques for mapping nested FOR loops onto systolic arrays have the 'curse of dimensionality'. The authors propose the approach of first finding coarse-grained mappings that are easier to determine and then refining these mappings through some simple transformations, to obtain efficient fine-grained mappings. The authors propose three transformation techniques that can derive efficient fine-grained mappings for linear systolic arrays. These techniques can be used to derive easily efficient mappings for some commonly known algorithms.<
>