%L eprints3574
%D 2016
%P 140-150
%S SEAMS '16
%T Symbolic Performance Adaptation
%B SEAMS '16. Proceedings of the 11th International Symposium on Software Engineering for Adaptive and Self-Managing Systems
%I ACM
%R doi:10.1145/2897053.2897060
%C New York, NY, USA
%O SCOPUS ID: 2-s2.0-84974603563
%A Emilio Incerto
%A Mirco Tribastone
%A Catia Trubiani
%X Quality-of-Service attributes such as performance and reliability heavily depend on the run-time conditions under which software is executed (e.g., workload fluctuation and resources availability). Therefore, it is important to design systems able to adapt their setting and behavior due to these run-time variabilities. In this paper we propose a novel approach based on queuing networks as the quantitative model to represent system configurations. To find a model that fits with continuous changes in run-time conditions we rely on an innovative combination of symbolic analysis and satisfiability modulo theory (SMT). Through symbolic analysis we represent all possible system configurations as a set of nonlinear real constraints. By formulating an SMT problem we are able to devise feasible system configurations at a small computational cost. We study the effectiveness and scalability of our approach on a three-tier web system featuring different levels of redundancy.
%K performance-based adaptation, queueing networks, satisfiability modulo theories, symbolic analysis