Renaming in an asynchronous environment
Journal of the ACM (JACM)
Continuous clock amortization need not affect the precision of a clock synchronization algorithm
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Tolerating failures of continuous-valued sensors
ACM Transactions on Computer Systems (TOCS)
More choices allow more faults: set consensus problems in totally asynchronous systems
Information and Computation
Optimal amortized distributed consensus
Information and Computation
Exploiting the locality of memory references to reduce the address bus energy
ISLPED '97 Proceedings of the 1997 international symposium on Low power electronics and design
ACM Transactions on Computer Systems (TOCS)
Fast, long-lived renaming improved and simplified
Science of Computer Programming
Real time and dependability concepts
Distributed systems (2nd Ed.)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Self-stabilization
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
Distributed Algorithms
Low Power Digital CMOS Design
Saving Power in the Control Path of Embedded Processors
IEEE Design & Test
Revisiting the Paxos Algorithm
WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
On the Respective Power of ◊P and ◊S to Solve One-Shot Agreement Problems
IEEE Transactions on Parallel and Distributed Systems
OCD: obsessive consensus disorder (or repetitive consensus)
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Continuous Consensus with Failures and Recoveries
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Self-stabilizing Numerical Iterative Computation
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Average long-lived binary consensus: Quantifying the stabilizing role played by memory
Theoretical Computer Science
When consensus meets self-stabilization
Journal of Computer and System Sciences
When consensus meets self-stabilization
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Output stability versus time till output
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.00 |
This paper introduces the notion of stability for a long-lived consensus system. This notion reflects how sensitive to changes the decisions of the system are, from one invocation of the consensus algorithm to the next, with respect to input changes. Stable long-lived consensus systems are proposed, and tight lower bounds on the achievable stability are proved, for several different scenarios. The scenarios include systems that keep memory from one invocation of consensus to the next versus memoryless systems; systems that take their decisions based on the number of different inputs but not on the source identities of those inputs versus non-symmetric systems. These results intend to study essential aspects of stability, and hence are independent of specific models of distributed computing. Applications to particular self-stabilizing asynchronous systems and synchronous systems are described.