Zusammenfassung
Programs and systems of recurrence equations may be represented
as sets of actions which are to be executed subject to
precedence constraints. In may cases, actions may be labelled by
integral vectors in some iterations domains, and precedence
constraints may be described by affine relations. A schedule for
such a program is a function which assigns an execution data to
each action. Knowledge of such a schedule allows one to estimate
the intrinsic degree of parallelism of the program and to
compile a parallel version for multiprocessor architectures or
systolic arrays. This paper deals with the problem of finding
closed form schedules as affine or piecewise affine functions of
the iteration vector. An algorithm is presented which reduces
the scheduling problem to a parametric linear program of small
size, which can be readily solved by an efficient algorithm.
Nutzer