Learning parallel portfolios of algorithms
- 80 Downloads
A wide range of combinatorial optimization algorithms have been developed for complex reasoning tasks. Frequently, no single algorithm outperforms all the others. This has raised interest in leveraging the performance of a collection of algorithms to improve performance. We show how to accomplish this using a Parallel Portfolio of Algorithms (PPA). A PPA is a collection of diverse algorithms for solving a single problem, all running concurrently on a single processor until a solution is produced. The performance of the portfolio may be controlled by assigning different shares of processor time to each algorithm. We present an effective method for finding a PPA in which the share of processor time allocated to each algorithm is fixed. Finding the optimal static schedule is shown to be an NP-complete problem for a general class of utility functions. We present bounds on the performance of the PPA over random instances and evaluate the performance empirically on a collection of 23 state-of-the-art SAT algorithms. The results show significant performance gains over the fastest individual algorithm in the collection.
KeywordsAlgorithm portfolios Resource bounded reasoning Combinatorial optimization
Mathematics Subject Classifications (2000)68T05 68T20
Unable to display preview. Download preview PDF.
- 2.Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Belmont, MA (2003)Google Scholar
- 3.Dean, T.L.: Intractability and time-dependent planning. In: Proceedings of the 1986 Workshop on Reasoning about Actions and Plans, pp. 245–266. Morgan Kaufmann, San Francisco, CA (1986)Google Scholar
- 7.Kautz, H., Selman, B.: Unifying SAT-based and graph-based planning. In: Proceedings of the 16th International Joint Conference on Artificial Intelligence, pp. 318–325 (1999)Google Scholar
- 8.Leyton-Brown, K., Nudelman, E., Andrew, G., McFadden, J., Shoham, Y.: Boosting as a metaphor for algorithm design. In: Proceedings of the Ninth International Conference on Principles and Practice of Constraint Programming, pp. 899–903 (2003)Google Scholar
- 12.Petrik, M.: Learning Parallel Portfolios of Algorithms. Master’s thesis, Comenius University, Bratislava, Slovakia (2005)Google Scholar
- 13.Simon, L.: The Sat-Ex Site. http://www.lri.fr/~simon/satex (2005)
- 14.Zilberstein, S.: Operational Rationality Through Compilation of Anytime Algorithms. Ph.D. Dissertation, University of California Berkley (1993)Google Scholar