Direct parallelization of call statements

ACM SIGPLAN Notices

Volumn 21, Issue 7, 1986, Pages 176-185

  Triolet, Rémi ^a   Irigoin, Francois ^b   Feautrier, Paul ^c  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b PSL RESEARCH UNIVERSITY   (France)

^c SORBONNE UNIVERSITÉ   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976844340     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/13310.13329     Document Type: Article

References (20)

1. F. E. Allen, Interprocedural Data Flow Analysis, Proc. of the IFIP Congress, North Holland, (1974)
2. U. Banerjee, Speedup of Ordinary Programs, Report No. UIUCDCS-R-79-989, University of Illinois at Urbana-Champaign, (1979)
3. P. Cousot, N. Halbwacks, Automatic Discovery of Linear Restraints among Variables of a Program, in Proc. of the 5th POPL, (1978)
4. R. G. Cytron, Compile-time Scheduling and Optimization for Asynchronous Machines, Report No. UIUCDCS-R-84-1177, University of Illinois at Urbana-Champaign, (1984)
5. J. J. Dongarra and R. E. Hiromoto, A Collection of Parallel Linear Equations Routines for the Denelcor HEP, Parallel Computing, vol. 1(2), North Holland, (1984)
6. R. J. Duffin, On Fourier's Analysis of Linear Inequality Systems, Mathematical Programming Study 1, North Holland, (1974)
7. N. Halbwachs, Automatic Discovery of Linear Relationships among Variables of a Program, in French: Détermination automatique de relations lineaires vérifiées par les variables d'un programme, Thèse 3ème cycle, Université de Grenoble (I.N.P.), (1979)
8. M. S. Hecht, Flow Analysis of Computer Programs, North Holland, (1977)
9. C. A. Huson, An Jn-Line Subroutine Expander for Parafrase, Rep. UIUCDCS-R-82-1118, University of Illinois at Urbana-Champaign, (1982)
10. M. Karr, Affine Relationships among Variables of a Program, Acta Informatica, No 6, (1976)
11. K. Kennedy, Automatic Translation of Fortran Programs to Vector Form, Report No. 476-029-4, Rice University, (1980)
12. G. Killdal, A Unified Approch to Global Program Optimization, Proc. of the 1st POPL, (1973)
13. D. J. Kuck, Dependence Graph and Compiler Optimizations, Proc. of the 8th POPL, (1981)
14. R. H. Kuhn, Optimization and Interconnection Complexity for: Parallel Processors, Single-Stage Networks, and Decision Trees, Report No. UIUCDCS-R-80-1009, University of Illinois at Urbana-Champaign, (1980)
15. Analyzer Documentation (PARAFRASE), Center for Supercomputing R&D, University of Illinois at Urbana-Champaign, (1985)
16. R. Shostak, Deciding Linear Inequalities by Computing Loop Residues, ACM Journal, Vol. 28(4), (1981)
17. R. Triolet, Contribution to Automatic Parallelization of Fortran Programs with Procedure Calls in French: Contribution à la parall'elisation automatique de programmes Fortran comportant des appels de procedure, Thèse de Docteur-Ingénieur, Université PARIS VI (I.P.), (1984)
18. R. Triolet, Interprocedural Analysis Based Restructuring of Fortran Programs, Proc. of the International Workshop, Parallel Algorithms & Architectures, Marseille (France), to be published by North-Holland, (Apr. 14-18, 1986)
19. A. Veidenbaum, Compiler Optimizations and Architecture Design Issues for Multiprocessors, Report No. UIUCDCS-R-85-1207, University of Illinois at Urbana-Champaign, (1985)
20. M. J. Wolfe, Optimizing Supercompilers for Supercomputers, Report No. UIUCDCS-R-82-1105, University of Illinois at Urbana-Champaign, (1982)