메뉴 건너뛰기




Volumn , Issue , 2010, Pages

A distributed diffusive heuristic for clustering a virtual P2P supercomputer

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;

EID: 77954046063     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPSW.2010.5470922     Document Type: Conference Paper
Times cited : (25)

References (24)
  • 6
    • 0024748907 scopus 로고
    • Dynamic load balancing for distributed memory multiprocessors
    • G. Cybenko. Dynamic load balancing for distributed memory multiprocessors. Parallel and Distrib. Comp., 7:279-301, 1989.
    • (1989) Parallel and Distrib. Comp. , vol.7 , pp. 279-301
    • Cybenko, G.1
  • 8
    • 0036529479 scopus 로고    scopus 로고
    • An efficient algorithm for large-scale detection of protein families
    • 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.
    • (2002) Nucleic Acids Research , vol.30 , Issue.7 , pp. 1575-1584
    • Enright, A.J.1    Van Dongen, S.2    Ouzounis, C.A.3
  • 14
    • 67650997058 scopus 로고    scopus 로고
    • A new diffusionbased multilevel algorithm for computing graph partitions
    • Best Paper Awards and Panel Summary: 22nd Int. Parallel and Distributed Processing Symposium (IPDPS'08)
    • 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).
    • (2009) J. Parallel and Distributed Computing , vol.69 , Issue.9 , pp. 750-761
    • Meyerhenke, H.1    Monien, B.2    Sauerwald, T.3
  • 15
    • 70350569840 scopus 로고    scopus 로고
    • Graph partitioning and disturbed diffusion
    • H. Meyerhenke, B. Monien, and S. Schamberger. Graph partitioning and disturbed diffusion. Parallel Computing, 35(10-11):544-569, 2009.
    • (2009) Parallel Computing , vol.35 , Issue.10-11 , pp. 544-569
    • Meyerhenke, H.1    Monien, B.2    Schamberger, S.3
  • 17
    • 38049150487 scopus 로고    scopus 로고
    • A parallelisable multi-level banded diffusion scheme for computing balanced partitions with smooth boundaries
    • volume 4641 of LNCS
    • 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.
    • (2007) 13th Int. Euro-Par Conference , pp. 195-204
    • Pellegrini, F.1
  • 18
    • 38849162343 scopus 로고    scopus 로고
    • Computing communities in large networks using random walks
    • P. Pons and M. Latapy. Computing communities in large networks using random walks. Journal on Graph Algorithms and Applications, 10(2):191-218, 2006.
    • (2006) Journal on Graph Algorithms and Applications , vol.10 , Issue.2 , pp. 191-218
    • Pons, P.1    Latapy, M.2
  • 19
    • 35248893285 scopus 로고    scopus 로고
    • Graph clustering
    • August
    • S. E. Schaeffer. Graph clustering. Computer Science Review, 1(1):27-64, August 2007.
    • (2007) Computer Science Review , vol.1 , Issue.1 , pp. 27-64
    • Schaeffer, S.E.1
  • 21
    • 0025467711 scopus 로고
    • A bridging model for parallel computation
    • L. G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103-111, 1990.
    • (1990) Communications of the ACM , vol.33 , Issue.8 , pp. 103-111
    • Valiant, L.G.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.