SMT-Based Planning Synthesis for Distributed System Reconfigurations

Abstract

Large distributed systems with an emphasis on adaptability are now considered a necessity in many domains, yet reconfiguration of these systems is still largely carried out in an ad hoc fashion, a process that is both inefficient and error-prone. In this paper, we tackle the planification problem for the reconfiguration of distributed systems in the component-based reconfiguration model Concerto. Specifically, given some tasks to execute and a desired final state of the system, we show how to compute a reconfiguration plan that guarantees satisfaction of inter-component dependencies and is also optimized for parallel execution. Our technique relies on an SMT solver to compute the required dependencies between components and ultimately schedule the reconfiguration. We illustrate the use of this technique on a variety of synthetic examples as well as a real use case in the context of an OpenStack system.

Dynamic Adaptation of Urgent Applications in the Edge-to-Cloud Continuum

“…In the literature planning and executing an adaptation is often referred as a reconfiguration problem: a reconfiguration language offers programming support to structure and expresses the actions to perform to change the system state; a reconfiguration engine executes and coordinates actions [14,13]; and a reconfiguration inference system automatically generates the set of actions to apply (the plan) [27] according to the current and target configurations as inputs. However, existing solutions are mainly centralized in the literature [15,4].…”

Component-based Distributed Software Reconfiguration:A Verification-oriented Survey

“…It is not clear whether the technique would scale to a more complex component model. A similar synthesis technique has been implemented based on an SMT solver, this time targeting the Concerto component model, and its semantics for inter-component dependencies and parallel execution of reconfigurations operations [111].…”

“…By nature, contributions related to Reo [91] focus on non-functional properties. In the case of the synthesis of a reconfiguration program, the constraints on the reconfiguration can include non-functional properties [84] and in Concerto [111], the execution time of the generated reconfiguration programs is optimised.…”

SeMaFoR - Self-Management of Fog Resources with Collaborative Decentralized Controllers

“…), the plan of each Fog area needs at some point to synchronize with the plans of other neighbor Fog areas. In the literature the inference of reconfiguration plans has been previously studied, notably in our previous work [33], however, as far as we know, a decentralized and synchronized plan among different controllers has never been explored.…”

“…Inferring a plan requires to solve a specific kind of scheduling problem [33]. Indeed, generating a program means finding the right order of instructions to move from the current state to the goal state.…”