Maximum Pipelining of Array Operations on Static Data Flow Machine

Data flow computers are a radical departure from conventional computer architecture, and new methodologies are required for generating efficient machine-level programs from high level user programming languages. The authors show that, for certain programs in the VAL language, it is possible to construct machine-level data flow programs that support fully pipelined computation. A VAL program in the class considered consists of blocks of code each of which defines a new array value either by a forall expression in which each element may be computed independently, or by a for-iter expression that defines array elements by a first-order recurrence relation. 7 references.