A distributed diffusive heuristic for clustering a virtual P2P supercomputer

Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these subgroups can be formulated as a graph clustering problem, where clusters are vertex subsets that are densely connected within themselves, but sparsely connected to each other. Due to resource constraints, clustering using global knowledge (i. e., knowing (nearly) the whole input graph) might not be permissible in a P2P scenario, e. g., because collecting the data is not possible or would consume a high amount of resources. That is why we present a distributed heuristic using only limited local knowledge for clustering static and dynamic graphs. Based on disturbed diffusion, our algorithm DIDIC implicitly optimizes cut-related quality measures such as modularity. It thus settles between distributed clustering algorithms for other quality measures (e. g., energy efficiency in the field of ad-hoc-networking) a...

• Type: Journal
• Year: 2010
• Where: IPPS
• Authors: Joachim Gehweiler, Henning Meyerhenke
• Keywords: Algorithm, Distributed And Parallel Computing, Global Knowledge, Graph Clustering Problem, IPPS 2010