An optimistic commit protocol for distributed transaction management
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
On optimistic methods for concurrency control
ACM Transactions on Database Systems (TODS)
Distributed Optimistic Concurrency Control Methods for High-Performance Transaction Processing
IEEE Transactions on Knowledge and Data Engineering
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Total order broadcast and multicast algorithms: Taxonomy and survey
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Proceedings of the 5th European conference on Computer systems
Towards robust optimistic approaches
Future directions in distributed computing
Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation
MDCC: multi-data center consistency
Proceedings of the 8th ACM European Conference on Computer Systems
Introducing speculation in self-stabilization: an application to mutual exclusion
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 4.10 |
Optimistic distributed protocols can dramatically improve system performance if the underlying system assumptions are sound and carry a high degree of probability. Optimistic protocols aggressively execute actions based on best-case system assumptions. Using optimistic protocols unquestionably involves tradeoffs, but if a protocol is well designed and the optimistic assumptions hold frequently enough, the gain in performance outweighs the overhead of repairing actions that execute incorrectly. Demand for high performance under special circumstances in distributed settings has led to the development of optimistic distributed protocols in recent years. Indeed, given the right optimistic assumptions and mechanisms, optimistic protocols can significantly boost the efficiency of a system. Designing such protocols, however, is still a complicated and poorly understood activity. Part of this complexity is due to the inherent complications of distributed protocols and part is due to the lack of knowledge about how optimistic protocols should work. By providing a framework to reason about these protocols, this article is a first step toward systematizing the construction of optimistic distributed protocols. However, much still remains to be understood about how to design their underlying mechanisms.