Automatic component deployment in the presence of circular dependencies

Tudor A. Lascu, Jacopo Mauro*, Gianluigi Zavattaro

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Abstract

In distributed systems like clouds or service oriented frameworks, applications are typically assembled by deploying and connecting a large number of heterogeneous software components, spanning from fine-grained packages to coarse-grained complex services. The complexity of such systems requires a rich set of techniques and tools to support the automation of their deployment process. By relying on a formal model of components, we describe a sound and complete algorithm for computing the sequence of actions allowing the deployment of a desired configuration. Moreover, differently from other proposals in the literature, our technique works even in the presence of circular dependencies among components. We give a proof for the polynomiality of the devised algorithm, thus guaranteeing efficiency and effectiveness of automatic tools for component deployment based on our algorithm.

Original languageEnglish
Title of host publicationFormal Aspects of Component Software - 10th International Symposium, FACS 2013, Revised Selected Papers
Number of pages19
PublisherSpringer
Publication date1. Jan 2014
Pages254-272
ISBN (Print)9783319076010
DOIs
Publication statusPublished - 1. Jan 2014
Externally publishedYes
Event10th International Symposium on Formal Aspects of Component Software, FACS 2013 - Nanchang, China
Duration: 27. Oct 201329. Oct 2013

Conference

Conference10th International Symposium on Formal Aspects of Component Software, FACS 2013
Country/TerritoryChina
CityNanchang
Period27/10/201329/10/2013
SeriesLecture Notes in Computer Science
Volume8348 LNCS
ISSN0302-9743

Fingerprint

Dive into the research topics of 'Automatic component deployment in the presence of circular dependencies'. Together they form a unique fingerprint.

Cite this