Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
References
F. Irigoin, P. Jouvelot and R. Triolet “PIPS overview”, ICS'91 Paris, France
G. Cybenko, “Supercomputer Performances Trends and the Perfect Benchmark”, Supercomputing Review, April 1991
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, L. (1992). Complexity estimation in the pips parallel programming environment. In: Bougé, L., Cosnard, M., Robert, Y., Trystram, D. (eds) Parallel Processing: CONPAR 92—VAPP V. VAPP CONPAR 1992 1992. Lecture Notes in Computer Science, vol 634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55895-0_518
Download citation
DOI: https://doi.org/10.1007/3-540-55895-0_518
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55895-8
Online ISBN: 978-3-540-47306-0
eBook Packages: Springer Book Archive