Reuse-driven tiling for data locality

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1366, Issue , 1998, Pages 16-33

  Xue, Jingling ^a   Huang, Chua Huang ^b  

^a UNIVERSITY OF NEW ENGLAND   (Australia)

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957893639     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0032681     Document Type: Conference Paper

References (29)

1. R. Andonov and S. Rajopadhye. Optimal filing of two-dimensional uniform recurrences. Technical Report 97-01, LIMAV, Université de Valenciennes, Jan. 1997.
2. P. Boulet, A. DaRe, T. Risset, and Y. Robert. (Pen)-ultimate tiling. Integration, the VLSI Journal, 17:33-51, 1994.
3. S. Cart and K. Kennedy. Compiler blockability of numerical algorithms. In Supercomputing '92, pages 114-124, Minneapolis, Minn., Nov. 1992.
4. S. Coleman and K. S. McKinley. Tile size selection using cache organization and data layout. In Prec. of the SIGPLAN'95 Confi Program Language Design and Implementation, pages 279-289, Jun. 1995.
5. K. Cooper, K. Kennedy, and N. Mclntosh. Cross-loop reuse analysis and its application to cache optimizations. In Proc. of the 9th Workshop on Languages and Compilers for Parallel Computing, Aug. 1996.
6. A. Darte and E Vivien. A comparison of nested loops parallelization algorithms. Technical Report 95-11, Ecole Normale Supérieure de Lyon, May. 1995.
7. A. Darte and E Vivien. Combining retiming and scheduling techniques for loop parallelization and loop filing. Technical Report 96-34, Ecole Normale Supérieure de Lyon, Nov. 1996.
8. A. Darte and E Vivien. Optimal fine and medium grain parallelism detection in polyhedral reduced dependence graphs. In Proc. of the 1996 International Conference on Parallel Architectures and Compilation Techniques, pages 281-291, Boston, MA, 1996.
9. M. E. Dyer and L. G. Proll. An algorithm for detennining all extreme points of a convex polytope. Mathematical Programming, 12:81-96, 1977.
10. K. Gallivan, W. Jalby, and D. Gannon. On the problem of optimizing data transfers for complex memory systems. In Supercomputing '88, pages 238-253. ACM Press, 1988.
11. G. R. Gao, V. Sarkar, and S. Han. Locality analysis for distributed shared-memory multiprocessors. In Proc. of the 9th Workshop on Languages and Compilers for Parallel Computing, Aug. 1996.
12. F. Irigoin. Loop reordering with dependence direction vectors. Technical Report EMP-CAII A/184, Ecole Nationale Supedeure des Mines de Paris, Nov. 1988.
13. E Irigoin and R. Triolet. Supemode partitioning. In Proc. of the 15th Annual ACM Symposium on Principles of Programming Languages, pages 319-329, San Diego, Jan. 1988.
14. M. S. Lam, E. E. Rothberg, and M. E. Wolf. The cache performance and optimizations of blocked algorithms. In Proc. of the 2nd International Conference on Architectural Support for Programming Languages and Operating Systems, pages 63-74, Santa Clara, Apr. 1991.
15. H. Le Verge. A note on chemikova's algorithm. Technical Report 635, IRISA (INRIARennes), Feb, 1992.
16. H. Ohta, Y Saito, M. Kainaga, and H. Ono. Optimal tile size adjustment in compiling for general DOACROSS loop nests. In 1995 ACM International Conference on Supercomputing, pages 270-279. ACM Press, 1995.
17. J. Ramanujam and P. Sadayappan. Tiling multidimensional iteration spaces for multicomputers. Z of Parallel and Distributed Computing, 16(2): 108-230, Oct. 1992.
18. R. Schreiber and J. J. Dongarra. Automatic blocking of nested loops. Technical Report 90.38, RIACS, May 1990.
19. A. Schrijver. Theory of Linear and Integer Programming. Series in Discrete Mathematics. John Wiley & Sons, 1986.
20. M. E. Wolf. Improving Locality and Parallelism in Nested Loops. PhD thesis, Stanford University, Mar. 1992.
21. M. E. Wolf and M. S. Lam. A data locality optimizing algorithm. In Proc. of the ACM SIGPLAN' 91 Conf, on Programming Language Design and Implementation. ACM, Jun. 1991.
22. M. E. Wolf and M. S. Lam. A loop transformation theory and an algorithm to maximize parallelism. IEEE Trans. on Parallel and Distributed Systems, 2(4):452-471, Oct. 1991.
23. M. J. Wolfe. More iteration space tiling. In Supercomputing '88, pages 655-664, Nov. 1989.
24. M. J. Wolfe. Optimizing Supercompilersfor Supercomputers. Research Monographs in Parallel and Distributed Computing. MIT Press, 1989.
25. M. J. Wolfe. High Performance Compilers for Parallel Computing. Addison-Wesley, 1996.
26. J. Xue. Automating non-unimodular loop transformations for massive parallelism. Parallel Computing, 20(5):711-728, 1994.
27. J. Xue. On tiling as a loop transformation. In Proc. of the SPDP Workshop on Challenges in Compiling for Scalable Parallel Systems, New Orleans, 1996. IEEE Computer Society Press.
28. J. Xue. Communication-minimal tiling of uniform dependence loops. Journal of Parallel and Distributed Computing, 42:42-59, 1997.
29. Y. Q. Yang, C. Ancourt, and E Irigoin. Minimal data dependence abstractions for loop transformations. In Proc. of the 7th Workshop on Languages and Compilers for Parallel Computing, Ithaca, Aug 1994.