Unilateral Version Vector Pruning using Loosely Synchronized Clocks

Saito, Yasushi

HP Development Company

关键词: replication;    version vector;    vector clock;    distributed system;   

RP-ID  :  HPL-2002-51

学科分类：计算机科学（综合）

美国|英语

来源: HP Labs

【 摘 要 】

This paper presents a new lightweight algorithm for pruning inactive entries in version vectors (VVs). This algorithm lets each node remove inactive VV entries without any coordination with other nodes. It achieves this feature by devising a new way to compare two version vectors based on loosely synchronized clocks and placing a timing restriction on the behavior of the application. VVs computed by our algorithm can accurately and completely capture the "happened-before" relation between events just like ordinary VVs. This paper proves the correctness of our algorithm as well. 8 Pages