Tiling and memory reuse for sequences of nested loops

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

Volumn 2400, Issue , 2002, Pages 255-264

  Bouchebaba, Youcef ^a   Coelho, Fabien ^a  

^a PSL RESEARCH UNIVERSITY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE REUSABILITY;

CACHE MISS; ELECTRICAL ENERGY; LOOP FUSION; MEMORY HIERARCHY; MEMORY REUSE; NESTED LOOPS; OPTIMIZING COMPILERS; SIGNAL PROCESSING APPLICATIONS;

SIGNAL PROCESSING;

EID: 34250747282     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45706-2_34     Document Type: Conference Paper

References (17)

1. Youcef Bouchebaba and Fabien Coelho. Buffered tiling for sequences of loops nests. In Compilers and Operating Systems for Low Power 2001.
2. Youcef Bouchebaba and Fabien Coelho. Pavage pour une séquence de nids de boucles. To appear in Technique et science informatiques, 2000.
3. F. Cathoor, et al. Custom memory management methodology-Exploration of memory organisation for embedded multimedia system design. Kluwer Academic Publishers, 1998.
4. Alain Darte. On the complexity of loop fusion. Parallel Computing, 26(9):1175–1193, 2000.
5. Alain Darte and Guillaume Huard. Loop shifting for loop compaction. International Journal of Parallel Programming, 28(5):499–534, 2000.
6. C. Eisenbeis, W. Jalby, D. Windheiser, and F. Bodin. A strategy for array management in local memory. rapport de recherche 1262, INRIA, 1990.
7. Equipe PIPS. Pips (interprocedural parallelizer for scientific programs) http://www.cri.ensmp.fr/pips.
8. D. Gannon, W. Jalby, and K. Gallivan. Strategies for cache and local memory management by global program transformation. Journal of Parallel and Distibuted Computing, 5(10):587–616, 1988.
9. F. Irigoin and R. Triolet. Supernode partitioning. In Proceedings of 15th Annual ACM Symposium on Principles of Programming Languages, pages 319–329, San Diego, CA, 1988.
10. N. Museux. Aide au placement d’applications de traitement du signal sur machines paralléles multi-spmd. Phd thesis, École Nationale Supérieure des Mines de Paris, 2001.
11. W. Pughand E. Rosser. Iteration space slicing for locality. In LCPC99, pages 165–184, San Diego, CA, 1999.
12. F. Quilleré, S. Rajopadhye, and D. Wild. Generation of efficient nested loops from polyhedra. International journal of parallel programming, 28(5):496–498, 2000.
13. Fabien Quilleré and Sanjay Rajopadhye. Optimizing memory usage in the polyhedral model. Transactions on Programming Languages and Systems, 22(5):773–815, 2000.
14. M. Wolf, D. Maydan, and Ding-Kai Chen. Combining loop transformations considering caches and scheduling. International Journal of Parallel Programming, 26(4):479–503, 1998.
15. M. E. Wolf. Improving locality and parallelism in nested loops. Phd thesis, University of stanford, 1992.
16. J. Xue. On tiling as a loop transformation. Parallel Processing Letters, 7(4):409–424, 1997.
17. H. P. Zima and B. M. Chapman. Supercompilers for parallel and vector computers, volume 1. Addison-Wesley, 1990.