Dynamically adapting tuple replication for managing availability in a shared data space

Giovanni Russello; Michel Chaudron; Maarten van Steen

doi:10.1007/11417019_8

Dynamically adapting tuple replication for managing availability in a shared data space

Giovanni Russello^*, Michel Chaudron, Maarten van Steen

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

12 Citations (Scopus)

Abstract

With its decoupling of processes in space and time, the shared data space model has proven to be a well-suited solution for developing distributed component-based systems. However, as in many distributed applications, functional and extra-functional aspects are still interwoven in components. In this paper, we address how shared data spaces can support separation of concerns. In particular, we present a solution that allows developers to merely specify performance and availability requirements for data tuples, while the underlying middle-ware evaluates various distribution and replication policies in order to select the one that meets these requirements best. Moreover, in our approach, the middleware continuously monitors the behavior of application and system components, and switches to different policies if this would lead to better results. We describe our approach, along with the design of a prototype implementation and its quantitative evaluation.

Original language	English
Title of host publication	Coordination Models and Languages
Subtitle of host publication	7th International Conference, COORDINATION 2005, Namur, Belgium, April 20-23, 2005. Proceedings
Editors	Jean-Marie Jacquet, Gian Pietro Picco
Place of Publication	Berlin, Heidelberg
Publisher	Springer
Pages	109-124
Number of pages	16
ISBN (Electronic)	978-3-540-32006-7
ISBN (Print)	978-3-540-25630-4
DOIs	https://doi.org/10.1007/11417019_8
Publication status	Published - 19 Sep 2005
Externally published	Yes
Event	7th International Conference on Coordination Models and Languages 2005 - Namur, Belgium Duration: 20 Apr 2005 → 23 Apr 2005 Conference number: 7

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	3454
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	7th International Conference on Coordination Models and Languages 2005
Abbreviated title	COORDINATION 2005
Country/Territory	Belgium
City	Namur
Period	20/04/05 → 23/04/05

Keywords

Fault tolerance
Adaptation module
Data space
Memory usage
Application developer

Access to Document

10.1007/11417019_8

Cite this

Russello, G., Chaudron, M., & van Steen, M. (2005). Dynamically adapting tuple replication for managing availability in a shared data space. In J-M. Jacquet, & G. P. Picco (Eds.), Coordination Models and Languages: 7th International Conference, COORDINATION 2005, Namur, Belgium, April 20-23, 2005. Proceedings (pp. 109-124). (Lecture Notes in Computer Science; Vol. 3454). Springer. https://doi.org/10.1007/11417019_8

Russello, Giovanni ; Chaudron, Michel ; van Steen, Maarten. / Dynamically adapting tuple replication for managing availability in a shared data space. Coordination Models and Languages: 7th International Conference, COORDINATION 2005, Namur, Belgium, April 20-23, 2005. Proceedings. editor / Jean-Marie Jacquet ; Gian Pietro Picco. Berlin, Heidelberg : Springer, 2005. pp. 109-124 (Lecture Notes in Computer Science).

@inproceedings{e09abd1028ff46b0867af754d335f86c,

title = "Dynamically adapting tuple replication for managing availability in a shared data space",

abstract = "With its decoupling of processes in space and time, the shared data space model has proven to be a well-suited solution for developing distributed component-based systems. However, as in many distributed applications, functional and extra-functional aspects are still interwoven in components. In this paper, we address how shared data spaces can support separation of concerns. In particular, we present a solution that allows developers to merely specify performance and availability requirements for data tuples, while the underlying middle-ware evaluates various distribution and replication policies in order to select the one that meets these requirements best. Moreover, in our approach, the middleware continuously monitors the behavior of application and system components, and switches to different policies if this would lead to better results. We describe our approach, along with the design of a prototype implementation and its quantitative evaluation.",

keywords = "Fault tolerance, Adaptation module, Data space, Memory usage, Application developer",

author = "Giovanni Russello and Michel Chaudron and {van Steen}, Maarten",

year = "2005",

month = sep,

day = "19",

doi = "10.1007/11417019_8",

language = "English",

isbn = "978-3-540-25630-4",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "109--124",

editor = "Jean-Marie Jacquet and Picco, {Gian Pietro}",

booktitle = "Coordination Models and Languages",

note = "7th International Conference on Coordination Models and Languages 2005, COORDINATION 2005 ; Conference date: 20-04-2005 Through 23-04-2005",

}

Russello, G, Chaudron, M & van Steen, M 2005, Dynamically adapting tuple replication for managing availability in a shared data space. in J-M Jacquet & GP Picco (eds), Coordination Models and Languages: 7th International Conference, COORDINATION 2005, Namur, Belgium, April 20-23, 2005. Proceedings. Lecture Notes in Computer Science, vol. 3454, Springer, Berlin, Heidelberg, pp. 109-124, 7th International Conference on Coordination Models and Languages 2005, Namur, Belgium, 20/04/05. https://doi.org/10.1007/11417019_8

Dynamically adapting tuple replication for managing availability in a shared data space. / Russello, Giovanni; Chaudron, Michel; van Steen, Maarten.

Coordination Models and Languages: 7th International Conference, COORDINATION 2005, Namur, Belgium, April 20-23, 2005. Proceedings. ed. / Jean-Marie Jacquet; Gian Pietro Picco. Berlin, Heidelberg : Springer, 2005. p. 109-124 (Lecture Notes in Computer Science; Vol. 3454).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Dynamically adapting tuple replication for managing availability in a shared data space

AU - Russello, Giovanni

AU - Chaudron, Michel

AU - van Steen, Maarten

N1 - Conference code: 7

PY - 2005/9/19

Y1 - 2005/9/19

N2 - With its decoupling of processes in space and time, the shared data space model has proven to be a well-suited solution for developing distributed component-based systems. However, as in many distributed applications, functional and extra-functional aspects are still interwoven in components. In this paper, we address how shared data spaces can support separation of concerns. In particular, we present a solution that allows developers to merely specify performance and availability requirements for data tuples, while the underlying middle-ware evaluates various distribution and replication policies in order to select the one that meets these requirements best. Moreover, in our approach, the middleware continuously monitors the behavior of application and system components, and switches to different policies if this would lead to better results. We describe our approach, along with the design of a prototype implementation and its quantitative evaluation.

AB - With its decoupling of processes in space and time, the shared data space model has proven to be a well-suited solution for developing distributed component-based systems. However, as in many distributed applications, functional and extra-functional aspects are still interwoven in components. In this paper, we address how shared data spaces can support separation of concerns. In particular, we present a solution that allows developers to merely specify performance and availability requirements for data tuples, while the underlying middle-ware evaluates various distribution and replication policies in order to select the one that meets these requirements best. Moreover, in our approach, the middleware continuously monitors the behavior of application and system components, and switches to different policies if this would lead to better results. We describe our approach, along with the design of a prototype implementation and its quantitative evaluation.

KW - Fault tolerance

KW - Adaptation module

KW - Data space

KW - Memory usage

KW - Application developer

UR - http://www.scopus.com/inward/record.url?scp=24644472592&partnerID=8YFLogxK

U2 - 10.1007/11417019_8

DO - 10.1007/11417019_8

M3 - Conference contribution

AN - SCOPUS:24644472592

SN - 978-3-540-25630-4

T3 - Lecture Notes in Computer Science

SP - 109

EP - 124

BT - Coordination Models and Languages

A2 - Jacquet, Jean-Marie

A2 - Picco, Gian Pietro

PB - Springer

CY - Berlin, Heidelberg

T2 - 7th International Conference on Coordination Models and Languages 2005

Y2 - 20 April 2005 through 23 April 2005

ER -

Russello G, Chaudron M, van Steen M. Dynamically adapting tuple replication for managing availability in a shared data space. In Jacquet J-M, Picco GP, editors, Coordination Models and Languages: 7th International Conference, COORDINATION 2005, Namur, Belgium, April 20-23, 2005. Proceedings. Berlin, Heidelberg: Springer. 2005. p. 109-124. (Lecture Notes in Computer Science). doi: 10.1007/11417019_8

Dynamically adapting tuple replication for managing availability in a shared data space

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this