A framework for determining useful parallelism

  • Authors:
  • F. Allen;M. Burke;R. Cytron;J. Ferrante;W. Hsieh

  • Affiliations:
  • T. J. Watson Research Center, Yorktown Heights, NY;T. J. Watson Research Center, Yorktown Heights, NY;T. J. Watson Research Center, Yorktown Heights, NY;T. J. Watson Research Center, Yorktown Heights, NY;T. J. Watson Research Center, Yorktown Heights, NY

  • Venue:
  • ICS '88 Proceedings of the 2nd international conference on Supercomputing
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

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 dependencies, and an architecture-specific cost analyzer to evaluate the effectiveness of the potential processes. The framework is currently being implemented.