(Enter summary)
Abstract: Achieving high performance on modern processors heavily relies on the compiler optimizations to exploit the microprocessor architecture. (Update)
Cited by: More
Method-Specific Dynamic Compilation using Logistic Regression - John Cavazos Michael
(Correct)
Inducing Heuristics To Decide Whether To Schedule - John Cavazos University
(Correct)
Hybrid Optimizations: - Which Optimization Algorithm
(Correct)
Active bibliography (related documents): More All
0.5: Adaptive Java Optimisation Using Instance-Based Learning - Long, O'Boyle (2004)
(Correct)
0.1: Improving Data Locality by Array - Yonghong Song Rong
(Correct)
0.1: Implications of Memory Mapping on Cache Misses - Genius, Eisenbiegler (1997)
(Correct)
Similar documents based on text: More All
0.5: Causal Interaction: From a High-Level Representation.. - Grosclaude, Cordier..
(Correct)
0.3: Application of ILP to cardiac arrhythmia characterization for.. - Carrault (2001)
(Correct)
0.2: Skewed Associativity Enhances Performance Predictability - Bodin, Seznec (1995)
(Correct)
Related documents from co-citation: More All
6: Meta-optimization: Improving compiler heuristics with machine learning
- Stephenson, Amarasinghe et al. - 2002
4: Automatically characterizing large scale program behavior
- Sherwood, Perelman et al. - 2002
4: Optimizing for reduced code space using genetic algorithms
- Cooper, Schielke et al. - 1999
BibTeX entry: (Update)
A. Monsifrot, F. Bodin, and R. Quiniou. A Machine Learning Approach to Automatic Production of Compiler Heuristics. In Artificial Intelligence: Methodology, Systems, Applications, pages 41--50, 2002. http://citeseer.ist.psu.edu/monsifrot02machine.html More
@misc{ monsifrot02machine,
author = "A. Monsifrot and F. Bodin and R. Quiniou",
title = "A Machine Learning Approach to Automatic Production of Compiler Heuristics",
text = "A. Monsifrot, F. Bodin, and R. Quiniou. A Machine Learning Approach to
Automatic Production of Compiler Heuristics. In Artificial Intelligence:
Methodology, Systems, Applications, pages 41--50, 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/monsifrot02machine.html" }
Citations (may not include all citations):
136
A System for Induction of Oblique Decision Trees
- Murthy, Kasif et al. - 1994
19
Nas kernel benchmark program (context) - Bailey - 1988
19
Software Practice and Experience (context) - Dongarra, Hinds et al. - 1979
6
A User Level Program Transformation To ol (context) - Bodin, Mevel et al. - 1998
6
Aggressive Loop Unrolling in a Retargetable (context) - Davidson, Jinturkar - 1996
6
Optimized Unrolling of Nested Loops (context) - Sarkar - 2000
2
Applying Case-Based Reasoning to Performance Tuning (context) - Monsifrot, Bodin et al. - 2001
1
A Method for Estimating Optimal Unrolling Times for Nested L.. (context) - Koseki, Komastu et al. - 1997
1
Parallelizing Boosting and Bagging
- Yu, Skillicorn - 2001
http://gcc.gnu.org/
http://www.intel.com/design/Itanium/idfisa/index.htm
http://www.sun.com/processors/UltraSPARC-II/
http://www.specbench.org/
Documents on the same site (http://www.cs.ucsb.edu/~ckrintz/papers/): More
NWSLite: A Non-Parametric Prediction Utility for.. - Gurun, Krintz, Wolski
(Correct)
Efficient Representation and Validation of Proofs - Necula, Lee (1998)
(Correct)
Automatic Inference of Models for Statistical Code Compression - Fraser (1999)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC