Partitioning loops with variable dependence distances

Proceedings of the International Conference on Parallel Processing

Volumn 2000-January, Issue , 2000, Pages 209-218

  Yu, Yijun ^a   D'Hollander, E H ^a  

^a GHENT UNIVERSITY   (Belgium)

Author keywords

Contracts; Equations; Information systems; Lattices; Partitioning algorithms; Pattern recognition; Testing; Vectors

Indexed keywords

CONTRACTS; CRYSTAL LATTICES; INFORMATION SYSTEMS; PATTERN RECOGNITION SYSTEMS; TESTING; VECTORS;

ARRAY SUBSCRIPTS; DISTANCE MATRICES; EQUATIONS; LINEAR COMBINATIONS; LINEAR DEPENDENCE; LOOP TRANSFORMATION; PARTITIONING ALGORITHMS; VARIABLE DISTANCES;

PATTERN RECOGNITION;

EID: 84949511983     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2000.876124     Document Type: Conference Paper

References (20)

1. U. Banerjee. Unimodular transformations of double loops. In Advances in Languages and Compilers for Parallel Computing, 1990 Workshop, Research Monographs in Parallel and Distributed Computing, pages 192-219, Irvine, Calif., Aug. 1990. Cambridge, Mass.: MIT Press.
2. U. Banerjee. Loop Transformations for Restructuring Compilers: The Foundations. Norwell, Mass.: Kluwer Academic Publishers, 1993.
3. U. Banerjee. Loop Parallelization. Norwell, Mass.: Kluwer Academic Publishers, 1994.
4. W. Blume and R. Eigenmann. The range test: a dependence test for symbolic, non-linear expressions. In IEEE, editor, Proceedings, Supercomputing '94: Washington, DC, November 14-18, 1994, Supercomputing, pages 528-537. IEEE Computer Society Press, 1994.
5. E. D'Hollander, F. Zhang, and Q. Wang. The fortran parallel transformer and its programming environment. Journal of Information Sciences, 106:293-317, 1998.
6. E. H. D'Hollander. Partitioning and labeling of loops by unimodular transformations. IEEE Transactions on Parallel and Distributed Systems, 3(4):465-476, July 1992.
7. P. Feautrier. Some efficient solutions to the affine scheduling problem. I. one-dimensional time. International Journal of Parallel Programming, 21(5):313-347, Oct. 1992.
8. W. Kelly and W. Pugh. Minimizing communication while preserving parallelism. In ACM, editor, FCRC '96: Conference proceedings of the 1996 International Conference on Supercomputing: Philadelphia, Pennsylvania, USA, May 25-28, 1996, pages 52-60. ACM Press, 1996.
9. A. W. Lim and M. S. Lam. Maximizing parallelism and minimizing synchronization with affine partitions. Parallel Computing, 24(3-4):445-475, May 1998.
10. P. M. Petersen and D. A. Padua. Static and dynamic evaluation of data dependence analysis techniques:. IEEE Transactions on Parallel and Distributed Systems, 7(11):1121-1132, Nov. 1996.
11. K. Psarris. The Banerjee-Wolfe and GCD tests on exact data dependence information. Journal of Parallel and Distributed Computing, 32(2):119-138, Feb. 1996.
12. J. Ramanujam. Beyond unimodular transformations. Journal of Supercomputing, 9(4):365-389, Oct 1995.
13. A. Schrijver. Theory of Linear and Integer Programming. John Wiley and Sons, New York, 1987.
14. M. E. Wolf. Improving locality and parallelism in nested loops. Ph.D. Dissertation CSL-TR-92-538, Stanford University, Dept. Computer Science, Aug. 1992.
15. M. E. Wolf and M. S. Lam. A loop transformation theory and an algorithm to maximize parallelism. In IEEE Transactions on Parallel and Distributed Systems, Oct 1991.
16. M. Wolfe. Engineering a data dependence test. Concurrency: Practice and Experience, 5(7):603-622, Oct. 1993.
17. W.Shang, E.Hodzic, and Z.Chen. On uniformization of affine dependence algorithms. IEEETC: IEEE Transactions on Computers, 45(7):827-840, July 1996.
18. J. Xue. Automating non-unimodular loop transformations for massive parallelism. Parallel Comput., 20(5):711-728, 1994.
19. J. Xue. Unimodular transformations of non-perfectly nested loops. Parallel Computing, 22(12):1621-1645, Feb. 1997.
20. F.-B. Zhang. The FPT programming environment. Ph.D. dissertion ELIS-D096.073, University of Ghent, Dept. of Electronics and Information Systems, Ghent, Belgium, Sept. 1996.