The symbolic hyperplane transformation for recursively defined arrays

Author

Gokhale, Maya B. ; Torgersen, Todd C.

Author_Institution

Dept. of Comput. & Inf. Sci., Delaware Univ., DE, USA

fYear

1988

fDate

14-18 Nov 1988

Firstpage

207

Lastpage

214

Abstract

A restructuring transformation that can be used to parallelize recurrence relations is described. The transformation is based on the hyperplane (or wavefront) method, but extends the applicability of the method to irregularly structured recurrences. It is assumed that the time of computation of an array element is a linear combination of its indices, and a variation of the simplex method is used to seek a succession of hyperplanes along which array elements can be computed concurrently. Portions of the work reported here have been implemented in the PS automatic program generation system

Keywords

operating systems (computers); parallel processing; PS automatic program generation system; irregularly structured recurrences; recurrence relations; recursively defined arrays; restructuring transformation; simplex method; symbolic hyperplane transformation; Automatic programming; Concurrent computing; Difference equations; Iterative methods; Linear programming; Multidimensional systems; Optimal scheduling; Parallel programming; Processor scheduling; Very large scale integration;

fLanguage

English

Publisher

ieee

Conference_Titel

Supercomputing '88. [Vol.1]., Proceedings.

Conference_Location

Orlando, FL

Print_ISBN

0-8186-0882-X

Type

conf

DOI

10.1109/SUPERC.1988.44655

Filename

44655