Can Search Algorithms Save Large-Scale Automatic Performance Tuning?
|Title||Can Search Algorithms Save Large-Scale Automatic Performance Tuning?|
|Publication Type||Conference Paper|
|Year of Publication||2010|
|Authors||Balaprakash, P, Wild, SM, Hovland, PD|
|Conference Name||Proceedings ICCS 2011 in Procedia Computer Science|
|Conference Location||Tsukuba, Japan|
Empirical performance optimization of computer codes using autotuners has received significant attention in recent years. Given the increased complexity of computer architectures and scientific codes, evaluating all possible code variants is prohibitively expensive for all but the simplest kernels. One way for autotuners to overcome this hurdle is through use of a search algorithm that finds high-performing code variants while examining relatively few variants. In this paper we examine the search problem in autotuning from a mathematical optimization perspective. As an illustration of the power and limitations of this optimization, we conduct an experimental study of several optimization algorithms on a number of linear algebra kernel codes. We find that the algorithms considered obtain performance gains similar to the optimal ones found by complete enumeration or by large random searches but in a tiny fraction of the computation time.