Self-control of the time complexity of a constraint satisfaction problem solver program

Abstract

This paper presents the self-controlling software paradigm and reports on its use to control the branch and bound based constraint satisfaction problem solving algorithm. In this paradigm, an algorithm is first conceptualized as a dynamical system and then a feedback control loop is added to control its behavior. The loop includes a Quality of Service component that assesses the performance of the algorithm during its run time and a controller that adjusts the parameters of the algorithm in order to achieve the control goal. Although other approaches – generally termed as “self-*” – make use of control loops, this use is limited to the structure of the software system, rather than to its behavior and its dynamics. This paper advocates the analysis of dynamics of any program with control loops. The self-controlling software paradigm is evaluated on two different NP-hard constraint satisfaction and optimization problems. The results of the evaluation show an improvement in the performance due to the added control loop for both of the tested constraint satisfaction problems. © 2012 Elsevier Inc. All rights reserved.

DOI: 10.1016/j.jss.2012.05.060

Extracted Key Phrases

7 Figures and Tables

Cite this paper

@article{Eracar2012SelfcontrolOT, title={Self-control of the time complexity of a constraint satisfaction problem solver program}, author={Y{\"{o}net A. Eracar and Mieczyslaw M. Kokar}, journal={Journal of Systems and Software}, year={2012}, volume={85}, pages={2697-2706} }