Bibliography

1

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

2

F. Bodin, M. O'Boyle, A Compiler Strategy for Shared Virtual Memories, in B. K. Szymanski, B. Sinharoy (Eds.), Languages, Compilers and Run-Time Systems for Scalable Computers, Kluwer Academic Publishers, 1996, pp. 57-69.

3

P. Clauss, Counting Solutions to Linear and Nonlinear Constraints through Ehrhart polynomials: Applications to Analyze and Transform Scientific Programs, Proceedings of the 1996 International Conference on Supercomputing (Philadelphia, May 1996), ACM Press, pp. 278-285.

4

S. Flynn Hummel, E. Schonberg, L. E. Flynn, Factoring: A Method for Scheduling Parallel Loops, Communications of the ACM, 35 (8), Aug. 1992, pp. 90-101.

5

A. Gerasoulis, I. Nelken, Scheduling Linear Algebra Parallel Algorithms on MIMD Architectures, in J. Dongarra, P. Messina, D. C. Sorensen, R. G. Voigt (Eds.), Proceedings of the $4$th SIAM Conference on Parallel Processing for Scientific Computing, SIAM, 1989, pp. 68-95.

6

G. H. Golub, C. F. Van Loan, Matrix Computations, The Johns Hopkins University Press, 1989.

7

M. R. Haghighat, C. D. Polychronopoulos, Symbolic Analysis for Parallelizing Compilers, ACM Transactions on Programming Languages and Systems, 18 (4), July 1996, pp. 477-518.

8

W. Li, Compiler Optimizations for Cache Locality and Coherence, Technical Report 504, Department of Computer Science, University of Rochester, Apr. 1994.

9

D. J. Lilja, Exploiting the Parallelism Available in Loops, Computer, 27 (2), Feb. 1994, pp. 13-26.

10

C. D. Polychronopoulos, D. J. Kuck, Guided Self-Scheduling: A Practical Scheduling Scheme for Parallel Supercomputers, IEEE Transactions on Computers, 36 (12), Dec. 1987, pp. 1425-1439.

11

W. Pugh, Counting Solutions to Presburger Formulas: How and Why, Proceedings of the ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (Orlando, June 1994), ACM SIGPLAN Notices, 29 (6), June 1994, pp. 121-134; also available as Technical Report CS-TR-3234, Department of Computer Science, University of Maryland, Mar. 1994.

12

R. Sakellariou, On the Quest for Perfect Load Balance in Loop-Based Parallel Computations, PhD Thesis, Department of Computer Science, University of Manchester, U.K., 1996.

13

V. Sarkar, Partitioning and Scheduling Parallel Programs for Multiprocessors, Research Monographs in Parallel and Distributed Computing Series, MIT Press, 1989.

14

N. Tawbi, Estimation of Nested Loops execution time by Integer Arithmetic in Convex Polyhedra, Proceedings of the $8$th International Parallel Processing Symposium, IEEE Computer Society Press, 1994, pp. 217-221.

15

T. H. Tzen, L. M. Ni, Trapezoid Self-Scheduling: A Practical Scheduling Scheme for Parallel Computers, IEEE Transactions on Parallel and Distributed Systems, 4 (1), Jan. 1993, pp. 87-98.