Title :
Self-organized over-clustering avoidance in tuple-space systems
Author :
Casadei, Matteo ; Menezes, Ronaldo ; Viroli, Mirko ; Tolksdorf, Robert
Author_Institution :
Univ. di Bologna, Bologna
Abstract :
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 near the processes, the system´s robustness is affected; the over-clustering of tuples in particular nodes creates a dependence to that particular node. Hence, we have a dichotomy where it is important to organize tuples in clusters near the processes, but it is equally important to avoid over-clustering. The ideal is to have a balance where tuples are clustered but not totally concentrated in very few tuple spaces (eg. one or two). This paper presents a self- organized solution to the tuple distribution problem, in which the possibility of over-clustering is considered.
Keywords :
open systems; parallel programming; dichotomy; open distributed tuple-space systems; self-organized over-clustering avoidance; Entropy; Fault tolerance; Laboratories; Large-scale systems; Organizing; Particle swarm optimization; Postal services; Robustness; Scalability; Standards organizations;
Conference_Titel :
Evolutionary Computation, 2007. CEC 2007. IEEE Congress on
Conference_Location :
Singapore
Print_ISBN :
978-1-4244-1339-3
Electronic_ISBN :
978-1-4244-1340-9
DOI :
10.1109/CEC.2007.4424636