Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Epidemic algorithms for replicated database maintenance
ACM SIGOPS Operating Systems Review
About logical clocks for distributed systems
ACM SIGOPS Operating Systems Review
Flexible update propagation for weakly consistent replication
Proceedings of the sixteenth ACM symposium on Operating systems principles
RecPlay: a fully integrated practical record/replay system
ACM Transactions on Computer Systems (TOCS)
Causality representation and cancellation mechanism in time warp simulations
Proceedings of the fifteenth workshop on Parallel and distributed simulation
Non-Intrusive Detection of Synchronization Errors Using Execution Replay
Automated Software Engineering
Concurrent Knowledge and Logical Clock Abstractions
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
An Autonomous Data Coherency Protocol for Mobile Devices
MDA '99 Proceedings of the First International Conference on Mobile Data Access
Optimistic voting for managing replicated data
Journal of Computer Science and Technology
The Hash History Approach for Reconciling Mutual Inconsistency
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
On reducing the complexity of matrix clocks
Parallel Computing
Log-Structured Storage for Efficient Weakly-Connected Replication
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
The power of logical clock abstractions
Distributed Computing
The space complexity of long-lived and one-shot timestamp implementations
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Agreeing to agree: conflict resolution for optimistically replicated data
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Research: Debugging tool for distributed Estelle programs
Computer Communications
The Space Complexity of Long-Lived and One-Shot Timestamp Implementations
Journal of the ACM (JACM)
| Hi-index | 0.00 |
A replicated database architecture is described in which updates processed at a site must be saved to allow reconcilliation of newly arriving updates in a way that preserves mutual consistency. The storage space occupied by the saved updates increases indefinitely, and periodic discarding of old updates is needed to avoid running out of storage. A protocol is described which allows sites in the system to agree that updates older than a given timestamp are no longer needed and can be discarded. This protocol uses a "distributed snapshot" algorithm of Chandy and Lamport and represents a practical application of that algorithm. A protocol for permanent removal of sites is also described, which will allow the discarding of updates to continue when one or more sites crash and are expected not to recover.