Dynamic data distribution with control flow analysis

  • Authors:

  • Jordi Garcia;Eduard Ayguade;Jesus Labarta

  • Affiliations:

  • Computer Architecture Department, Polytechnic University of Catalunya, Cr. Gran Capitá s/núm, Mòdul D6, 08034 - Barcelona, Spain;Computer Architecture Department, Polytechnic University of Catalunya, Cr. Gran Capitá s/núm, Mòdul D6, 08034 - Barcelona, Spain;Computer Architecture Department, Polytechnic University of Catalunya, Cr. Gran Capitá s/núm, Mòdul D6, 08034 - Barcelona, Spain

  • Venue:
  • Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes the design of a data distribution tool which automatically derives the data mapping for the arrays and the parallelization strategy for the loops in a Fortran 77 program. The layout generated can be static or dynamic, and the distribution is one-dimensional BLOCK or CYCLIC. The tool takes into account the control flow statements in the code in order to better estimate the behavior of the program. All the information regarding data movement and parallelism is contained in a single data structure named Communication-Parallelism Graph (CPG). The CPG is used to model a minimal path problem in which time is the objective function to minimize. It is solved using a general purpose linear programming solver, which finds the optimal solution for the whole problem. The experimental results will illustrate the quality of the solutions generated and the feasibility of the approach in terms of compilation time.