An overview of the PTRAN analysis system for multiprocessing

[1]  J P Fitch.  Compiling for Parallelism , 1989 .

[2]  Vivek Sarkar,et al.  Automatic Discovery of Parallelism: A Tool and an Experiment (Extended Abstract) , 1988, PPOPP/PPEALS.

[3]  Wilson C. Hsieh,et al.  A framework for determining useful parallelism , 1988, ICS '88.

[4]  Ken Kennedy,et al.  Automatic decomposition of scientific programs for parallel execution , 1987, POPL '87.

[5]  Ken Kennedy,et al.  Automatic translation of FORTRAN programs to vector form , 1987, TOPL.

[6]  Joe D. Warren,et al.  The program dependence graph and its use in optimization , 1984, TOPL.

[7]  Ron Cytron,et al.  What's In a Name? -or- The Value of Renaming for Parallelism Detection and Storage Allocation , 1987, ICPP.

[8]  David A. Padua,et al.  Advanced compiler optimizations for supercomputers , 1986, CACM.

[9]  Ken Kennedy,et al.  The impact of interprocedural analysis and optimization in the Rn programming environment , 1986, TOPL.

[10]  Linda Torczon,et al.  Interprocedural optimization: eliminating unnecessary recompilation , 1986, SIGPLAN '86.

[11]  Paul Feautrier,et al.  Direct parallelization of call statements , 1986, SIGPLAN '86.

[12]  Ron Cytron.  Useful Parallelism in a Multiprocessing Environment , 1985, ICPP.

[13]  Ken Kennedy,et al.  Efficient computation of flow insensitive interprocedural summary information , 1984, SIGPLAN '84.

[14]  Ken Kennedy,et al.  Conversion of control dependence to data dependence , 1983, POPL '83.

[15]  Micha Sharir,et al.  Experience with the SETL Optimizer , 1983, TOPL.

[16]  Martin Hopkins,et al.  An overview of the PL.8 compiler , 1982, SIGPLAN '82.

[17]  David A. Padua,et al.  Dependence graphs and compiler optimizations , 1981, POPL '81.

[18]  Louise Trevillyan,et al.  The Experimental Compiling System , 1980, IBM J. Res. Dev..

[19]  Utpal Banerjee,et al.  Time and Parallel Processor Bounds for Fortran-Like Loops , 1979, IEEE Transactions on Computers.

[20]  John Banning,et al.  : An Efficient , 2022 .

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

[22]  David L. Kuck,et al.  The Structure of Computers and Computations , 1978 .

[23]  John H. Reif,et al.  Symbolic evaluation and the global value graph , 1977, POPL.

[24]  Alfred V. Aho,et al.  Principles of Compiler Design , 1977 .

[25]  James R. Geiser,et al.  An Efficient Decision Procedure for the Theory of Rational Order , 1977, Theor. Comput. Sci..

[26]  John Cocke,et al.  A program data flow analysis procedure , 1976, CACM.

[27]  Jeanne Ferrante,et al.  A Decision Procedure for the First Order Theory of Real Addition with Order , 1975, SIAM J. Comput..

[28]  Leslie Lamport,et al.  The parallel execution of DO loops , 1974, CACM.

[29]  B. S. Garbow,et al.  Matrix Eigensystem Routines — EISPACK Guide , 1974, Lecture Notes in Computer Science.

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