Communications of the ACM
Fast protocol transition in a distributed environment (brief announcement)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Reliable Multicast between Micro-Kernels
Proceedings of the Workshop on Micro-kernels and Other Kernel Architectures
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Optimistic Total Order in Wide Area Networks
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Exploiting Virtual Synchrony in Distributed Systems
Exploiting Virtual Synchrony in Distributed Systems
Appia: A Flexible Protocol Kernel Supporting Multiple Coordinated Channels
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
The ensemble system
Simulation of large scale networks I: simulation of large-scale networks using SSF
Proceedings of the 35th conference on Winter simulation: driving innovation
A framework to support multiple reconfiguration strategies
Proceedings of the 1st international conference on Autonomic computing and communication systems
Run-time switching between total order algorithms
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Towards a generic group communication service
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part II
Practical database replication
Replication
Hi-index | 0.00 |
A total order protocol is a fundamental building block in the construction of distributed fault-tolerant applications. Unfortunately, the implementation of such a primitive can be expensive both in terms of communication steps and of number of messages exchanged. This problem is exacerbated in large-scale systems, where the performance of the algorithm may be limited by the presence of high-latency links.Optimistic total order protocols have been proposed to alleviate this problem. However, different optimistic protocols offer quite distinct services. This paper makes an overview of different optimistic approaches and shows how they can be combined in a single adaptive protocol.