6 References

• [Bas03a] C. Bastoul, P. Feautrier. Improving data locality by chunking. CC’12 International Conference on Compiler Construction, LNCS 2622, pages 320-335, Warsaw, april 2003.
• [Bas03b] C. Bastoul. Efficient code generation for automatic parallelization and optimization. ISPDC’03 IEEE International Symposium on Parallel and Distributed Computing, pages 23-30, Ljubljana, october 2003.
• [Bas04] C. Bastoul. Code Generation in the Polyhedral Model Is Easier Than You Think. PACT’13 IEEE International Conference on Parallel Architecture and Compilation Techniques, pages 7-16, Juan-les-Pins, september 2004.
• [Bas11] C. Bastoul. A Specification and a Library for Data Exchange in Polyhedral Compilation Tools. Technical Report, Paris-Sud University, France, September 2011.
• [Fea92] P. Feautrier Some efficient solutions to the affine scheduling problem, part II: multidimensional time. International Journal of Parallel Programming, 21(6):389–420, December 1992.
• [Gri04] M. Griebl. Automatic parallelization of loop programs for distributed memory architectures. Habilitation Thesis. Facultät für Mathematik und Informatik, Universität Passau, 2004. http://www.infosun.fmi.uni-passau.de/cl/loopo/
• [Qui00] F. Quilleré, S. Rajopadhye, and D. Wilde. Generation of efficient nested loops from polyhedra. International Journal of Parallel Programming, 28(5):469-498, october 2000.
• [Wil93] Doran K. Wilde. A library for doing polyhedral operations. Technical Report 785, IRISA, Rennes, France, 1993.

This document was generated on August 20, 2013 using texi2html 5.0.