Automatic discovery of parallelism: a tool and an experiment (extended abstract)

  • Authors:
  • Michael Burke;Ron Cytron;Jeanne Ferrante;Wilson Hsieh;Vivek Sarkar;David Shields

  • Affiliations:
  • Computer Science Department, IBM Research, T. J. Watson Research Center, Yorktown Heights, New York;Computer Science Department, IBM Research, T. J. Watson Research Center, Yorktown Heights, New York;Computer Science Department, IBM Research, T. J. Watson Research Center, Yorktown Heights, New York;Massachusetts Institute of Technology, Cambridge, Massachusetts;Computer Science Department, IBM Research, T. J. Watson Research Center, Yorktown Heights, New York;Computer Science Department, IBM Research, T. J. Watson Research Center, Yorktown Heights, New York

  • Venue:
  • PPEALS '88 Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper reports preliminary results from applying advanced techniques to the parallelization of sequential programs. Such techniques include interprocedural analysis and the identification of nested parallelism. These techniques have been proposed for exploiting the greater concurrency offered by multiprocessors as compared with vector architectures. The effectiveness of these techniques as applied to some popular numerical Fortran programs is examined. Although extrapolation is difficult, these preliminary results are encouraging indicators of the success of these techniques.