New results on array contraction [memory optimization]

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

Volumn 2002-January, Issue , 2002, Pages 359-370

  Darte, A ^a   Huard, G ^a  

^a UNIV LYON   (France)

Author keywords

Circuits; Design optimization; Energy consumption; Hardware; Integer linear programming; Optimizing compilers; Prefetching; Registers

Indexed keywords

COMPUTER ARCHITECTURE; COMPUTER HARDWARE; ENERGY UTILIZATION; MEMORY ARCHITECTURE; NETWORKS (CIRCUITS); OPTIMIZATION; PROBLEM SOLVING; PROGRAM COMPILERS;

DESIGN OPTIMIZATION; INTEGER LINEAR PROGRAMMING; OPTIMIZING COMPILERS; PREFETCHING; REGISTERS;

INTEGER PROGRAMMING;

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

References (28)

1. E. Ayguadé, J. Garcia, and U. Kremer. Tools and techniques for automatic data layout: A case study. Parallel Computing, 24(3-4):557-578, 1998.
2. Pierre Boulet, Alain Darte, Georges-André Silber, and Frédéric Vivien. Loop parallelization algorithms: From parallelism extraction to code generation. Journal of Parallel Computing, 24(3), 1998. Special issue on Languages and Compilers for Parallel Computers.
3. R. Dahlhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, and M. Yannakakis. The complexity of multiway cuts. In ACM Symposium on the Theory of Computing, pages 241-251, Victoria, Canada, 1992.
4. Alain Darte. On the complexity of loop fusion. Parallel Computing, 26(9):1175-1193, July 2000.
5. Alain Darte and Guillaume Huard. Loop shifting for loop parallelization. Technical Report RR2000-22, LIP, ENS-Lyon, France, May 2000.
6. Alain Darte and Guillaume Huard. Complexity of multi-dimensional loop alignment. In 19th International Symposium on Theoretical Aspects of Computer Science, Juan-les-Pins, France, March 2002.
7. Alain Darte and Guillaume Huard. New results on array contraction. Technical Report RR2002-17, LIP, ENS-Lyon, France, April 2002.
8. G. Gao, R. Olsen, V. Sarkar, and R. Thekkath. Collective loop fusion for array contraction. In U. Banerjee, D. Gelernter, A. Nicolau, and D. A. Padua, editors, The 5th Workshop on Languages and Compiler for Parallelism, volume 757 of Lecture Notes in Computer Science, pages 281-295. Springer-Verlag, 1992.
9. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
10. Guillaume Huard. Algorithmique du décalage d'instructions (an algorithmic study of loop shifting). PhD thesis, École normale supérieure de Lyon, France, December 2001.
11. Mahmut Kandemir, Alok Choudhary, Nagaraj Shenoy, Prithviraj Banerjee, and J. Ramanujam. A linear algebra framework for automatic determination of optimal data layout. IEEE Transactions on Parallel and Distributed Systems, 10(2):115-135, February 1999.
12. Ken Kennedy and Kathryn McKinley. Typed fusion with applications to parallel and sequential code generation. Technical Report CRPC-TR94646, Center for Research on Parallel Computation, Rice University, 1994.
13. V. Lefebvre and P. Feautrier. Automatic storage management for parallel programs. Journal on Parallel Computing, 24:649-671, 1998.
14. C. E. Leiserson and J. B. Saxe. Optimizing synchronous systems. Journal of VLSI and Computer Systems, 1:41-67, 1983.
15. E. Christopher Lewis, Calvin Lin, and Lawrence Snyder. The implementation and evaluation of fusion and contraction in array languages. In ACM SIGPLAN'98 Conference on Programming Language Design and Implementation, pages 50-59, Montreal, 1998. ACM Press.
16. Amy Lim, Shih-Wei Liao, and Monica Lam. Blocking and array contraction across arbitrarily nested loops using affine partitioning. In Proceedings of the eighth ACM SIGPLAN symposium on Principles and Practice of Parallel Programming, pages 103-112, Snowbird, USA, 2001.
17. Vincent Loechner, Benoît Meister, and Philippe Clauss. Precise data locality optimization of nested loops. The Journal of Supercomputing, 21:37-76, 2002.
18. Kathryn S. McKinley and Ken Kennedy. Maximizing loop parallelism and improving data locality via loop fusion and distribution. In U. Banerjee, D. Gelernter, A. Nicolau, and D. A. Padua, editors, The Sixth Annual Languages and Compiler for Parallelism Workshop, number 768 in Lecture Notes in Computer Science, pages 301-320. Springer-Verlag, 1993.
19. Kathryn S. McKinley and Ken Kennedy. Maximizing loop parallelism and improving data locality via loop fusion and distribution. In U. Banerjee, D. Gelernter, A. Nicolau, and D. A. Padua, editors, The Sixth Annual Languages and Compiler for Parallelism Workshop, volume 768 of Lecture Notes in Computer Science, pages 301-320. Springer-Verlag, 1993.
20. Nimrod Megiddo and Vivek Sarkar. Optimal weighted loop fusion for parallel programs. In 9th annual ACM symposium on parallel algorithms and architectures (SPAA'97), pages 282-291, Newport, Rhode Island, 1997.
21. M. F. P O'Boyle and P. M. W Knijnenburg. Integrating loop and data transformations for global optimization. In International Conference on Parallel Architectures and Compilation Techniques, Paris, October 1998. IEEE Computer Society Press.
22. K. Pingali and A. Rogers. Compiling for locality. In Proc. International Conference Parallel Processing, pages 142-146, 1990.
23. V. Sarkar and G. Gao. Optimization of array accesses by collective loop transformations. In ACM International Conference on Supercomputing, pages 194-205, 1991.
24. Robert Schreiber, Shail Aditya, B. Ramakrishna Rau, Vinod Kathail, Scott Mahlke, Santosh Abraham, and Greg Snider. High-level synthesis of nonprogrammable hardware accelerators. In Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures, and Processors, pages 113-124, July 2000.
25. Sharad K. Singhai and Kathryn S. McKinley. A parameterized loop fusion algorithm for improving parallelism and cache locality. The Computer Journal, 40(6), 1997.
26. Yonghong Song, Rong Xu, Cheng Wang, and Zhiyuan Li. Data locality enhancement by memory reduction. In ACM International Conference on Supercomputing, pages 50-64, Sorrento, Italy, 2001. ACM Press.
27. M. E. Wolf and M. S. Lam. A data locality optimizing algorithm. In SIGPLAN Conference on Programming Language Design and Implementation, pages 30-44. ACM Press, 1991.
28. Michael Wolfe. High Performance Compilers for Parallel Computing. Addison-Wesley Publishing Company, 1996.