On the Problem of Over-clustering in Tuple-based Coordination Systems

   page       BibTeX_logo.png   
Matteo Casadei, Ronaldo Menezes, Robert Tolksdorf, Mirko Viroli
Ozalp Babaoglu, Howard Shrobe (eds.)
1st IEEE Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007), pages 303-306
IEEE Computer Society, Boston, Massachusetts, USA
9-11 July 2007

When it comes to communication performance, open distributed tuple-space systems depend heavily on the proximity of tuples to processes. Researchers have proposed many approaches for storing tuples in a way that processes benefit from the organization of tuples. Although some progress has been made, most of the proposed solutions fail to address the reverse problem: if most tuples are kept close to processes, the system's robustness is affected – the over-clustering of tuples in particular nodes creates a dependence on that particular node. Hence, we have a dichotomy where it is important to organize tuples in clusters close to processes, but it is equally important to avoid overclustering. This paper presents a self-organized solution to the tuple distribution problem, in which the possibility of over-clustering is considered.