Parameterized dependence graph and its applications to multi-stage systolic mapping procedure

Author

Hwang, Y. ; Hu, Y.

Author_Institution

Dept. of Electr. & Comput. Eng., Wisconsin Univ., Madison, WI, USA

fYear

1990

fDate

3-6 Apr 1990

Firstpage

1029

Abstract

A systolic mapping procedure is proposed. A unified representation, the parameterized dependence graph (PDG), is proposed to faithfully represent the possible implementations of a given computing algorithm. A multistage mapping procedure, taking advantage of the PDG, is developed to map a multistage algorithm to a systolic array. Specifically, the multistage mapping problem is formulated as an NP-hard optimization problem. A heuristic best first search method then is devised to efficiently exploit the design space for a design which minimizes a heuristic cost function

Keywords

algorithm theory; graph theory; search problems; systolic arrays; NP-hard optimization; computing algorithm; heuristic best first search; heuristic cost function; multistage algorithm; multistage mapping; parameterized dependence graph; systolic array; systolic mapping; Application software; Computer architecture; Convolution; Cost function; Iterative algorithms; Parallel processing; Search methods; Signal processing algorithms; Systolic arrays; Very large scale integration;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech, and Signal Processing, 1990. ICASSP-90., 1990 International Conference on

Conference_Location

Albuquerque, NM

ISSN

1520-6149

Type

conf

DOI

10.1109/ICASSP.1990.116072

Filename

116072