Synthesizing systolic arrays with control signals from recurrence equations |
| |
Authors: | Sanjay V Rajopadhye |
| |
Affiliation: | (1) Computer Science Department, University of Oregon, 97403 Eugene, OR, USA |
| |
Abstract: | We present a technique for synthesizing systolic arrays which have non-uniform data flow governed by control signals. The starting point for the synthesis is anAffine Recurrence Equation—a generalization of the simple recurrences encountered in mathematics. A large class of programs, including most (single and multiple) nested-loop programs can be described by such recurrences. In this paper we extend our earlier work (Rajopadhye and Fujimoto 1986) in two principal directions. Firstly, we characterize a class of transformations calleddata pipelining and show that they yield recurrences that havelinear conditional expressions governing the computation. Secondly, we discuss the synthesis of systolic arrays that have non-uniform data flow governed by control signals. We show how to derive the control signals in such arrays by applying similar pipelining transformations to theselinear conditional expressions. The approach is illustrated by deriving the Guibas-Kung-Thompson architecture for computing the cost of optimal string parenthesization.Supported by a University of Utah Graduate Research Fellowship, and NSF grant No. MIP-8802454 |
| |
Keywords: | Synthesizing systolic arrays Control signals Recurrence equations |
本文献已被 SpringerLink 等数据库收录! |
|