메뉴 건너뛰기




Volumn 2000-January, Issue , 2000, Pages 4-13

A problem-specific fault-tolerance mechanism for asynchronous, distributed systems

Author keywords

Algorithm design and analysis; Computer networks; Computer science; Fault tolerance; Fault tolerant systems; Internet; Laboratories; Middleware; Protocols; Scalability

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; COMPUTER SCIENCE; FAULT TOLERANT COMPUTER SYSTEMS; INTERNET; INTERNET PROTOCOLS; LABORATORIES; LOCAL AREA NETWORKS; MIDDLEWARE; NETWORK PROTOCOLS; SCALABILITY; WIDE AREA NETWORKS;

EID: 84949491565     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2000.876065     Document Type: Conference Paper
Times cited : (40)

References (30)
  • 4
    • 0026104130 scopus 로고
    • Understanding fault-tolerant distributed systems
    • Feb.
    • F. Cristian. Understanding fault-tolerant distributed systems. Communications of the ACM, 34(2):56-78, Feb. 1991.
    • (1991) Communications of the ACM , vol.34 , Issue.2 , pp. 56-78
    • Cristian, F.1
  • 7
    • 0040684856 scopus 로고
    • Parallel branch-and-bound algorithms for general mixed integer programming on the CM-5
    • J. Eckstein. Parallel branch-and-bound algorithms for general mixed integer programming on the CM-5. SIAM Journal on Optimization, 4:794-814, 1994.
    • (1994) SIAM Journal on Optimization , vol.4 , pp. 794-814
    • Eckstein, J.1
  • 8
    • 3543099582 scopus 로고    scopus 로고
    • How much communication does parallel branch and bound need?
    • J. Eckstein. How much communication does parallel branch and bound need? INFORMS Journal on Computing, 9:15-29, 1997.
    • (1997) INFORMS Journal on Computing , vol.9 , pp. 15-29
    • Eckstein, J.1
  • 9
    • 0018998813 scopus 로고
    • Minimum-time broadcast networks
    • A. Farley. Minimum-time broadcast networks. Networks, 10:59-70, 1980.
    • (1980) Networks , vol.10 , pp. 59-70
    • Farley, A.1
  • 11
    • 0022045868 scopus 로고
    • Impossibility of distributed consensus with one faulty process
    • Apr.
    • M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374-382, Apr. 1985.
    • (1985) Journal of the ACM , vol.32 , Issue.2 , pp. 374-382
    • Fischer, M.J.1    Lynch, N.A.2    Paterson, M.S.3
  • 13
    • 0345415768 scopus 로고    scopus 로고
    • Fundamentals of fault-tolerant distributed computing in asynchronous environments
    • Mar.
    • F. C. Gärtner. Fundamentals of fault-tolerant distributed computing in asynchronous environments. ACM Computing Surveys, 31(1):1-26, Mar. 1999.
    • (1999) ACM Computing Surveys , vol.31 , Issue.1 , pp. 1-26
    • Gärtner, F.C.1
  • 14
    • 0028550919 scopus 로고
    • Parallel branch-and-bound algorithms: Survey and synthesis
    • B. Gendron and T. G. Crainic. Parallel branch-and-bound algorithms: survey and synthesis. Operations Research, 42:1042-1066, 1994.
    • (1994) Operations Research , vol.42 , pp. 1042-1066
    • Gendron, B.1    Crainic, T.G.2
  • 15
    • 0003644862 scopus 로고
    • Technical Report University of California, Santa Cruz, Jack Baskin School of Engineering, Mar.
    • R. A. Golding and K. Taylor. Group membership in the epidemic style. Technical Report UCSC-CRL-92-13, University of California, Santa Cruz, Jack Baskin School of Engineering, Mar. 1992.
    • (1992) Group Membership in the Epidemic Style
    • Golding, R.A.1    Taylor, K.2
  • 23
    • 0002411371 scopus 로고
    • What good are models and what models are good?
    • S. Mullender, editor, chapter 2, Addison-Wesley, second edition
    • F. B. Schneider. What good are models and what models are good? In S. Mullender, editor, Distributed Systems, chapter 2, pages 17-26. Addison-Wesley, second edition, 1993.
    • (1993) Distributed Systems , pp. 17-26
    • Schneider, F.B.1
  • 24
    • 84949518746 scopus 로고    scopus 로고
    • SETI@home. http://setiathome.ssl.berkeley.edu.
  • 27
    • 84949487245 scopus 로고    scopus 로고
    • UCLA Parallel Computing Laboratory. Parsec. http://may.cs.ucla.edu/projects/parsec.
    • Parsec


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