Multi-dimensional incremental loop fusion for data locality

Proceedings of the International Conference on Application-Specific Systems, Architectures and Processors

Volumn 2003-January, Issue , 2003, Pages 17-27

  Verdoolaege, Sven ^a   Bruynooghe, Maurice ^a   Janssens, Gerda ^a   Catthoor, Francky ^a,b  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b CMOS Device Research Group   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; LINEAR TRANSFORMATIONS; MATHEMATICAL TRANSFORMATIONS;

AFFINE TRANSFORMATIONS; GLOBAL PROJECTS; GREEDY ALGORITHMS; LOOP TRANSFORMATION; MULTI DIMENSIONAL; MULTIPLE LOOPS; PROGRAM OPTIMIZATION; REALISTIC APPLICATIONS;

APPLICATION PROGRAMS;

EID: 47849126837     PISSN: 10636862     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASAP.2003.1212826     Document Type: Conference Paper

References (27)

1. K. Beyls and E. D'Hollander. Reuse distance as a metric for cache behavior. In IASTED conference on Parallel and Distributed Computing and Systems 2001 (PDCS01), pages 617-662, 2001.
2. P. Boulet, A. Darte, G.-A. Silber, and F. Vivien. Loop parallelization algorithms: From parallelism extraction to code generation. Parallel Computing, 24(3-4):421-444, 1998.
3. K. Danckaert. Loop transformations for data transfer and storage reduction on multiprocessor systems. PhD thesis, KU Leuven, 2001.
4. A. Darte. On the complexity of loop fusion. In IEEE PACT, pages 149-157, 1999.
5. A. Darte and G. Huard. Complexity of multi-dimensional loop alignment. In STAGS 2002. pages 179 191.
6. A. Darte and G. Huard. New results on array contraction. In ASAP 2002, pages 359-370.
7. A. Darte and Y. Robert. Affine-by-statement scheduling of uniform and affine loop nests over parametric domains. Journal of Parallel and Distributed Computing, 29(l):43-59, 1995.
8. A. Darte, G.-A. Silber, and F. Vivien. Combining retiming and scheduling techniques for loop parallelization and loop tiling. Parallel Processing Letters, 7(4):379-392, 1997.
9. A. Darte and F. Vivien. Optimal fine and medium grain parallelism detection in polyhedral reduced dependence graphs. International Journal of Parallel Programming, 25(6):447-496, 1997.
10. E. De Greef, F. Catthoor, and H. De Man. Memory size reduction through storage order optimization for embedded parallel multimedia applications. Parallel Computing, 23(12):1811-1837, 1997.
11. P. Feautrier. Some efficient solutions to the affine scheduling problem. Part I. One-dimensional time. International Journal of Parallel Programming, 21(5):313-348, Oct. 1992.
12. A. Fraboulet, G. Huard, and A. Mignotte. Loop Alignment for Memory Accesses Optimization. In Twelfth International Symposium on System Synthesis Proceedings (ISSS'99), pages 71-77. IEEE Computer Society Press, Nov. 1999.
13. M. Geigl. Parallelization of loop nests with general bounds in the polyhedron model. Master's thesis, Universität Passau, Mar. 1997.
14. R. Gonzales and M. Horowitz. Energy dissipation in general-purpose microprocessors. IEEE Journal of Solid-state Circuits, SC-31(9):1277-1283, Sept. 1996.
15. B. Gordon, E. Tsern, and T. H. Meng. Design of a low power video decompression chip set for portable applications. Journal of VLSI signal processing, 13(2-3):125-142, 1996.
16. M. T. Kandemir, J. Ramanujam, A. N. Choudhary, and P. Banerjee. A layout-conscious iteration space transformation technique. IEEE Transactions on Computers, 50(12):1321-1335, 2001.
17. K. Kennedy and K. S. McKinley. Maximizing loop parallelism and improving data locality via loop fusion and distribution. In LCPC'93, pages 301-320, 1993.
18. A. W. Lim and M. S. Lam. Maximizing parallelism and minimizing synchronization with affine transforms. In Proceedings of the Twenty-fourth Annual ACM Symposium on the Principles of Programming Languages, pages 201-214, Paris, France, 1997. ACM Press.
19. A. W. Lim, S.-W. Liao, and M. S. Lam. Blocking and array contraction across arbitrarily nested loops using affine partitioning. ACM SIGPLAN Notices, 36(7):103-112, 2001.
20. N. Manjikian and T. Abdelrahman. Fusion of loops for parallelism and locality. Technical Report CSRI-315, Computer Systems Research Institute, University of Toronto, Canada, Feb. 1995.
21. R. Olsen and G. Gao. Collective analysis and transformation of loop clusters. Technical Report ACAPS Technical Memo 24, McGill University, Apr. 1992.
22. F. Quilleré, S. Rajopadhye, and D. Wilde. Generation of efficient nested loops from polyhedra. In International Journal of Parallel Programming, vol 28, no 5, October 2000.
23. Y. Song, R. Xu, C. Wang, and Z. Li. Data locality enhancement by memory reduction. In International Conference on Super computing, pages 50-64, 2001.
24. M. van Swaaij, F. Franssen, F. Catthoor, and H. De Man. Automating high level control flow transformations for DSP memory management. In IEEE workshop on VLSI Signal Processing, Oct. 1992.
25. S. Verdoolaege, F. Catthoor, M. Bruynooghe, and G. Janssens. Feasibility of incremental translation. Report CW 348, Department of Computer Science, K.U. Leuven, Leuven, Belgium, Oct. 2002.
26. M. E. Wolf and M. S. Lam. A Data Locality Optimizing Algorithm. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'91). pages 30-44, June 1991.
27. Y.-Q. Yang, C. Ancourt, and F. Irigoin. Minimal data dependence abstractions for loop transformations. In Languages and Compilers for Parallel Computing, pages 201-216, 1994.