메뉴 건너뛰기




Volumn , Issue , 2006, Pages

Automatic clustering for self-organizing grids

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC CLUSTERING; BRUTE-FORCE APPROACH; CANDIDATE NODES; CLUSTER COMPUTING; COMPUTATIONAL GRIDS; DYNAMIC DISCOVERY; DYNAMIC SET; GRID MIDDLEWARE SERVICES; GRID NODES; INTERNATIONAL CONFERENCES; LARGE-SCALE GRIDS; MESSAGE EXCHANGING; MULTI-SITE; SCALABLE SOLUTIONS; SELF-ORGANIZING; SIMULATION RESULTS; USER PARTICIPATION;

EID: 46049086955     PISSN: 15525244     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CLUSTR.2006.311891     Document Type: Conference Paper
Times cited : (4)

References (13)
  • 2
    • 84885579967 scopus 로고    scopus 로고
    • Seti@home. http://setiathome.berkeley.edu.
    • Seti@home
  • 3
    • 34548806882 scopus 로고    scopus 로고
    • Teragrid. http://www.teragrid.org.
    • Teragrid
  • 10
    • 46049094550 scopus 로고    scopus 로고
    • W. Yang. General p2p simulator. http://www.cs.binghamton.edu/~wyang/gps.
    • W. Yang. General p2p simulator. http://www.cs.binghamton.edu/~wyang/gps.
  • 12
    • 0029780013 scopus 로고    scopus 로고
    • How to model an internetwork
    • San Francisco, CA, March, IEEE
    • E. W. Zegura, K. L. Calvert, and S. Bhattacharjee. How to model an internetwork. In IEEE Infocom, volume 2, pages 594-602, San Francisco, CA, March 1996. IEEE.
    • (1996) IEEE Infocom , vol.2 , pp. 594-602
    • Zegura, E.W.1    Calvert, K.L.2    Bhattacharjee, S.3


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