A Systolizing Compilation Scheme: Abstract

We describe a methodology for mapping linear recurrence equations to a spectrum of systolic architectures. First, we design a systolic program in a very general architecture referred to as Basic Systolic Architecture and establish the correctness of the implementation. Next, we show how ef-cient transformations/implementations of programs for diierent systolic architectures can be obtained through transformations such as projections and translations.