Site optimal termination protocols for a distributed database under network partitioning
ACM SIGOPS Operating Systems Review
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Achieving robustness in distributed database systems
ACM Transactions on Database Systems (TODS)
Site optimal termination protocols for a distributed database under network partitioning
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Optimal termination protocols for network partitioning
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
A Fault-Tolerant Protocol for Atomic Broadcast
IEEE Transactions on Parallel and Distributed Systems
DObjects: Enabling Distributed Data Services for Metacomputing Platforms
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
Adapting Commit Protocols for Large-Scale and Dynamic Distributed Applications
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems:
Consensus in the presence of partial synchrony (Preliminary Version)
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Future directions in distributed computing
| Hi-index | 0.00 |
Herein, we propose a commit protocol and an associated recovery protocol that is resilient to site failures, lost messages, and network partitioning. The protocols do not require that a failure be correctly identified or even detected. The only potential effect of undetected failures is a degradation in performance. The protocols use a weighted voting scheme that supports an arbitrary degree of data replication (including none) and allows unilaterally aborts by any site. This last property facilitates the integration of these protocols with concurrency control protocols. Both protocols are centralized protocols with low message overhead.