메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages 262-267

Boundary chord: A novel peer-to-peer algorithm for replica location mechanism in grid environment

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; COMPUTER SIMULATION; MIDDLEWARE; PROBLEM SOLVING;

EID: 33846999849     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPAN.2005.21     Document Type: Conference Paper
Times cited : (4)

References (28)
  • 3
    • 33646682342 scopus 로고    scopus 로고
    • ChinaGrid: Making Grid Computing a Reality
    • Digital Libraries: International Collaboration and Cross-Fertilization, Springer-Verlag
    • H. Jin, "ChinaGrid: Making Grid Computing a Reality", Digital Libraries: International Collaboration and Cross-Fertilization, LNCS, Vol.3334, Springer-Verlag, 2004, pp.13-24.
    • (2004) LNCS , vol.3334 , pp. 13-24
    • Jin, H.1
  • 4
    • 77954207771 scopus 로고    scopus 로고
    • Locating Data in (small-world?) Peer-to-Peer Scientific Collaborations
    • Proceedings of the 1st International Workshop on Peer-to-Peer Systems IPTPS'02, Springer-Verlag
    • A. Iamnitchi, M. Ripeanu, and I. Foster, "Locating Data in (small-world?) Peer-to-Peer Scientific Collaborations", Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS'02), 2002, LNCS Hot Topics series, Springer-Verlag, Vol.2429, pp.232-241.
    • (2002) LNCS Hot Topics series , vol.2429 , pp. 232-241
    • Iamnitchi, A.1    Ripeanu, M.2    Foster, I.3
  • 10
    • 18044393015 scopus 로고    scopus 로고
    • GriPhyN Project Technical Report 2002-20
    • E. Deelman, J. Blythe, Y. Gil, and C. Kesselman, "Pegasus: Planning for Execution in Grids", GriPhyN Project Technical Report 2002-20.
    • Deelman, E.1    Blythe, J.2    Gil, Y.3    Kesselman, C.4
  • 11
    • 33751095033 scopus 로고    scopus 로고
    • Mapping Abstract Complex Workflows onto Grid Environments
    • E. Deelman, "Mapping Abstract Complex Workflows onto Grid Environments", Journal of Grid Computing, 2003, Vol.1, No.1, pp.25-39.
    • (2003) Journal of Grid Computing , vol.1 , Issue.1 , pp. 25-39
    • Deelman, E.1
  • 17
    • 0003858844 scopus 로고    scopus 로고
    • Tapestry: An infrastructure for fault-resilient wide-area location and routing
    • UCBCSD-01-1141, April
    • B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph, "Tapestry: An infrastructure for fault-resilient wide-area location and routing", Berkeley Technical Report UCBCSD-01-1141, April 2001.
    • (2001) Berkeley Technical Report
    • Zhao, B.Y.1    Kubiatowicz, J.D.2    Joseph, A.D.3
  • 23
    • 0025436383 scopus 로고
    • Skip Lists: A Probabilistic Alternative to Balanced Trees
    • June
    • W. Pugh, "Skip Lists: A Probabilistic Alternative to Balanced Trees", Communication of the ACM, June 1990, Vol.33, No.3, pp.668-676.
    • (1990) Communication of the ACM , vol.33 , Issue.3 , pp. 668-676
    • Pugh, W.1
  • 28
    • 0014814325 scopus 로고    scopus 로고
    • Space/Time Trade-offs in Hash Coding with Allowable Errors
    • B. Bloom, "Space/Time Trade-offs in Hash Coding with Allowable Errors", Communications of ACM, Vol. 13, No.7, pp.422-426.
    • Communications of ACM , vol.13 , Issue.7 , pp. 422-426
    • Bloom, B.1


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