Complexity estimation in the pips parallel programming environment

  • Lei Zhou
Part of the Lecture Notes in Computer Science book series (LNCS, volume 634)


In order to choose the best optimized version of a real Fortran program, we have to compare the execution times of different optimized versions of the same Fortran program. Since real scientific Fortran programs can run for hours on expensive machines, it is useful to perform a static analysis that predicts the running-time. In this paper, we introduce our complexity model, which is a part of the PIPS project. This model is composed of a library of polynomial models of program performance and dynamically-derived program statistics to estimate the running time of Fortran programs. Then, complexity results of a real example from the PERFECT Club are presented.


  1. [1]
    F. Irigoin, P. Jouvelot and R. Triolet “PIPS overview”, ICS'91 Paris, FranceGoogle Scholar
  2. [2]
    G. Cybenko, “Supercomputer Performances Trends and the Perfect Benchmark”, Supercomputing Review, April 1991Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Lei Zhou
    • 1
  1. 1.Centre de Recherche en InformatiqueEcole Nationale Supérieure des Mines de ParisFrance

Personalised recommendations