_:N0cca66017eb04c6584c57fd628290774 .
"bounds" .
"finite period" .
_:N5b8fc2459fd44aa7a9765b187a273c87 .
_:N0cca66017eb04c6584c57fd628290774 "dimensions_id" .
_:N9494b72bd8ae4817a577b96bb51ddf4a .
"clock" .
_:Ne1577e95f11f4e07b0569ada0f2e15b8 _:N854bf4f1a63e462da58e4e6f58bc89b2 .
.
"delay" .
"important building blocks" .
"chapter" .
"en" .
"Mathematical Sciences" .
"https://scigraph.springernature.com/explorer/license/" .
"message delay" .
_:N5b8fc2459fd44aa7a9765b187a273c87 "Hakim" .
"2003-03-14" .
_:N2377b9fc894a40349c086965c938eadc .
_:N4f9a43df5e7d47ec9cdbb87127bf5982 "Ben Y." .
_:N854bf4f1a63e462da58e4e6f58bc89b2 _:N3711dfbdbc7c48c0953d8c63de2c7e5c .
"fault-tolerant systems" .
"synchrony model" .
_:Ne1577e95f11f4e07b0569ada0f2e15b8 .
"running time" .
"Keidar" .
"consensus algorithm" .
"Department of Electrical Engineering, The Technion, 32000, Haifa, Israel" .
"35-39" .
.
.
"https://doi.org/10.1007/3-540-37795-6_7" .
"safety" .
.
"correct processes" .
_:N4f9a43df5e7d47ec9cdbb87127bf5982 .
"questions" .
_:N0cf5e61d15e846b6870aa6081d4d9a1b .
_:N257597b2177942638bbda432bb722a8f .
"absence" .
"Sergio" .
_:N0cf5e61d15e846b6870aa6081d4d9a1b "Andr\u00E9" .
"period" .
_:Ne1577e95f11f4e07b0569ada0f2e15b8 _:N0cf5e61d15e846b6870aa6081d4d9a1b .
_:Na1fae1adf605476c8dc2a57365cc2df6 _:N4f9a43df5e7d47ec9cdbb87127bf5982 .
_:Ncb4a3e24578e414a9a67290ba5765a81 "10.1007/3-540-37795-6_7" .
"half" .
_:N9494b72bd8ae4817a577b96bb51ddf4a _:N257597b2177942638bbda432bb722a8f .
"2003-03-14" .
_:N6e03a06e359944c4956caf5edf5a60cd "978-3-540-37795-5" .
.
.
_:N6e03a06e359944c4956caf5edf5a60cd .
"Rajsbaum" .
_:Nc1746ec56c2d4167aa3835ce6a3f8add "Springer Nature - SN SciGraph project" .
"model" .
"time" .
"chapters" .
_:N6e03a06e359944c4956caf5edf5a60cd "Future Directions in Distributed Computing" .
_:N3711dfbdbc7c48c0953d8c63de2c7e5c _:N5b8fc2459fd44aa7a9765b187a273c87 .
.
.
_:Nea16e5ac5b2f4322a42d01823d5f486e "Springer Nature" .
_:N9494b72bd8ae4817a577b96bb51ddf4a .
"building blocks" .
.
"output" .
"addition" .
"UNAM, Instituto de Matem\u00E1ticas, Mexico" .
"Applied Mathematics" .
.
_:N6e03a06e359944c4956caf5edf5a60cd "978-3-540-00912-2" .
_:Nc1746ec56c2d4167aa3835ce6a3f8add .
_:N0cca66017eb04c6584c57fd628290774 .
"problem" .
"algorithm" .
_:N854bf4f1a63e462da58e4e6f58bc89b2 _:N2377b9fc894a40349c086965c938eadc .
_:N3711dfbdbc7c48c0953d8c63de2c7e5c _:Na1fae1adf605476c8dc2a57365cc2df6 .
"message-passing systems" .
.
_:Na1fae1adf605476c8dc2a57365cc2df6 .
.
"synchronous model" .
_:N2377b9fc894a40349c086965c938eadc "Alex A." .
.
"input" .
_:N0cf5e61d15e846b6870aa6081d4d9a1b "Schiper" .
"Department of Electrical Engineering, The Technion, 32000, Haifa, Israel" .
_:Ncb4a3e24578e414a9a67290ba5765a81 .
"consensus" .
"Open Questions on Consensus Performance inWell-Behaved Runs" .
.
"same output" .
_:Ncb4a3e24578e414a9a67290ba5765a81 .
"real system" .
_:N2377b9fc894a40349c086965c938eadc "Shvartsman" .
"failure" .
.
_:N0cca66017eb04c6584c57fd628290774 "pub.1012746036" .
"absence of failures" .
"2022-05-20T07:42" .
_:N4f9a43df5e7d47ec9cdbb87127bf5982 "Zhao" .
"asynchronous model" .
"liveness" .
_:Nea16e5ac5b2f4322a42d01823d5f486e .
"run" .
"block" .
"system" .
_:N6e03a06e359944c4956caf5edf5a60cd .
"We consider the consensus problem in a message-passing system where processes can crash: Each process has an input, and each correct process must decide on an output, such that all correct processes decide on the same output, and this output is the input of one of the processes. Consensus is an important building block for fault-tolerant systems. It is well-known that consensus is not solvable in an asynchronous model even if only one process can crash [7.13]. However, real systems are not completely asynchronous. Some partially synchronous models [7.12], [7.10] where consensus is solvable better approximate real systems.We consider a partial synchronymodel defined as follows [7.12]1: (1) processes have bounded drift clocks; (2) there are known bounds on processing times and message delays; and (3) less than half of the processes can crash. In addition, this model allows the system to be unstable, where the bounds in (2) do not hold for an unbounded but finite period, but it must eventually enter a stableperiod where the bounds do hold.A consensus algorithm for the partial synchrony model never violates safety, and guarantees liveness once the system becomes stable. Algorithms for this model are called indulgent in [7.16]. What can we say about the running time of consensus algorithms in a partial synchrony model? Unfortunately, even in the absence of failures, any consensus algorithm in this model is bound to have unbounded running times, by [7.13]." .
.
_:N257597b2177942638bbda432bb722a8f .
"consensus problem" .
.
"UNAM, Instituto de Matem\u00E1ticas, Mexico" .
_:Ncb4a3e24578e414a9a67290ba5765a81 "doi" .
_:Nc1746ec56c2d4167aa3835ce6a3f8add .
_:N5b8fc2459fd44aa7a9765b187a273c87 "Weatherspoon" .
"Idit" .
"false"^^ .
"process" .
_:Nea16e5ac5b2f4322a42d01823d5f486e .
.