View article

One of the today issues in software engineering is to find new effective ways to deal intelligently with the increasing complexity of distributed computing systems. In particular, one of the aspects under study in the field of autonomic computing concerns the way such systems can autonomously reach a configuration that allows the entire system to work in a more efficient and effective way. In this paper we investigate how it is possible to obtain self-aggregation of distributed components. We have used existing self-aggregation algorithms as a starting point, and, after an analysis phase, we have discovered some aspects that could be improved. Finally we have derived new algorithms that showed improved self-aggregating performances in most of the situations.