Advertisement

HAL: A Framework for the Automated Analysis and Design of High-Performance Algorithms

  • Christopher Nell
  • Chris Fawcett
  • Holger H. Hoos
  • Kevin Leyton-Brown
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6683)

Abstract

Sophisticated empirical methods drive the development of high-performance solvers for an increasing range of problems from industry and academia. However, automated tools implementing these methods are often difficult to develop and to use. We address this issue with two contributions. First, we develop a formal description of meta-algorithmic problems and use it as the basis for an automated algorithm analysis and design framework called the High-performance Algorithm Laboratory. Second, we describe HAL 1.0, an implementation of the core components of this framework that provides support for distributed execution, remote monitoring, data management, and analysis of results. We demonstrate our approach by using HAL 1.0 to conduct a sequence of increasingly complex analysis and design tasks on state-of-the-art solvers for SAT and mixed-integer programming problems.

Keywords

Design Procedure Automate Analysis Mixed Integer Programming Benchmark Instance Target Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla: Portfolio-based algorithm selection for SAT. JAIR 32, 565–606 (2008)zbMATHGoogle Scholar
  2. 2.
    Chiarandini, M., Fawcett, C., Hoos, H.H.: A modular multiphase heuristic solver for post enrollment course timetabling (extended abstract). In: PATAT (2008)Google Scholar
  3. 3.
    Hutter, F., Hoos, H.H., Leyton-Brown, K.: Automated configuration of mixed integer programming solvers. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 186–202. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  4. 4.
    Hoos, H.H.: Computer-aided design of high-performance algorithms. Technical Report TR-2008-16, University of British Columbia, Computer Science (2008)Google Scholar
  5. 5.
    Hoos, H.H., Stützle, T.: Stochastic Local Search—Foundations and Applications. Morgan Kaufmann Publishers, USA (2004)zbMATHGoogle Scholar
  6. 6.
    Hutter, F., Hoos, H.H., Stützle, T.: Automatic algorithm configuration based on local search. In: AAAI (2007)Google Scholar
  7. 7.
    Hutter, F., Hoos, H.H., Leyton-Brown, K., Stützle, T.: ParamILS: An automatic algorithm configuration framework. JAIR 36, 267–306 (2009)zbMATHGoogle Scholar
  8. 8.
    Ansótegui, C., Sellmann, M., Tierney, K.: A gender-based genetic algorithm for the automatic configuration of algorithms. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 142–157. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  9. 9.
    Nudelman, E., Leyton-Brown, K., Devkar, A., Shoham, Y., Hoos, H.H.: Understanding random SAT: Beyond the clauses-to-variables ratio. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 438–452. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  10. 10.
    Xu, L., Hoos, H.H., Leyton-Brown, K.: Hydra: Automatically configuring algorithms for portfolio-based selection. In: AAAI (2010)Google Scholar
  11. 11.
    Mittelmann, H.D., Pruessner, A.: A server for automated performance analysis of benchmarking data. Opt. Meth. Soft. 21(1), 105–120 (2006)CrossRefzbMATHGoogle Scholar
  12. 12.
    Balint, A., Gall, D., Kapler, G., Retz, R.: Experiment design and administration for computer clusters for SAT-solvers (EDACC). JSAT 7, 77–82 (2010)Google Scholar
  13. 13.
    Gamma, E., Helm, R., Johnson, R., Vlissides, J.: Design Patterns: Elements of Reusable Object-Oriented Software. Addison-Wesley, New York (1995)zbMATHGoogle Scholar
  14. 14.
    Kadioglu, S., Malitsky, Y., Sellmann, M., Tierney, K.: ISAC – Instance-specific algorithm configuration. In: ECAI (2010)Google Scholar
  15. 15.
    Babić, D.: Exploiting Structure for Scalable Software Verification. PhD thesis, University of British Columbia, Vancouver, Canada (2008)Google Scholar
  16. 16.
    Hutter, F., Babić, D., Hoos, H.H., Hu, A.: Boosting verification by automatic tuning of decision procedures. In: FMCAD (2007)Google Scholar
  17. 17.
    Hutter, F., Hoos, H.H., Leyton-Brown, K.: Sequential model-based optimization for general algorithm configuration (extended version). Technical Report TR-2010-10, University of British Columbia, Computer Science (2010)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Christopher Nell
    • 1
  • Chris Fawcett
    • 1
  • Holger H. Hoos
    • 1
  • Kevin Leyton-Brown
    • 1
  1. 1.University of British ColumbiaVancouverCanada

Personalised recommendations