Renamings, Maximal Parallelism, and Space-Time Tradeoff in Program Schemata

Abstract

Concepts such as “maximal parallelism,” “greater parallelism,” and “instruction look-ahead” are investigated in the framework of program schemata theory A method for increasing the parallelism of a program schema by changing its control structure and the name of Jts variables Js given. A characterization result of maximal parallelism, a method for approxunating the maximally parallel form of a given finite schema, and a space-tune tradeoff pnnctple are obtained It ts shown that maximal paraUehsm is a decidable property for fimte schemata, but that there are fmite schemata whose maximally parallel form requires an infinite control and an infinite number of memory variables. © 1979, ACM. All rights reserved.