An experimental evaluation of self-managing availability in shared data spaces

G. Russello, M.R.V. Chaudron, M. Steen, van, I. Bokharouss

Research output: Contribution to journalArticleAcademicpeer-review

9 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 the separation of concerns. In particular, we present a solution that allows developers to merely specify availability requirements for data tuples, while the underlying middleware 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 languageEnglish
Pages (from-to)246-262
JournalScience of Computer Programming
Volume64
Issue number2
DOIs
Publication statusPublished - 2007

Fingerprint

Middleware
Availability
Switches

Cite this

Russello, G. ; Chaudron, M.R.V. ; Steen, van, M. ; Bokharouss, I. / An experimental evaluation of self-managing availability in shared data spaces. In: Science of Computer Programming. 2007 ; Vol. 64, No. 2. pp. 246-262.
@article{6e19d2d34f984693a2dc58d7a5914a78,
title = "An experimental evaluation of self-managing availability in shared data spaces",
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 the separation of concerns. In particular, we present a solution that allows developers to merely specify availability requirements for data tuples, while the underlying middleware 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.",
author = "G. Russello and M.R.V. Chaudron and {Steen, van}, M. and I. Bokharouss",
year = "2007",
doi = "10.1016/j.scico.2006.06.007",
language = "English",
volume = "64",
pages = "246--262",
journal = "Science of Computer Programming",
issn = "0167-6423",
publisher = "Elsevier",
number = "2",

}

An experimental evaluation of self-managing availability in shared data spaces. / Russello, G.; Chaudron, M.R.V.; Steen, van, M.; Bokharouss, I.

In: Science of Computer Programming, Vol. 64, No. 2, 2007, p. 246-262.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - An experimental evaluation of self-managing availability in shared data spaces

AU - Russello, G.

AU - Chaudron, M.R.V.

AU - Steen, van, M.

AU - Bokharouss, I.

PY - 2007

Y1 - 2007

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 the separation of concerns. In particular, we present a solution that allows developers to merely specify availability requirements for data tuples, while the underlying middleware 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 the separation of concerns. In particular, we present a solution that allows developers to merely specify availability requirements for data tuples, while the underlying middleware 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.

U2 - 10.1016/j.scico.2006.06.007

DO - 10.1016/j.scico.2006.06.007

M3 - Article

VL - 64

SP - 246

EP - 262

JO - Science of Computer Programming

JF - Science of Computer Programming

SN - 0167-6423

IS - 2

ER -