Constraints

, Volume 21, Issue 1, pp 77–94

Visual search tree profiling

  • Maxim Shishmarev
  • Christopher Mears
  • Guido Tack
  • Maria Garcia de la Banda
Article

DOI: 10.1007/s10601-015-9202-1

Cite this article as:
Shishmarev, M., Mears, C., Tack, G. et al. Constraints (2016) 21: 77. doi:10.1007/s10601-015-9202-1

Abstract

Understanding how the search space is explored for a given constraint problem – and how it changes for different models, solvers or search strategies – is crucial for efficient solving. Yet programmers often have to rely on the crude aggregate measures of the search that are provided by solvers, or on visualisation tools that can show the search tree, but do not offer sophisticated ways to navigate and analyse it, particularly for large trees. We present an architecture for profiling a constraint programming search that is based on a lightweight instrumentation of the solver. The architecture combines a visualisation of the search tree with various tools for convenient navigation and analysis of the search. These include identifying repeated subtrees, high-level abstraction and navigation of the tree, and the comparison of two search trees. The resulting system is akin to a traditional program profiler, which helps the user to focus on the parts of the execution where an improvement to their program would have the greatest effect.

Keywords

Constraint programming Search tree Profiling Comparison Visualisation 

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  • Maxim Shishmarev
    • 1
  • Christopher Mears
    • 1
  • Guido Tack
    • 1
    • 2
  • Maria Garcia de la Banda
    • 1
    • 2
  1. 1.Faculty of ITMonash UniversityMelbourneAustralia
  2. 2.National ICT Australia (NICTA) VictoriaMelbourneAustralia

Personalised recommendations