메뉴 건너뛰기




Volumn 347, Issue 1-2, 2005, Pages 130-166

Efficient gossip and robust distributed computation

Author keywords

Combinatorial tools; Distributed algorithms; Gossip; Performing work; Processor failures

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PROBLEM SOLVING;

EID: 27844559682     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.05.019     Document Type: Article
Times cited : (29)

References (19)
  • 1
    • 38249028223 scopus 로고
    • Explicit construction of linear sized tolerant networks
    • N. Alon, and F. Chung Explicit construction of linear sized tolerant networks Discrete Math. 72 1988 15 19
    • (1988) Discrete Math. , vol.72 , pp. 15-19
    • Alon, N.1    Chung, F.2
  • 4
    • 0001757868 scopus 로고    scopus 로고
    • Algorithms for the certified Write-All problem
    • R.J. Anderson, and H. Woll Algorithms for the certified Write-All problem SIAM J. Comput. 26 5 1997 1277 1283
    • (1997) SIAM J. Comput. , vol.26 , Issue.5 , pp. 1277-1283
    • Anderson, R.J.1    Woll, H.2
  • 5
    • 0034893155 scopus 로고    scopus 로고
    • Performing tasks on restartable message-passing processors
    • B. Chlebus, R. De Prisco, and A.A. Shvartsman Performing tasks on restartable message-passing processors Distributed Comput. 14 1 2001 49 64
    • (2001) Distributed Comput. , vol.14 , Issue.1 , pp. 49-64
    • Chlebus, B.1    De Prisco, R.2    Shvartsman, A.A.3
  • 10
    • 0001280843 scopus 로고    scopus 로고
    • Performing work efficiently in the presence of faults
    • C. Dwork, J. Halpern, and O. Waarts Performing work efficiently in the presence of faults SIAM J. Comput. 27 5 1998 1457 1491
    • (1998) SIAM J. Comput. , vol.27 , Issue.5 , pp. 1457-1491
    • Dwork, C.1    Halpern, J.2    Waarts, O.3
  • 13
    • 1642377534 scopus 로고    scopus 로고
    • The complexity of synchronous iterative Do-All with crashes
    • Ch. Georgiou, A. Russell, and A.A. Shvartsman The complexity of synchronous iterative Do-All with crashes Distributed Comput. 17 1 2004 47 63
    • (2004) Distributed Comput. , vol.17 , Issue.1 , pp. 47-63
    • Georgiou, Ch.1    Russell, A.2    Shvartsman, A.A.3
  • 14
    • 0001853771 scopus 로고
    • Efficient parallel algorithms can be made robust
    • P.C. Kanellakis, and A.A. Shvartsman Efficient parallel algorithms can be made robust Distributed Comput. 5 4 1992 201 217
    • (1992) Distributed Comput. , vol.5 , Issue.4 , pp. 201-217
    • Kanellakis, P.C.1    Shvartsman, A.A.2
  • 17
    • 0012614841 scopus 로고    scopus 로고
    • Fault-tolerant broadcasting and gossiping in communication networks
    • A. Pelc Fault-tolerant broadcasting and gossiping in communication networks Networks 28 1996 143 156
    • (1996) Networks , vol.28 , pp. 143-156
    • Pelc, A.1
  • 18
    • 84976815497 scopus 로고
    • Fail-stop processors: An approach to designing fault-tolerant computing systems
    • R.D. Schlichting, and F.B. Schneider Fail-stop processors: an approach to designing fault-tolerant computing systems ACM Trans. Comput. Systems 1 3 1983 222 238
    • (1983) ACM Trans. Comput. Systems , vol.1 , Issue.3 , pp. 222-238
    • Schlichting, R.D.1    Schneider, F.B.2
  • 19
    • 0012609620 scopus 로고
    • Tolerating a linear number of faults in networks of bounded degree
    • E. Upfal Tolerating a linear number of faults in networks of bounded degree Inform. and Comput. 115 1994 312 320
    • (1994) Inform. and Comput. , vol.115 , pp. 312-320
    • Upfal, E.1


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