메뉴 건너뛰기




Volumn 58, Issue 11, 2009, Pages 1444-1455

Slicing distributed systems

Author keywords

Distributed systems; Fault tolerance; Performance evaluation of algorithms and systems

Indexed keywords

DISTRIBUTED SYSTEMS; EXPERIMENTAL EVALUATION; FAULT TOLERANCE PERFORMANCE; LARGE DATA; PEER-TO-PEER ARCHITECTURES; PROBLEM STATEMENT; RAPID CONVERGENCE; SHIFT WORK; SLICING PROBLEM; STORAGE CAPACITY; VOIP TELEPHONY;

EID: 75449087846     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2009.111     Document Type: Article
Times cited : (12)

References (25)
  • 1
    • 51249184131 scopus 로고
    • Sorting in c log n parallel steps
    • Mar.
    • M. Ajtai, J. Komló s, and E. Szemerédi, "Sorting in c Log n Parallel Steps," J. Combinatorica, vol.3, no.1, pp. 1-19, Mar. 1983.
    • (1983) J. Combinatorica , vol.3 , Issue.1 , pp. 1-19
    • Ajtai, M.1    Komlós, J.2    Szemerédi, E.3
  • 2
    • 0018454769 scopus 로고
    • Fast probabilistic algorithms for hamiltonian circuits and matchings
    • D. Angluin and L.G. Valiant, "Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings," J. Computer and System Sciences, vol.18, no.2, pp. 155-193, 1979.
    • (1979) J. Computer and System Sciences , vol.18 , Issue.2 , pp. 155-193
    • Angluin, D.1    Valiant, L.G.2
  • 3
    • 0023289009 scopus 로고
    • The complexity of parallel sorting
    • F.M. auf Der Heide and A. Wigderson, "The Complexity of Parallel Sorting," SIAM J. Computing, vol.16, no.1, pp. 100-107, 1987.
    • (1987) SIAM J. Computing , vol.16 , Issue.1 , pp. 100-107
    • Heide Der Auf, F.M.1    Wigderson, A.2
  • 7
    • 0024057356 scopus 로고
    • Parallel merge sort
    • R. Cole, "Parallel Merge Sort," SIAM J. Computing, vol.17, no.4, pp. 770-785, 1988.
    • (1988) SIAM J. Computing , vol.17 , Issue.4 , pp. 770-785
    • Cole, R.1
  • 11
    • 75449112469 scopus 로고    scopus 로고
    • Gnutella Homepage, http://www.gnutella.com, 2007.
    • (2007)
  • 12
    • 0033300536 scopus 로고    scopus 로고
    • Communication-efficient parallel sorting
    • M.T. Goodrich, "Communication-Efficient Parallel Sorting," SIAM J. Computing, vol.29, no.2, pp. 416-432, 1999.
    • (1999) SIAM J. Computing , vol.29 , Issue.2 , pp. 416-432
    • Goodrich, M.T.1
  • 17
    • 75449095704 scopus 로고    scopus 로고
    • KaZaA Homepage, http://www.kazaa.com, 2009.
    • (2009)
  • 23
    • 75449113468 scopus 로고    scopus 로고
    • Skype Homepage, http://www.skype.com, 2009.
    • (2009)


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