Parallelization of loops with exits on pipelined architectures

  • Authors:
  • P. Tirumalai;M. Lee;M. Schlansker

  • Affiliations:
  • Hewlett-Packard Laboratories, Mailstop 3u-7, 1501 Page Mill Road, Palo Alto, CA;Hewlett-Packard Laboratories, Mailstop 3u-7, 1501 Page Mill Road, Palo Alto, CA;Hewlett-Packard Laboratories, Mailstop 3u-7, 1501 Page Mill Road, Palo Alto, CA

  • Venue:
  • Proceedings of the 1990 ACM/IEEE conference on Supercomputing
  • Year:
  • 1990

Quantified Score

Hi-index 0.01

Visualization

Abstract

Modulo scheduling theory can be applied successfully to overlap Fortran DO loops on pipelined computers issuing multiple operations per cycle both with and without special loop architectural support [1, 2, 3]. This paper shows that a broader class of loops - repeat-until, while, and loops with more than one exit - where the trip count is not known beforehand, can also be overlapped efficiently on multiple issue pipelined machines. Special features that are required in the architecture, as well as compiler representations for accelerating these loop constructs, are discussed. Performance results are presented for a few select examples. A prototype scheduler is currently under construction at HP Laboratories.