1
A. I. Barvinok. Computing the Volume, Counting Integral Points,
and Exponential Sums. Discrete & Computational Geometry,
10-2, 1993, pp. 123-141.
2
A. J. C. Bik, H. A. G. Wijshoff. Iteration Space Partitioning.
In H. Liddell, A. Colbrook, B. Hertzberger, P. Sloot (Eds.)
High-Performance Computing and Networking, LNCS 1067,
Springer-Verlag, 1996, pp. 475-484.
3
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.
4
J. M. Bull. A hierarchical classification of overheads in
parallel programs. In I. Jelly, I. Gorton and P. Croll (eds.),
Software Engineering for Parallel and Distributed Systems,
Chapman & Hall, 1996, pp. 208-219.
5
P. Clauss. Counting Solutions to Linear and Nonlinear Constraints
through Ehrhart polynomials: Applications to Analyze and Transform
Scientific Programs. In Proceedings of the 1996 International
Conference on Supercomputing (Philadelphia, May 1996), ACM Press,
pp. 278-285.
6
M. E. Crovella, T. J. LeBlanc. Parallel Performance Prediction
Using Lost Cycles Analysis. In Proceedings of Supercomputing
'94 (Washington D. C., Nov. 1994), IEEE Computer Society Press,
pp. 600-609.
7
T. Fahringer. Estimating and Optimizing Performance for
Parallel Programs. IEEE Computer, 28-11, Nov. 1995,
pp. 47-56.
8
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.
9
M. R. Haghighat, C. D. Polychronopoulos. Symbolic Analysis:
A Basis for Parallelization, Optimization, and Scheduling of Programs.
In U. Banerjee, D. Gelernter, A. Nicolau, D. Padua (Eds.),
Languages and Compilers for Parallel Computing (6th International
Workshop, Aug. 1993), LNCS 768,
Springer-Verlag, 1994, pp. 567-585.
10
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.
11
D. J. Lilja. Exploiting the Parallelism Available in Loops.
IEEE Computer, 27-2, Feb. 1994, pp. 13-26.
12
C. D. Polychronopoulos. Parallel Programming and Compilers.
Kluwer Academic Publishers, 1988.
13
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.
14
W. Pugh. Counting Solutions to Presburger Formulas: How and Why.
In 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.
15
R. Sakellariou. On the Quest for Perfect Load Balance in
Loop-Based Parallel Computations. PhD Thesis, Department of
Computer Science, University of Manchester, 1996.
16
R. Sakellariou. A Compile-Time Partitioning Strategy for
Non-Rectangular Loop Nests. In Proceedings of the 
th
International Parallel Processing Symposium (Geneva, April 1997),
IEEE Computer Society Press, 1997, pp. 633-637.
17
N. Tawbi. Estimation of Nested Loops Execution Time by Integer
Arithmetic in Convex Polyhedra. In Proceedings of the 
th
International Parallel Processing Symposium, IEEE Computer Society
Press, 1994, pp. 217-221.
18
T. H. Tzen, L. M. Ni. Trapezoid Self-Scheduling: A Practical
Scheduling Scheme for Parallel Compilers. IEEE Transactions
on Parallel and Distributed Systems, 4-1, Jan. 1993,
pp. 87-98.
19
K.-Y. Wang. Precise Compile-Time Performance Prediction for
Superscalar-Based Computers. In Proceedings of the ACM
SIGPLAN '94 Conference on Programming Language Design and
Implementation (Orlando, June 1994), ACM SIGPLAN Notices,
29-6, June 1994, pp. 73-84.
20
M. Wolfe. High Performance Compilers for Parallel Computing.
Addison-Wesley, 1996.
