What is a Systolic Algorithm?

Abstract

In this paper, we show that every systolic array executes a Regular Iterative Algorithm with a strongly separating hyperplane and conversely, that every such algorithm can be implemented on a systolic array. This characterization provides us with an unified framework for describing the contributions of other authors. It also exposes the relevance of many fundamental concepts that were introduced in the sixties by Hennie, Waite and Karp, Miller and Winograd, to the present day concern of systolic array design.

Scheduling reductions on realistic machines

“…Quinton [13] and other researchers used some of these ideas for designing systolic arrays defined over a polyhedral index space. Rao [18,19] and Roychowdhury [21] also investigated multidimensional schedules for SUREs. Delosme and Ipsen first studied the scheduling problems for affine recurrences (they defined the term ARE), but without considering the domains over which they were defined [2].…”