Direct parallelization of call statements

  • Authors:
  • Rémi Triolet;Francois Irigoin;Paul Feautrier

  • Affiliations:
  • Univ. of Illinois;Ecole des Mines de Paris, Paris, France;Univ. Paris VI, Paris, France

  • Venue:
  • SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
  • Year:
  • 1986

Quantified Score

Hi-index 0.01

Visualization

Abstract

Asynchronous CALL statements are necessary in order to use more than one processor in current multiprocessors. Detecting CALL statements that may be executed in parallel is one way to fill this need. This approach requires accurate approximations of called procedure effects. This is achieved by using new objects called Region and Execution Context. An algorithm to find asynchronous CALL statements is given. It involves a new dependence test to compute data dependence graphs, which provides better results than previous ones even when no CALL statements are involved. This method has been implemented in Parafrase and preliminary results are encouraging.