Providing high availability using lazy replication
ACM Transactions on Computer Systems (TOCS)
Manetho: Transparent Roll Back-Recovery with Low Overhead, Limited Rollback, and Fast Output Commit
IEEE Transactions on Computers - Special issue on fault-tolerant computing
Managing update conflicts in Bayou, a weakly connected replicated storage system
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
Trade-offs in implementing causal message logging protocols
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Experience with distributed replicated objects: the Nile project
Theory and Practice of Object Systems - Special issue high availability in CORBA
Future Generation Computer Systems - Special issue on metacomputing
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Message Logging: Pessimistic, Optimistic, Causal, and Optimal
IEEE Transactions on Software Engineering
The Globus Project: A Status Report
HCW '98 Proceedings of the Seventh Heterogeneous Computing Workshop
Scalable Causal Message Logging for Wide-Area Environments
Scalable Causal Message Logging for Wide-Area Environments
Hi-index | 0.01 |
Causal message logging spread recovery information around the network in which the processes execute. This is an attractive property for wide area networks: it can be used to replicate processes that are otherwise inaccessible due to network partitions. However, current causal message logging protocols do not scale to thousands ofp rocesses. We describe the Hierarchical Causal Logging Protocol (HCML) that is scalable. It uses a hierarchy of proxies to reduce the amount ofin formation a process needs to maintain. Proxies also act as caches for recovery information and reduce the overall message overhead by as much as 50%. HCML also leverages differences in bandwidth between processes that reduces overall message latency by as much as 97%.