메뉴 건너뛰기




Volumn 24, Issue , 2005, Pages 179-188

The combined power of conditions and failure detectors to solve asynchronous set agreement

Author keywords

Asynchronous system; Condition; Consensus; Failure detection; Process crash; Set Agreement; Shared memory; Snapshot

Indexed keywords

DETECTORS; FAILURE (MECHANICAL); FAULT TOLERANT COMPUTER SYSTEMS; NETWORK PROTOCOLS; PROBLEM SOLVING; SET THEORY;

EID: 32344433874     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073814.1073848     Document Type: Conference Paper
Times cited : (12)

References (38)
  • 2
    • 84947251883 scopus 로고    scopus 로고
    • Wait-free n-set consensus when inputs are restricted
    • Springer Verlag LNCS #2508, Toulouse (France)
    • Attiya H. and Avidor Z., Wait-Free n-Set Consensus when Inputs are Restricted. Proc. 16th Int. Symposium on Distributed Computing (DISC'02), Springer Verlag LNCS #2508, pp. 326-338, Toulouse (France), 2002.
    • (2002) Proc. 16th Int. Symposium on Distributed Computing (DISC'02) , pp. 326-338
    • Attiya, H.1    Avidor, Z.2
  • 4
    • 0030197368 scopus 로고    scopus 로고
    • The weakest failure detector for solving consensus
    • Chandra T.D., Hadzilacos V. and Toueg S., The Weakest Failure Detector for Solving Consensus. Journal of the ACM, 43(4):685-722, 1996.
    • (1996) Journal of the ACM , vol.43 , Issue.4 , pp. 685-722
    • Chandra, T.D.1    Hadzilacos, V.2    Toueg, S.3
  • 5
    • 0030102105 scopus 로고    scopus 로고
    • Unreliable failure detectors for reliable distributed systems
    • Chandra T.D. and Toueg S., Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM, 43(2):225-267, 1996.
    • (1996) Journal of the ACM , vol.43 , Issue.2 , pp. 225-267
    • Chandra, T.D.1    Toueg, S.2
  • 6
    • 0001197842 scopus 로고
    • More choices allow more faults: Set consensus problems in totally asynchronous systems
    • Chaudhuri S., More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems. Information and Computation, 105:132-158, 1993.
    • (1993) Information and Computation , vol.105 , pp. 132-158
    • Chaudhuri, S.1
  • 8
    • 0032154578 scopus 로고    scopus 로고
    • Reducing Ω to ◇W
    • Chu F., Reducing Ω to ◇W. Information Processing Letters, 76(6):293-298, 1998.
    • (1998) Information Processing Letters , vol.76 , Issue.6 , pp. 293-298
    • Chu, F.1
  • 10
    • 0023994903 scopus 로고
    • Consensus in the presence of partial synchrony
    • Dwork C., Lynch N. and Stockmeyer L., Consensus in the Presence of Partial Synchrony. Journal of the ACM, 35(2):288-323, 1988.
    • (1988) Journal of the ACM , vol.35 , Issue.2 , pp. 288-323
    • Dwork, C.1    Lynch, N.2    Stockmeyer, L.3
  • 11
    • 0022045868 scopus 로고
    • Impossibility of distributed consensus with one faulty process
    • Fischer M.J., Lynch N.A. and Paterson M.S., Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM, 32(2):374-382, 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
    • 34848893338 scopus 로고    scopus 로고
    • From a static impossibility to an adaptive lower bound: The complexity of early deciding set agreement
    • May
    • Gafni E., Guerraoui R. and Pochon B., From a Static Impossibility to an Adaptive Lower Bound: The Complexity of Early Deciding Set Agreement. Proc. 37th ACM Symposium on Theory of Computing, May 2005.
    • (2005) Proc. 37th ACM Symposium on Theory of Computing
    • Gafni, E.1    Guerraoui, R.2    Pochon, B.3
  • 15
    • 1942468125 scopus 로고    scopus 로고
    • The information structure of indulgent consensus
    • Guerraoui R. and Raynal M., The Information Structure of Indulgent Consensus. IEEE Transactions on Computers, 53(4):453-466, 2004.
    • (2004) IEEE Transactions on Computers , vol.53 , Issue.4 , pp. 453-466
    • Guerraoui, R.1    Raynal, M.2
  • 16
    • 35248833735 scopus 로고    scopus 로고
    • Tight bounds for k-set agreement with limited scope accuracy failure detectors
    • Springer Verlag LNCS #2848, Sorrento (Italy)
    • Herlihy M.P. and Penso L. D., Tight Bounds for k-Set Agreement with Limited Scope Accuracy Failure Detectors. Proc. 17th Int. Symposium on Distributed Computing (DISC'03), Springer Verlag LNCS #2848, pp. 279-291, Sorrento (Italy), 2003.
    • (2003) Proc. 17th Int. Symposium on Distributed Computing (DISC'03) , pp. 279-291
    • Herlihy, M.P.1    Penso, L.D.2
  • 18
    • 0001059575 scopus 로고    scopus 로고
    • The topological structure of asynchronous computability
    • Herlihy M.P. and Shavit N., The Topological Structure of Asynchronous Computability. Journal of the ACM, 46(6):858-923, 1999.
    • (1999) Journal of the ACM , vol.46 , Issue.6 , pp. 858-923
    • Herlihy, M.P.1    Shavit, N.2
  • 20
    • 0036538625 scopus 로고    scopus 로고
    • A versatile family of consensus protocols based on chandra-toueg's unreliable failure detectors
    • Hurfin M., Mostefaoui A. and Raynal M., A Versatile Family of Consensus Protocols Based on Chandra-Toueg's Unreliable Failure Detectors. IEEE Transactions on Computers, 51(4):395-408, 2002
    • (2002) IEEE Transactions on Computers , vol.51 , Issue.4 , pp. 395-408
    • Hurfin, M.1    Mostefaoui, A.2    Raynal, M.3
  • 21
    • 35048883100 scopus 로고    scopus 로고
    • Synchronous condition-based consensus adapting to input vector legality
    • Springer-Verlag LNCS #3224
    • Izumi T. and Masuzawa T., Synchronous Condition-Based Consensus Adapting to Input Vector Legality. Proc. 18th Int. Symposium on Distributed Computing (DISC'04), Springer-Verlag LNCS #3224, pp. 16-29, 2004.
    • (2004) Proc. 18th Int. Symposium on Distributed Computing (DISC'04) , pp. 16-29
    • Izumi, T.1    Masuzawa, T.2
  • 23
    • 4243070797 scopus 로고    scopus 로고
    • Conditions on input vectors for consensus solvability in asynchronous distributed systems
    • Mostefaoui A., Rajsbaum S. and Raynal M., Conditions on Input Vectors for Consensus Solvability in Asynchronous Distributed Systems. J. of the ACM, 50(6):922-954, 2003.
    • (2003) J. of the ACM , vol.50 , Issue.6 , pp. 922-954
    • Mostefaoui, A.1    Rajsbaum, S.2    Raynal, M.3
  • 26
    • 32344449274 scopus 로고    scopus 로고
    • The combined power of conditions and information on failures to solve asynchronous set agreement
    • IRISA, Université de Rennes (France)
    • Mostefaoui A., Rajsbaum S. and Raynal M., The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement, Tech Report #1688, IRISA, Université de Rennes (France), 2005. http://www,irisa.fr/bibli/publi/pi/2005/1688/1688.html
    • (2005) Tech Report #1688 , vol.1688
    • Mostefaoui, A.1    Rajsbaum, S.2    Raynal, M.3
  • 28
    • 12144287021 scopus 로고    scopus 로고
    • Condition-based consensus solvability: A hierarchy of conditions and efficient protocols
    • Mostefaoui A., Rajsbaum S., Raynal M. and Roy M., Condition-based Consensus Solvability: a Hierarchy of Conditions and Efficient Protocols. Distributed Computing, 17:1-20, 2004.
    • (2004) Distributed Computing , vol.17 , pp. 1-20
    • Mostefaoui, A.1    Rajsbaum, S.2    Raynal, M.3    Roy, M.4
  • 29
    • 84937541334 scopus 로고    scopus 로고
    • Solving consensus using chandra-toueg's unreliable failure detectors: A general quorum-based approach
    • Springer Verlag LNCS #1693
    • Mostéfaoui A. and Raynal M., Solving Consensus Using Chandra-Toueg's Unreliable Failure Detectors: a General Quorum-Based Approach. Proc. 13th Int. Symposium on Distributed Computing (DISC'99), Springer Verlag LNCS #1693, pp. 49-63, 1999.
    • (1999) Proc. 13th Int. Symposium on Distributed Computing (DISC'99) , pp. 49-63
    • Mostéfaoui, A.1    Raynal, M.2
  • 33
    • 84941154408 scopus 로고    scopus 로고
    • Decision optimal early-stopping k-set agreement in synchronous systems with general omission failures
    • IRISA, Université de Rennes (France)
    • Raïpin Parvédy Ph., Raynal M. and Travers C., Decision Optimal Early-Stopping k-set Agreement in Synchronous Systems with General Omission Failures. Tech Report #1711, IRISA, Université de Rennes (France), 2005. http://www.irisa.fr/bibli/publi/pi/2005/1711/1711.html
    • (2005) Tech Report #1711 , vol.1711
    • Raïpin Parvédy, Ph.1    Raynal, M.2    Travers, C.3
  • 35
    • 0034541366 scopus 로고    scopus 로고
    • Wait-free k-set agreement is impossible: The topology of public knowledge
    • Saks M. and Zaharoglou F., Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge. SIAM Journal on Computing, 29(5):1449-1483, 2000.
    • (2000) SIAM Journal on Computing , vol.29 , Issue.5 , pp. 1449-1483
    • Saks, M.1    Zaharoglou, F.2
  • 36
    • 0031123554 scopus 로고    scopus 로고
    • Early consensus in an asynchronous system with a weak failure detector
    • Schiper A., Early Consensus in an Asynchronous System with a Weak Failure Detector. Distributed Computing, 10:149-157, 1997.
    • (1997) Distributed Computing , vol.10 , pp. 149-157
    • Schiper, A.1
  • 38
    • 35248839337 scopus 로고    scopus 로고
    • Condition-based consensus in synchronous systems
    • Springer-Verlag LNCS #2848
    • Zibin Y., Condition-Based Consensus in Synchronous Systems. Proc. 17th Int. Symposium on Distributed Computing, Springer-Verlag LNCS #2848, pp. 239-248, 2003.
    • (2003) Proc. 17th Int. Symposium on Distributed Computing , pp. 239-248
    • Zibin, Y.1


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