Summary form only given. A progress report on the standardization activity of the Parallel Computing Forum, including the programming model and the binding of that model in FORTRAN-77, is presented. The programming model defines two methods of describing the work to be executed in parallel: iterations of a loop and single-entry multiple-exit sections of code. Nested parallelism is supported, along with a partial sharing model for programming language viewable objects. Access to shared objects is controlled by both explicit and implicit synchronization. A large collection of details ranging from input/output issues to sequential consistency and to language/machine atomicity mismatch are addressed.>

Dependence graphs can be used as a vehicle for formulating and implementing compiler optimizations. This paper defines such graphs and discusses two kinds of transformations. The first are simple rewriting transformations that remove dependence arcs. The second are abstraction transformations that deal more globally with a dependence graph. These transformations have been implemented and applied to several different types of high-speed architectures.