A framework for determining useful parallelism

Abstract

An approach to finding and forming parallel processes for both sequential and parallel programs is presented. The approach is presented in a framework that can create useful parallelism for a variety of parallel architectures. The framework makes use of a control dependence graph to capture maximal parallelism, a process tree to expose useful parallelism, renaming and storage segregation to reduce data dependences, and an architecture-specific cost analyzer to evaluate the effectiveness of the potential processes. The framework is currently being implemented.