论文信息 - Automatic Parallelization of Fortran Programs in the Presence of Procedure Calls - 字舞流文

Automatic Parallelization of Fortran Programs in the Presence of Procedure Calls

Scientific programs must be transformed and adapted to supercomputers to be executed efficiently. Automatic parallelization has been a very active research field for the past few years and effective restructuring compilers have been developed.

Paul Feautrier | François Irigoin | Remi Triolet | P. Feautrier | F. Irigoin | R. Triolet

[1] Utpal Banerjee,et al. Speedup of ordinary programs , 1979 .

[2] Nicolas Halbwachs,et al. Automatic discovery of linear restraints among variables of a program , 1978, POPL.

[3] Ralph Grishman,et al. The NYU Ultracomputer—designing a MIMD, shared-memory parallel machine (Extended Abstract) , 1982, ISCA 1982.

[4] John Randal Allen,et al. Dependence analysis for subscripted variables and its application to program transformations , 1983 .

[5] Gary A. Kildall,et al. A unified approach to global program optimization , 1973, POPL.

[6] R. Duffin. On fourier’s analysis of linear inequality systems , 1974 .

[7] Matthew S. Hecht,et al. Flow Analysis of Computer Programs , 1977 .

[8] Jack J. Dongarra,et al. A collection of parallel linear equations routines for the Denelcor HEP , 1984, Parallel Comput..

[9] Kevin P. McAuliffe,et al. The IBM Research Parallel Processor Prototype (RP3): Introduction and Architecture , 1985, ICPP.

[10] Robert E. Shostak,et al. Deciding Linear Inequalities by Computing Loop Residues , 1981, JACM.

[11] Daniel Gajski,et al. CEDAR: a large scale multiprocessor , 1983, CARN.

[12] Paul Feautrier. Projet Vesta: outil de calcul symbolique , 1984, Symposium on Programming.

[13] D. Sciamma,et al. Vesta: Vectorisation automatique et paramétrée de programmes , 1984, Symposium on Programming.