next up prev
Next: About this document Up: Frameworks and Algorithms Previous: Future Directions

References

ACK87
R. Allen, D. Callahan, and K. Kennedy. Automatic decomposition of scientific programs for parallel execution. In Conference Record of the Fourteenth ACM Symposium on Principles of Programming Languages, pages 63-76, January 1987.

AI91
Corinne Ancourt and François Irigoin. Scanning polyhedra with DO loops. In Proc. of the 3rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 39-50, April 1991.

AK87
J. R. Allen and K. Kennedy. Automatic translation of Fortran programs to vector form. ACM Transactions on Programming Languages and Systems, 9(4):491-542, October 1987.

AL93
Saman P. Amarasinghe and Monica S. Lam. Communication optimization and code generation for distributed memory machines. In ACM '93 Conf. on Programming Language Design and Implementation, June 1993.

Ban79
U. Banerjee. Speedup of Ordinary Programs. PhD thesis, Dept. of Computer Science, U. of Illinois at Urbana-Champaign, October 1979.

Ban88
U. Banerjee. Dependence Analysis for Supercomputing. Kluwer Academic Publishers, 1988.

Ban90
U. Banerjee. Unimodular transformations of double loops. In Proc. of the 3rd Workshop on Programming Languages and Compilers for Parallel Computing, pages 192-219, Irvine, CA, August 1990.

Ban93
U. Banerjee. Loop Transformations for Restructuring Compilers: The Foundations. Kluwer Academic Publishers, 1993.

Ble75
W. W. Bledsoe. A new method for proving certain presburger formulas. In Advance Papers, 4th Int. Joint Conference on Artif. Intell., Tibilisi, Georgia, U.S.S.R, 1975.

Bra88
Thomas Brandes. The importance of direct dependences for automatic parallelism. In Proc of 1988 International Conference on Supercomputing, pages 407-417, July 1988.

CFR93
Jean-François Collard, Paul Feautrier, and Tanguy Risset. Construction of DO loops from systems of affine constraints. Technical Report Research Report N 93-15, Laboratoire de l'Informatique du Parallélisme, Ecolo Normal Supérieure de Lyon, Instiut IMAG, May 1993. Postscript available as lip.ens-lyon.fr:pub/LIP/RR/RR93/RR93-15.ps.Z.

CK92
Steve Carr and Ken Kennedy. Compiler blockability of numerical algorithms. In Proceedings Supercomputing'92, pages 114-125, Minneapolis, Minnesota, Nov 1992.

Col93
Jean-François Collard. Code generation in automatic parallelizers. Technical Report Research Report N 93-21, Laboratoire de l'Informatique du Parallélisme, Ecolo Normal Supérieure de Lyon, Instiut IMAG, July 1993. Postscript available as lip.ens-lyon.fr:pub/LIP/RR/RR93/RR93-21.ps.Z.

Coo72
D. C. Cooper. Theorem proving in arithmetic with multiplication. In B. Meltzer and D. Michie, editors, Machine Intelligence 7, pages 91-99. American Elsevier, New York, 1972.

DE73
G.B. Dantzig and B.C. Eaves. Fourier-Motzkin elimination and its dual. Journal of Combinatorial Theory (A), 14:288-297, 1973.

DGS93
Evelyn Duesterwald, Rajiv Gupta, and Mary Lou Soffa. A practical data flow framework for array reference analysis and its use in optimizations. In ACM '93 Conf. on Programming Language Design and Implementation, June 1993.

DR92a
Alain Darte and Yves Robert. Affine-by-statement scheduling: extensions for affine dependences and several parameters. Technical Report 92-03, Laboratoire de l'Informatique du Parallélisme, Ecolo Normal Supérieure de Lyon, Instiut IMAG, June 1992.

DR92b
Alain Darte and Yves Robert. Affine-by-statement scheduling of uniform loop nest over parametric domains. Technical Report 92-16, Laboratoire de l'Informatique du Parallélisme, Ecolo Normal Supérieure de Lyon, Instiut IMAG, April 1992.

DR92c
Alain Darte and Yves Robert. Scheduling uniform loop nests. Technical Report 92-10, Laboratoire de l'Informatique du Parallélisme, Ecolo Normal Supérieure de Lyon, Instiut IMAG, February 1992.

EHLP91
R. Eigenmann, J. Hoeflinger, Z. Li, and D. Padua. Experience in the automatic parallelization of 4 Perfect benchmark programs. In Proc. of the 4th Workshop on Programming Languages and Compilers for Parallel Computing, August 1991.

Eig92
Rudolf Eigenmann. Toward a methodology of optimizing programs for high-performance computers. CSRD Rpt. 1178, Dept. of Computer Science, University of Illinois at Urbana-Champaign, August 1992.

Fea88
Paul Feautrier. Array expansion. In ACM Int. Conf. on Supercomputing, St Malo, pages 429-441, 1988.

Fea91
Paul Feautrier. Dataflow analysis of array and scalar references. International Journal of Parallel Programming, 20(1), February 1991.

Fea92a
Paul Feautrier. Some efficient solutions to the affine scheduling problem, Part I, One-dimensional time. Int. J. of Parallel Programming, 21(5), Oct 1992.

Fea92b
Paul Feautrier. Some efficient solutions to the affine scheduling problem, Part II, Multidimensional time. Int. J. of Parallel Programming, 21(6), Dec 1992.

GKT91
G. Goff, Ken Kennedy, and Chau-Wen Tseng. Practical dependence testing. In ACM SIGPLAN'91 Conference on Programming Language Design and Implementation, 1991.

GS90
Thomas Gross and Peter Steenkiste. Structured dataflow analysis for arrays and its use in an optimizing compiler. Software - Practice and Experience, 20:133-155, February 1990.

HLL92
Tien Huynh, Catherine Lassez, and Jean-Louis Lassez. Practical issues on the projection of polyhedral sets. Annals of mathematics and artificial intelligence, November 1992.

IJT91
François Irigoin, Pierre Jouvelot, and Rémi Triolet. Semantical interprocedural parallelization: An overview of the pips project. In Proc. of the 1991 International Conference on Supercomputing, pages 244-253, June 1991.

KKB92
K. G. Kumar, D. Kulkarni, and A. Basu. Deriving good transformations for mapping nested loops on hieracical parallel machines in polynomial time. In Proc. of the 1992 International Conference on Supercomputing, pages 82-92, July 1992.

KP93a
Wayne Kelly and William Pugh. Determining schedules based on performance estimation. Technical Report CS-TR-3108, Dept. of Computer Science, University of Maryland, College Park, July 1993. to appear in Parallel Processing Letters (1994).

KP93b
Wayne Kelly and William Pugh. A framework for unifying reordering transformations. Technical Report CS-TR-3193, Dept. of Computer Science, University of Maryland, College Park, April 1993.

LHM89
Jean-Louis Lassez, Tien Huynh, and Ken McAloon. Simplification and elimination of redundant linear arithmetic constraints. In Proceedings of the North American Conference on Logic Programming, pages 37-51, 1989.

Li92
Zhiyuan Li. Array privatization for parallel execution of loops. In Proc. of the 1992 International Conference on Supercomputing, pages 313-322, July 1992.

LL92
Catherine Lassez and Jean-Louis Lassez. Quantifier elimination for conjunctions of linear constraints via a convex hull algorithm. In Bruce Donald, Deepak Kapur, and Joseph Mundy, editors, Symbolic and Numerical Computation for Artificial Intelligence. Academic Press, 1992.

LP92
Wei Li and Keshav Pingali. A singular loop transformation framework based on non-singular matrices. In 5th Workshop on Languages and Compilers for Parallel Computing, pages 249-260, Yale University, August 1992.

Lu91
Lee-Chung Lu. A unified framework for systematic loop transformations. In Proc. of the 3rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 28-38, April 1991.

MAL93
Dror E. Maydan, Saman P. Amarasinghe, and Monica S. Lam. Array data-flow analysis and its use in array privatization. In ACM '93 Conf. on Principles of Programming Languages, January 1993.

MHL91a
D. E. Maydan, J. L. Hennessy, and M. S. Lam. Effectiveness of data dependence analysis. In Proceedings of the NSF-NCRD Workshop on Advanced Compilation Techniques for Novel Architectures, 1991.

MHL91b
D. E. Maydan, J. L. Hennessy, and M. S. Lam. Efficient and exact data dependence analysis. In ACM SIGPLAN'91 Conference on Programming Language Design and Implementation, pages 1-14, June 1991.

Pol88
C. Polychronopoulos. Parallel Programming and Compilers. Kluwer Academic Publishers, 1988.

PP93
Paul M. Petersen and David A. Padua. Static and dynamic evaluation of data dependence analysis. In International Conference on Supercomputers, July 1993.

Pug91
William Pugh. Uniform techniques for loop optimization. In 1991 International Conference on Supercomputing, pages 341-352, Cologne, Germany, June 1991.

Pug92
William Pugh. The Omega test: a fast and practical integer programming algorithm for dependence analysis. Communications of the ACM, 8:102-114, August 1992.

PW86
D. A. Padua and M. J. Wolfe. Advanced compiler optimizations for supercomputers. Communications of the ACM, 29(12):1184-1201, December 1986.

PW93a
William Pugh and David Wonnacott. An evaluation of exact methods for analysis of value-based array data dependences. In Sixth Annual Workshop on Programming Languages and Compilers for Parallel Computing, Portland, OR, August 1993.

PW93b
William Pugh and David Wonnacott. Static analysis of upper and lower bounds on dependences and parallelism. ACM Transactions on Programming Languages and Systems, 1993. accepted for publication.

Ram92
J. Ramanujam. Non-unimodular transformations of nested loops. In Supercomputing `92, pages 214-223, November 1992.

Rib90
Hudson Ribas. Obtaining dependence vectors for nested-loop computations. In Proc of 1990 International Conference on Parallel Processing, pages II-212 - II-219, August 1990.

Ros90
Carl Rosene. Incremental Dependence Analysis. PhD thesis, Dept. of Computer Science, Rice University, March 1990.

Sho77
Robert E. Shostak. On the sup-inf method for proving presburger formulas. Journal of the ACM, 24(4):529-543, October 1977.

ST92
Vivek Sarkar and Radhika Thekkath. A general framework for iteration-reordering loop transformations. In ACM SIGPLAN'92 Conference on Programming Language Design and Implementation, pages 175-187, San Francisco, California, Jun 1992.

Tan93
Peiyi Tang. Exact side effects for interprocedure dependence analysis. In International Conference on Supercomputing, July 1993.

WL91
Michael E. Wolf and Monica S. Lam. A data locality optimizing algorithm. In ACM SIGPLAN'91 Conference on Programming Language Design and Implementation, 1991.

Wol89
Michael Wolfe. Optimizing Supercompilers for Supercomputers. Pitman Publishing, London, 1989.

Wol90
Michael Wolfe. Massive parallelism through program restructuring. In Symposium on Frontiers on Massively Parallel Computation, pages 407-415, October 1990.

Wol91
Michael Wolfe. The tiny loop restructuring research tool. In Proc of 1991 International Conference on Parallel Processing, pages II-46 - II-53, 1991.

WT92
M. J. Wolfe and C. Tseng. The Power test for data dependence. IEEE Transactions on Parallel and Distributed Systems, 3(5):591-601, September 1992.


omega@cs.umd.edu