Reuse-Driven Tiling for Improving Data Locality

International Journal of Parallel Programming

Volumn 26, Issue 6, 1998, Pages 671-696

  Xue, Jingling ^a   Huang, Chua Huang ^b  

^a UNIVERSITY OF NEW ENGLAND   (Australia)

^b NATIONAL DONG HWA UNIVERSITY   (Taiwan)

Author keywords

Data locality; Loop transformation; Nested loops; Tiling

Indexed keywords

DATA LOCALITY; LOOP TRANSFORMATION; NESTED LOOPS; TILING;

COMPUTER SYSTEMS PROGRAMMING; DATA STORAGE EQUIPMENT; OPTIMIZATION; PARALLEL ALGORITHMS;

STORAGE ALLOCATION (COMPUTER);

EID: 0032315190     PISSN: 08857458     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1018734612524     Document Type: Article

References (18)

1. M. J. Wolfe, High Performance Compilers for Parallel Computing, Addison-Wesley (1996).
2. M. E. Wolf and M. S. Lam, A Data Locality Optimizing Algorithm, Proc. ACM SIGPLAN'91 Conf. Progr. Lang. Design and Implementation, ACM (June 1991).
3. M. J. Wolfe, More Iteration Space Tiling, Supercomputing '88, pp. 655-664 (November 1989).
4. M. E. Wolf and M. S. Lam, A Loop Transformation Theory and an Algorithm to Maximize Parallelism, IEEE Trans. Parallel Distrib. Syst., 2(4):452-471 (October 1991).
5. A. Schrijver, Theory of Linear and Integer Programming, Series in Discrete Mathematics, John Wiley (1986).
6. F. Irigoin, Loop Reordering with Dependence Direction Vectors, Technical Report EMP-CAI-I A/184, Ecole Nationale Superieure des Mines de Paris (November 1988).
7. M. E. Dyer and L. G. Proll, An Algorithm for Determining All Extreme Points of a Convex Polytope, Math. Progr., 12:81-96 (1977).
8. H. Le Verge, A Note on Chernikova's Algorithm, Technical Report 635, IRISA (INRIA-Rennes) (February 1992).
9. J. Xue, Communication-Minimal Tiling of Uniform Dependence Loops, J. Parallel Distrib. Computing, 42(1):42-59 (1997).
10. A. Darte and F. Vivien, A Comparison of Nested Loops Parallelization Algorithms, Technical Report 95-11, Ecole Normale Supérieure de Lyon (May 1995).
11. F. Irigoin and R. Triolet, Supernode Partitioning Proc. 15th Ann. ACM Symp. Principles of Progr. Lang., San Diego, California, pp. 319-329 (January 1988).
12. J. Xue, On Tiling as a Loop Transformation, Parallel Processing Letters, 7(4):409-424 (1997).
13. A. Darte and F. Vivien, Optimal Fine and Medium Grain Parallelism Detection in Polyhedral Reduced Dependence Graphs, Proc. Intl. Conf. Parallel Architectures and Compilation Techniques, Boston, Massachusetts, pp. 281-291 (1996).
14. Y. Q. Yang, C. Ancourt, and F. Irigoin, Minimal Data Dependence Abstractions for Loop Transformations, Proc. seventh Workshop on Languages and Compilers for Parallel Computing, Ithaca (August 1994).
15. A. Darte and F. Vivien, Combining Retiming and Scheduling Techniques for Loop Parallelization and Loop Tiling, Technical Report 96-34, Ecole Normale Supérieure de Lyon (November 1996).
16. P. Boulet, A. Darte, T. Risset, and Y. Robert, (Pen)-Ultimate Tiling, Integration, the VLSI Journal, 17:33-51 (1994).
17. J. Ramanujam and P. Sadayappan, Tiling Multidimensional Iteration Spaces for Multicomputers, J. Parallel and Distributed Computing 16(2): 108-230 (October 1992).
18. H. Ohta, Y. Saito, M. Kainaga, and H. Ono, Optimal Tile Size Adjustment in Compiling for General DOACROSS Loop Nests, ACM Intl. Conf. Supercomputing, ACM Press, pp. 270-279 (1995).