Reaching approximate agreement in the presence of faults
Journal of the ACM (JACM)
Electing a leader in a synchronous ring
Journal of the ACM (JACM)
A new fault-tolerant algorithm for clock synchronization
Information and Computation
Renaming in an asynchronous environment
Journal of the ACM (JACM)
Lower bounds for wait-free computation in message-passing systems
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Immediate atomic snapshots and fast renaming
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Asynchronous approximate agreement
Information and Computation
Wait-free algorithms for fast, long-lived renaming
Science of Computer Programming
New Hybrid Fault Models for Asynchronous Approximate Agreement
IEEE Transactions on Computers
Long-lived renaming made adaptive
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Fast, wait-free (2k-1)-renaming
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Wait-free implementations in message-passing systems
Theoretical Computer Science
Inexact agreement: accuracy, precision, and graceful degradation
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
The topological structure of asynchronous computability
Journal of the ACM (JACM)
Exploiting Omissive Faults in Synchronous Approximate Agreement
IEEE Transactions on Computers
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
Time bounds for decision problems in the presence of timing uncertainty and failures
Journal of Parallel and Distributed Computing
Distributed Algorithms
Adaptive and Efficient Algorithms for Lattice Agreement and Renaming
SIAM Journal on Computing
Reaching Approximate Agreement with Mixed-Mode Faults
IEEE Transactions on Parallel and Distributed Systems
Approximate Agreement with Mixed Mode Faults: Algorithm and Lower Bound
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Polynominal and Adaptive Long-Lived (2k-1)-Renaming
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Optimal Approximate Agreement with Omission Faults
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Renaming in message passing systems with byzantine failures
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Fully-adaptive algorithms for long-lived renaming
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Agreement among unacquainted byzantine generals
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Early deciding synchronous renaming in o( logf) rounds or less
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
| Hi-index | 5.23 |
In [14] Chaudhuri et al. (1999) presented a strong, wait-free renaming algorithm for a synchronous message passing system with crash failures, which runs in an optimal O(logn) time, where n is the number of initially participating processors. Here, we extend their work by presenting a renaming algorithm which has similar characteristics and in addition is order-preserving. The new algorithm is based on an approximate agreement protocol.