This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
23rd IEEE International Conference on Distributed Computing Systems (ICDCS'03)
The Hash History Approach for Reconciling Mutual Inconsistency
Providence, Rhode Island
May 19-May 22
ISBN: 0-7695-1920-2
Brent ByungHoon Kang, University of California at Berkley
Robert Wilensky, University of California at Berkley
John Kubiatowicz, University of California at Berkley
We introduce the hash history mechanism for capturing dependencies among distributed replicas. Hash histories, consisting of a directed graph of version hashes, are independent of the number of active nodes but dependent on the rate and number of modifications. We present the basic hash history scheme and discuss mechanisms for trimming the history over time. We simulate the efficacy of hash histories on several large CVS traces. Our results highlight a useful property of the hash history: the ability to recognize when two different non-commutative operations produce the same output, thereby reducing false conflicts and increasing the rate of convergence. We call these events coincidental equalities and demonstrate that their recognition can greatly reduce the time to global convergence.
Citation:
Brent ByungHoon Kang, Robert Wilensky, John Kubiatowicz, "The Hash History Approach for Reconciling Mutual Inconsistency," icdcs, pp.670, 23rd IEEE International Conference on Distributed Computing Systems (ICDCS'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.