Filters








305,943 Hits in 3.5 sec

Finding effective compilation sequences

L. Almagor, Keith D. Cooper, Alexander Grosul, Timothy J. Harvey, Steven W. Reeves, Devika Subramanian, Linda Torczon, Todd Waterman
2004 SIGPLAN notices  
Our findings indicate that for the cost of 200 to 4,550 compilations, we can find custom sequences that are 15 to 25% better than the human-designed fixed-sequence originally used in our compiler.  ...  Finding an optimal programspecific compilation sequence is difficult because the space of potential sequences is huge and the interactions between optimizations are poorly understood.  ...  The people who have worked in the Scalar Compiler Group at Rice over the years have put together a system that uniquely positioned us to pursue this research.  ... 
doi:10.1145/998300.997196 fatcat:ono75oigtjclpmuojo57hav2b4

Finding Effective Compiler Optimization Sequences: A Hybrid Approach

Nilton Luiz Queiroz Junior, Anderson Faustino da Silva, Luis Gustavo Araujo Rodriguez
2020 Computing and informatics  
In addition, the hybrid approach outperforms the best compiler optimization level of LLVM.  ...  This paper proposes a hybrid approach that combines the best of machine learning and iterative compilation.  ...  Therefore, these new sequences can be used for recent programs either after: feeding the knowledge base; compiler processing, or finding sequences for batch programs.  ... 
doi:10.31577/cai_2020_6_1117 fatcat:zijjdgognjf5nfbbwfjwq7vdfq

Finding effective optimization phase sequences

Prasad Kulkarni, Wankang Zhao, Hwashin Moon, Kyunghwan Cho, David Whalley, Jack Davidson, Mark Bailey, Yunheung Paek, Kyle Gallivan
2003 Proceedings of the 2003 ACM SIGPLAN conference on Language, compiler, and tool for embedded systems - LCTES '03  
In this paper,w ed escribe support in VISTA, an interactive compilation system, for finding effective sequences of optimization phases.  ...  Weh av e included a number of experimental results that evaluate the effectiveness of using a genetic algorithm in VISTA to find effective optimization phase sequences.  ...  Using a genetic algorithm to find effective optimization phase sequences can result in thousands of sequences being applied.  ... 
doi:10.1145/780732.780735 dblp:conf/lctrts/KulkarniZMCWDBPG03 fatcat:tfcvwmafz5emddoa5s2ehiki6m

Finding effective optimization phase sequences

Prasad Kulkarni, Wankang Zhao, Hwashin Moon, Kyunghwan Cho, David Whalley, Jack Davidson, Mark Bailey, Yunheung Paek, Kyle Gallivan
2003 Proceedings of the 2003 ACM SIGPLAN conference on Language, compiler, and tool for embedded systems - LCTES '03  
In this paper, we describe support in VISTA, an interactive compilation system, for finding effective sequences of optimization phases.  ...  We hav e included a number of experimental results that evaluate the effectiveness of using a genetic algorithm in VISTA to find effective optimization phase sequences.  ...  Initially it was not obvious how to best assess VISTA' s ability to find effective optimization sequences as compared to the batch VPO compiler.  ... 
doi:10.1145/780733.780735 fatcat:xhbfchesbrc3rdnqj4qqg7qzea

Fast searches for effective optimization phase sequences

Prasad Kulkarni, Stephen Hines, Jason Hiser, David Whalley, Jack Davidson, Douglas Jones
2004 Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation - PLDI '04  
In this paper we describe two complementary general approaches for achieving faster searches for effective optimization sequences when using a genetic algorithm.  ...  While such searches have been shown to produce more efficient code, the approach can be extremely slow because the application is compiled and executed to evaluate each sequence's effectiveness.  ...  Third, we describe methods for reducing the overhead of the searches for effective sequences. Fourth, we discuss techniques for finding effective sequences in fewer generations.  ... 
doi:10.1145/996841.996863 dblp:conf/pldi/KulkarniHHWDJ04 fatcat:6beaa7tmmvcjpnrzd26up3x72a

Fast searches for effective optimization phase sequences

Prasad Kulkarni, Stephen Hines, Jason Hiser, David Whalley, Jack Davidson, Douglas Jones
2004 SIGPLAN notices  
In this paper we describe two complementary general approaches for achieving faster searches for effective optimization sequences when using a genetic algorithm.  ...  While such searches have been shown to produce more efficient code, the approach can be extremely slow because the application is compiled and executed to evaluate each sequence's effectiveness.  ...  Third, we describe methods for reducing the overhead of the searches for effective sequences. Fourth, we discuss techniques for finding effective sequences in fewer generations.  ... 
doi:10.1145/996893.996863 fatcat:2ofhgrhf3jhv3guym4cyphg2wu

Finding effective optimization phase sequences

Prasad Kulkarni, Wankang Zhao, Hwashin Moon, Kyunghwan Cho, David Whalley, Jack Davidson, Mark Bailey, Yunheung Paek, Kyle Gallivan
2003 SIGPLAN notices  
In this paper, we describe support in VISTA, an interactive compilation system, for finding effective sequences of optimization phases.  ...  We hav e included a number of experimental results that evaluate the effectiveness of using a genetic algorithm in VISTA to find effective optimization phase sequences.  ...  Initially it was not obvious how to best assess VISTA' s ability to find effective optimization sequences as compared to the batch VPO compiler.  ... 
doi:10.1145/780731.780735 fatcat:ys3xk7kadbf57fzcnjb3dgj3ji

Fast and efficient searches for effective optimization-phase sequences

Prasad A. Kulkarni, Stephen R. Hines, David B. Whalley, Jason D. Hiser, Jack W. Davidson, Douglas L. Jones
2005 ACM Transactions on Architecture and Code Optimization (TACO)  
In this paper, we describe two complementary general approaches for achieving faster searches for effective optimization sequences when using a genetic algorithm.  ...  While such searches have been shown to produce more efficient code, the approach can be extremely slow because the application is compiled and possibly executed to evaluate each sequence's effectiveness  ...  Thus, finding effective sequences to tune an embedded application may result in an intolerably long search time.  ... 
doi:10.1145/1071604.1071607 fatcat:cdzzpvwoqzdsphzt7lpwk7dcoe

Performance potential of optimization phase selection during dynamic JIT compilation

Michael R. Jantz, Prasad A. Kulkarni
2013 SIGPLAN notices  
We conduct experiments to find and understand the potency of the factors that can cause the phase selection problem in JIT compilers.  ...  While these heuristics improve program startup speed, steady-state performance was not seen to benefit over the default fixed single sequence baseline.  ...  Earlier research has demonstrated that genetic algorithms (GA) are highly effective at finding near-optimal phase sequences [17] .  ... 
doi:10.1145/2517326.2451539 fatcat:2zjef6rijbfxdio47s6u26ppze

Performance potential of optimization phase selection during dynamic JIT compilation

Michael R. Jantz, Prasad A. Kulkarni
2013 Proceedings of the 9th ACM SIGPLAN/SIGOPS international conference on Virtual execution environments - VEE '13  
We conduct experiments to find and understand the potency of the factors that can cause the phase selection problem in JIT compilers.  ...  While these heuristics improve program startup speed, steady-state performance was not seen to benefit over the default fixed single sequence baseline.  ...  Earlier research has demonstrated that genetic algorithms (GA) are highly effective at finding near-optimal phase sequences [17] .  ... 
doi:10.1145/2451512.2451539 dblp:conf/vee/JantzK13 fatcat:fu56sg2ky5dzpk57x2cgaoyfqy

Exploring the structure of the space of compilation sequences using randomized search algorithms

Keith D. Cooper, Alexander Grosul, Timothy J. Harvey, Steve Reeves, Devika Subramanian, Linda Torczon, Todd Waterman
2006 Journal of Supercomputing  
Modern optimizing compilers apply a fixed sequence of optimizations, which we call a compilation sequence, to each program that they compile.  ...  We have shown, as have others, that program-specific sequences can produce better results than any single universal sequence [1, 23, 7, 10, 21] Our adaptive compiler looks for compilation sequences in  ...  We have little theoretical understanding of the effect of a given compilation sequence on the properties of the compiled code that it produces.  ... 
doi:10.1007/s11227-006-7954-5 fatcat:v3uulm6lbff4hn7on546zflvge

Improving both the performance benefits and speed of optimization phase sequence searches

Prasad A. Kulkarni, Michael R. Jantz, David B. Whalley
2010 Proceedings of the ACM SIGPLAN/SIGBED 2010 conference on Languages, compilers, and tools for embedded systems - LCTES '10  
the phase sequences that are most effective for each application.  ...  Compiler writers and embedded systems developers have recently addressed this problem by conducting iterative empirical searches using machine-learning based heuristic algorithms in an attempt to find  ...  In the next section, we discuss previous research related to automatically finding effective phase sequences in optimizing compilers.  ... 
doi:10.1145/1755888.1755903 dblp:conf/lctrts/KulkarniJW10 fatcat:utrsk7ef7zbkli5zfp2lqra43a

Improving both the performance benefits and speed of optimization phase sequence searches

Prasad A. Kulkarni, Michael R. Jantz, David B. Whalley
2010 SIGPLAN notices  
the phase sequences that are most effective for each application.  ...  Compiler writers and embedded systems developers have recently addressed this problem by conducting iterative empirical searches using machine-learning based heuristic algorithms in an attempt to find  ...  In the next section, we discuss previous research related to automatically finding effective phase sequences in optimizing compilers.  ... 
doi:10.1145/1755951.1755903 fatcat:yvpgcyp6znb4hgj63sogqhsl2e

Finding the limit

Yufei Ding, Mingzhou Zhou, Zhijia Zhao, Sarah Eisenstat, Xipeng Shen
2014 Proceedings of the 19th international conference on Architectural support for programming languages and operating systems - ASPLOS '14  
This work aims to find out the full potential of compilation scheduling for JIT-based runtime systems.  ...  Compilation scheduling determines the order in which the compilation units (e.g., functions) in a program are to be compiled or recompiled.  ...  Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation or DOE.  ... 
doi:10.1145/2541940.2541945 dblp:conf/asplos/DingZZES14 fatcat:imnmcjsv3bhlboxan5fxgwwafi

VISTA

Prasad Kulkarni, Baosheng Cai, Mark Bailey, Hwashin Moon, Kyunghwan Cho, Yunheung Paek, Wankang Zhao, Stephen Hines, David Whalley, Xin Yuan, Robert van Engelen, Kyle Gallivan (+2 others)
2006 ACM Transactions on Embedded Computing Systems  
VISTA also provides support for finding effective sequences of optimization phases.  ...  We include a number of experimental results that evaluate the effectiveness of using a genetic algorithm in VISTA to find effective optimization phase sequences.  ...  Sixth, VISTA provides the ability to find effective optimization sequences automatically.  ... 
doi:10.1145/1196636.1196640 fatcat:hzk6oycwm5atfk7gwypgpne2oe
« Previous Showing results 1 — 15 out of 305,943 results