Adaptive plausible clocks
Adaptive plausible clocks
复制标题
自适应合理时钟
DOI：
10.1109/icdcs.2004.1281571
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
M. Papatriantafilou
中科院分区：
文献类型：
--
作者：
Anders Gidenstam;M. Papatriantafilou
具有高因果排序精度的小尺寸逻辑时钟是有用的，特别是在以下情况下：（i）事件之间的因果依赖关系的知识的精度意味着节省时间开销，以及（ii）传输全向量时钟时间戳（其精确地确定因果关系）的成本高。在分布式系统中，只要事件是因果相关的，合理的时钟就可以作为时间戳，以与因果顺序一致的方式对事件进行排序。我们介绍了非均匀映射的R-条目向量（NUREV）的时钟，一般类的似是而非的时钟，允许准确性适应，我们分析的方式，这些时钟可能与因果关系独立的事件对。我们的分析得出了一系列结论，并制定了新的自适应合理时钟算法，即使时钟条目的数量非常少，准确性也得到了提高，这在点对点通信系统中非常重要。
Having small-sized logical clocks with high causal-ordering accuracy is useful, especially where (i) the precision of the knowledge of the causal dependencies among events implies savings in time overhead and (ii) the cost of transmitting full vector clock timestamps - that precisely characterise the causal relation - is high. Plausible clocks can be used as timestamps to order events in a distributed system in a way that is consistent with the causal order as long as the events are causally dependent. We introduce the nonuniformly mapped R-entries vector (NUREV) clocks, a general class of plausible clocks that allow accuracy adaptation and we analyse the ways that these clocks may relate causally independent event pairs. Our analysis resulted in a set of conclusions and the formulation of new, adaptive plausible clocks algorithms, with improved accuracy, even when the number of clock entries is very small, which is important in peer-to-peer communication systems.