TY - GEN
T1 - Automatic application deployment in the cloud
T2 - 26th International Conference on Concurrency Theory, CONCUR 2015
AU - Di Cosmo, Roberto
AU - Lienhardt, Michael
AU - Mauro, Jacopo
AU - Zacchiroli, Stefano
AU - Zavattaro, Gianluigi
AU - Zwolakowski, Jakub
N1 - Publisher Copyright:
© Roberto Di Cosmo, Michael Lienhardt, Jacopo Mauro, Stefano Zacchiroli, Gianluigi Zavattaro, and Jakub Zwolakowski; licensed under Creative Commons License CC-BY.
PY - 2015/8/1
Y1 - 2015/8/1
N2 - The problem of deploying a complex software application has been formally investigated in previous work by means of the abstract component model named Aeolus. As the problem turned out to be undecidable, simplified versions of the model were investigated in which decidability was restored by introducing limitations on the ways components are described. In this paper, we take an opposite approach, and investigate the possibility to address a relaxed version of the deployment problem without limiting the expressiveness of the component model. We identify three problems to be solved in sequence: (i) the verification of the existence of a final configuration in which all the constraints imposed by the single components are satisfied, (ii) the generation of a concrete configuration satisfying such constraints, and (iii) the synthesis of a plan to reach such a configuration possibly going through intermediary configurations that violate the non-functional constraints.
AB - The problem of deploying a complex software application has been formally investigated in previous work by means of the abstract component model named Aeolus. As the problem turned out to be undecidable, simplified versions of the model were investigated in which decidability was restored by introducing limitations on the ways components are described. In this paper, we take an opposite approach, and investigate the possibility to address a relaxed version of the deployment problem without limiting the expressiveness of the component model. We identify three problems to be solved in sequence: (i) the verification of the existence of a final configuration in which all the constraints imposed by the single components are satisfied, (ii) the generation of a concrete configuration satisfying such constraints, and (iii) the synthesis of a plan to reach such a configuration possibly going through intermediary configurations that violate the non-functional constraints.
KW - Automatic deployment
KW - Constraint programming
KW - Devops
KW - Planning
U2 - 10.4230/LIPIcs.CONCUR.2015.1
DO - 10.4230/LIPIcs.CONCUR.2015.1
M3 - Conference contribution
AN - SCOPUS:84958254962
T3 - Leibniz International Proceedings in Informatics, LIPIcs
SP - 1
EP - 16
BT - 26th International Conference on Concurrency Theory, CONCUR 2015
A2 - Aceto, Luca
A2 - de Frutos Escrig, David
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Y2 - 1 September 2015 through 4 September 2015
ER -