2008 23rd IEEE/ACM International Conference on Automated Software Engineering - Workshops 2008
DOI: 10.1109/asew.2008.4686289
|View full text |Cite
|
Sign up to set email alerts
|

Building autonomic components: The SelfLets approach

Abstract: Autonomic computing is an emergent field aiming at the development of large-scale, self-managing, distributed component-based systems. This paper presents the model and the architecture of an autonomic computing element called SelfLet, which is a building component that can be used to create autonomic systems. SelfLets can be defined by specifying their goal, behaviors, services they need to use and/or provide, and autonomic policies guiding their self-management. The SelfLet architecture has been implemented … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2010
2010
2012
2012

Publication Types

Select...
3
3

Relationship

1
5

Authors

Journals

citations
Cited by 10 publications
(3 citation statements)
references
References 14 publications
(17 reference statements)
0
3
0
Order By: Relevance
“…In all these experiments we considered a system of just 3 SelfLets, and the range of item threshold is set to [1..2MAX C ], where MAX C is the maximum value for item consumption. Since we limit the number of SelfLets in the system, resources needed to prove step (12) in the compositional proofs are negligible, whereas all effort is for step (11) which instead depends on the ranges of the items. The experiments show clearly that the detailed model is more expensive than the original one in terms of the verification effort.…”
Section: Somf(¬selflets[s]ccrit)mentioning
confidence: 99%
See 2 more Smart Citations
“…In all these experiments we considered a system of just 3 SelfLets, and the range of item threshold is set to [1..2MAX C ], where MAX C is the maximum value for item consumption. Since we limit the number of SelfLets in the system, resources needed to prove step (12) in the compositional proofs are negligible, whereas all effort is for step (11) which instead depends on the ranges of the items. The experiments show clearly that the detailed model is more expensive than the original one in terms of the verification effort.…”
Section: Somf(¬selflets[s]ccrit)mentioning
confidence: 99%
“…Table IV summarizes the results of this compositional verification of property P 2 for different values of N s , k, and scale (SC) factor. For every test, the time and space (T/S) of both steps 1 and 2 (corresponding to (11) and (12), respectively) is reported, as well as the totals for the whole compositional verification of P 2 . This shows that the complexity of the component-level check of (11) is independent of N s , as for P 1 .…”
Section: Somf(¬selflets[s]ccrit)mentioning
confidence: 99%
See 1 more Smart Citation