2011 IEEE International Parallel &Amp; Distributed Processing Symposium 2011
DOI: 10.1109/ipdps.2011.86
|View full text |Cite
|
Sign up to set email alerts
|

Online Adaptive Code Generation and Tuning

Abstract: Abstract-In this paper, we present a runtime compilation and tuning framework for parallel programs. We extend our prior work on our auto-tuner, Active Harmony, for tunable parameters that require code generation (for example, different unroll factors). For such parameters, our auto-tuner generates and compiles new code on-the-fly. Effectively, we merge traditional feedback directed optimization and just-in-time compilation. We show that our system can leverage available parallelism in today's HPC platforms by… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
56
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 61 publications
(56 citation statements)
references
References 21 publications
0
56
0
Order By: Relevance
“…The authors have created a framework that statically evaluates different "computation kernels" and compiler optimisation flags to find an optimum in terms of execution time. Their work is based on Active Harmony [6], which is a well known framework for static and dynamic tuning. The application can define a search space and retrieve new configurations to test from a central tuning server.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…The authors have created a framework that statically evaluates different "computation kernels" and compiler optimisation flags to find an optimum in terms of execution time. Their work is based on Active Harmony [6], which is a well known framework for static and dynamic tuning. The application can define a search space and retrieve new configurations to test from a central tuning server.…”
Section: Related Workmentioning
confidence: 99%
“…5 and the proposed implementation of the tool suite is discussed in Sect. 6. The results of first experiments applying dynamic tuning to a target application are presented in Sect.…”
Section: Introductionmentioning
confidence: 99%
“…Greedy Algorithm and Hill Climbing Cooper et al [21] use meta-heuristics to find the optimal compilation parameters while reducing the number of evaluations during search space exploration from 10000 to a single one using profiling data and estimated virtual execution Genetic Algorithm Sandrieser et al [88] obtain speedup of 23% for hyper-block formation Parallel Rank Ordering Tiwari and Hollingsworth [93] and Tiwari et al [92] use PRO for automatic tuning of compilation process and report 46% performance improvement compared to the original code [57,58,99] Determining the best partitioning strategy Assumes that for any two functions with similar features, the same partitioning strategy can be used [95] Determining loops that benefit from parallelization and their best scheduling policy Targets OpenMP loop constructs only. Uses profiling to detect loop candidates, which may significantly increase the compilation time [1,21] Adaptive tuning of the compilation process Profiling data needs to be collected to perform the virtual executions.…”
Section: Meta-heuristicsmentioning
confidence: 99%
“…The PTF offers a set of standard search algorithms, including exhaustive search, probabilistic random search, individual search, multi-objective genetic search, and Active Harmony's [33] Nelder-Mead Simplex algorithm. The search algorithms are dynamically loaded on request of tuning plugins.…”
Section: B Tuning Pluginsmentioning
confidence: 99%