A machine learning approach to automatic production of compiler heuristics

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

Volumn 2443, Issue , 2002, Pages 41-50

  Monsifrot, Antoine ^a   Bodin, Francçois ^a   Quiniou, Reneé ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

Boosting; Compiler heuristics; Decision tree; Loop unrolling

Indexed keywords

AUTOMATIC GENERATION; BOOSTING; COMPILER HEURISTICS; COMPILER OPTIMIZATIONS; LOOP UNROLLING; MACHINE LEARNING APPROACHES; MICROPROCESSOR ARCHITECTURES; OPTIMIZATION HEURISTICS;

ARTIFICIAL INTELLIGENCE; COMPUTER ARCHITECTURE; DECISION TREES; LEARNING SYSTEMS;

PROGRAM COMPILERS;

EID: 84877962166     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-46148-5_5     Document Type: Article

References (13)

1. David Bailey. Nas kernel benchmark program, June 1988. http://www.netlib.org/benchmark/nas.
2. F. Bodin, Y. Mével, and R. Quiniou. A User Level Program Transformation Tool. In Proceedings of the International Conference on Supercomputing, pages 180-187, July 1998, Melbourne, Australia.
3. GNU Fortran Compiler. http://gcc.gnu.org/.
4. Standard Performance Evaluation Corporation. http://www.specbench.org/.
5. Jack W.Davidson and Sanjay Jinturkar. Aggressive Loop Unrolling in a Retargetable, Optimizing Compiler. In Compiler Construction, volume 1060 of Lecture Notes in Computer Science, pages 59-73. Springer, April 1996.
6. J. J. Dongarra and A. R. Hinds. Unrolling loops in FORTRAN. Software Practice and Experience, 9(3):219-226, March 1979.
7. IA-64. http://www.intel.com/design/Itanium/idfisa/index.htm.
8. A. Koseki, H. Komastu, and Y. Fukazawa. A Method for Estimating Optimal Unrolling Times for Nested Loops. In Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, 1997.
9. A. Monsifrot and F. Bodin. Computer Aided Hand Tuning (CAHT): "Applying Case-Based Reasoning to Performance Tuning". In Proceedings of the 15th ACM International Conference on Supercomputing (ICS-01), pages 196-203. ACM Press, June 17-21 2001, Sorrento, Italy.
10. Sreerama K. Murthy, Simon Kasif, and Steven Salzberg. A System for Induction of Oblique Decision Trees. Journal of Artificial Intelligence Research, 2:1-32, 1994.
11. Vivek Sarkar. Optimized Unrolling of Nested Loops. In Proceedings of the 14th ACM International Conference on Supercomputing (ICS-00), pages 153-166. ACM Press, May 2000.
12. UltraSPARC. http://www.sun.com/processors/UltraSPARC-II/.
13. C. Yu and D.B. Skillicorn. Parallelizing Boosting and Bagging. Technical report, Queen's University, Kingston, Ontario, Canada K7L 3N6, February 2001.