A distributed diffusive heuristic for clustering a virtual P2P supercomputer

Proceedings of the 2010 IEEE International Symposium on Parallel and Distributed Processing, Workshops and Phd Forum, IPDPSW 2010

Volumn , Issue , 2010, Pages

  Gehweiler, Joachim ^a   Meyerhenke, Henning ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Distributed algorithm; Dynamic networks; Graph clustering

Indexed keywords

CLUSTER NUMBERS; CLUSTERINGS; DISTRIBUTED ALGORITHM; DISTRIBUTED CLUSTERING ALGORITHM; DYNAMIC NETWORK; GLOBAL KNOWLEDGE; GRAPH CLUSTERING; INPUT GRAPHS; MEMORY SPACE; NEW APPROACHES; QUALITY MEASURES; RESOURCE CONSTRAINT; STATIC AND DYNAMIC;

DIGITAL LIBRARIES; DISTRIBUTED PARAMETER NETWORKS; ENERGY EFFICIENCY; GRAPH THEORY; SUPERCOMPUTERS;

CLUSTERING ALGORITHMS;

EID: 77954046063     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPSW.2010.5470922     Document Type: Conference Paper

References (24)

1. K. Alzoubi, X.-Y. Li, Y. Wang, P.-J. Wan, and O. Frieder. Geometric spanners for wireless ad hoc networks. IEEE Trans. Parallel Distributed Systems, 14(4):408-421, 2003.
2. R. Andersen and Y. Peres. Finding sparse cuts locally using evolving sets. In 41st ACM Symposium on Theory of Computing (STOC'09), pages 235-244, 2009.
3. O. Bonorden, J. Gehweiler, and F. Meyer auf der Heide. A web computing environment for parallel algorithms in java. Scalable Computing: Practice and Experience, 7(2):1-14, 2006.
4. U. Brandes, D. Delling, M. Gaertler, R. Görke, M. Hoefer, Z. Nikoloski, and D. Wagner. On modularity clustering. IEEE Trans. Knowledge and Data Engineering, 20(2):172-188, 2008.
5. N. Chatterjee, A. Potluri, and A. Negi. A scalable and adaptive clustering scheme for MANETs. In 4th Int. Conference on Distributed Computing and Internet Technology (ICDCIT'07), pages 73-78, 2007.
6. G. Cybenko. Dynamic load balancing for distributed memory multiprocessors. Parallel and Distrib. Comp., 7:279-301, 1989.
7. D. Delling, R. Görke, C. Schulz, and D. Wagner. Orca reduction and contraction graph clustering. In 5th Int. Conf. on Algorithmic Aspects in Information and Management (AAIM), pages 152-165, 2009.
8. A. J. Enright, S. van Dongen, and C. A. Ouzounis. An efficient algorithm for large-scale detection of protein families. Nucleic Acids Research, 30(7):1575-1584, 2002.
9. J. Gehweiler and G. Schomaker. Distributed load balancing in heterogeneous peer-to-peer networks for web computing libraries. In 10th IEEE/ACM Int. Symp. on Distributed Simulation and Real Time Applications (DS-RT), pages 51-58, 2006.
10. R. Görke, T. Hartmann, and D. Wagner. Dynamic graph clustering using minimum-cut trees. In 11th Int. Symp. on Algorithms and Data Structures (WADS), pages 339-350, 2009.
11. L. Grady and E. L. Schwartz. Isoperimetric graph partitioning for image segmentation. IEEE Trans. Pattern Anal. Mach. Intell., 28(3):469-475, 2006. (Pubitemid 43159642)
12. D. Harel and Y. Koren. On clustering using random walks. In 21st Found. of Software Technology and Theoretical Computer Science (FSTTCS), volume 2245 of LNCS, pages 18-41, 2001.
13. L. Lovász. Random walks on graphs: A survey. Combinatorics, Paul Erdös is Eighty, 2:1-46, 1993.
14. H. Meyerhenke, B. Monien, and T. Sauerwald. A new diffusionbased multilevel algorithm for computing graph partitions. J. Parallel and Distributed Computing, 69(9):750-761, 2009. Best Paper Awards and Panel Summary: 22nd Int. Parallel and Distributed Processing Symposium (IPDPS'08).
15. H. Meyerhenke, B. Monien, and S. Schamberger. Graph partitioning and disturbed diffusion. Parallel Computing, 35(10-11):544-569, 2009.
16. M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical Review E (Statistical, Nonlinear, and Soft Matter Physics), 69(2), 2004.
17. F. Pellegrini. A parallelisable multi-level banded diffusion scheme for computing balanced partitions with smooth boundaries. In 13th Int. Euro-Par Conference, volume 4641 of LNCS, pages 195-204, 2007.
18. P. Pons and M. Latapy. Computing communities in large networks using random walks. Journal on Graph Algorithms and Applications, 10(2):191-218, 2006.
19. S. E. Schaeffer. Graph clustering. Computer Science Review, 1(1):27-64, August 2007.
20. J. Šíma and S. E. Schaeffer. On the NP-completeness of some graph cluster measures. In 32nd Int. Conf. on Current Trends in Theory and Practice of Informatics (SOFSEM), volume 3831 of LNCS, pages 530-537, 2006.
21. L. G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103-111, 1990.
22. S. van Dongen. Graph Clustering by Flow Simulation. PhD thesis, Univ. of Utrecht, 2000.
23. C. Xu and F. C. M. Lau. Load Balancing in Parallel Computers. Kluwer, 1997.
24. J. Y. Yu and P. H. J. Chong. A survey of clustering schemes for mobile ad hoc networks. IEEE Communications Surveys & Tutorials, 7(1), 2005.