2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) (2016)
Chicago, IL, USA
May 23, 2016 to May 27, 2016
Traditional automatic tuning systems are based on an exploration-exploitation tradeoff that consists of: learning the behavior of the algorithm to tune on several benchmarks (exploration) and then using the learned behavior for solving new problem instances. On NP-hard algorithms, this vision is questionable because of the potential huge runtime of the exploration phase. In this paper, we introduce QTuning, a new automatic tuning system specially designed for NP-hard algorithms. Like traditional tuning systems, QTuning uses benchmarks. But, during the learning process, new benchmark entries can always be introduced or existing ones removed. Moreover, the system mixes the exploration and exploitation phases. The main contribution of this paper is to formulate the learning process in QTuning within an active learning framework. The framework is based on a classical observation made in optimization: namely, the efficiency of random search in regret minimization. We improve our random search algorithm in including a machine learning classification approach and a set intersection problem. Finally, we discuss the experimental evaluation of the framework for the resolution of the satisfiability problem.
Tuning, Benchmark testing, Runtime, NP-hard problem, Algorithm design and analysis, Search problems, Heating,maximum subset intersection problem, automatic tuning, random search, active learning
Yanik Ngoko, Denis Trystram, Valentin Reis, Christophe Cerin, "An Automatic Tuning System for Solving NP-Hard Problems in Clouds", 2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), vol. 00, no. , pp. 1443-1452, 2016, doi:10.1109/IPDPSW.2016.68