Compiler techniques for maximizing fine-grain and coarse-grain parallelism in loops with uniform dependences

  • Authors:

  • Yeong-Sheng Chen;Sheng-De Wang;Chien-Min Wang

  • Affiliations:

  • Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan 106;Institute of Information Science, Academia Sinica, Taipei, Taiwan 115;-

  • Venue:
  • ICS '94 Proceedings of the 8th international conference on Supercomputing
  • Year:
  • 1994

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, an approach to the problem of exploiting parallelism within nested loops is proposed. The proposed method first finds out all the initially independent computations, and then, based on them, identifies the valid partitioning bases to partition the entire iteration space of the loop nest. Because the shape of the iteration space is taken into account, pseudo-dependence relations are eliminated and hence more parallelism is exploited. Our approach provides a systematic method to maximize the degree of fine- or coarse-grain parallelism and is free from the open question of how to combine different loop transformations for the goal of maximizing parallelism. It is also shown that our approach can exploit more parallelism than other related work and have many advantages over them.