Plausible Clocks with Bounded Inaccuracy

In a distributed system with N processes, time stamps of size N (such as vector clocks) are necessary to accurately track potential causality between events. Plausible clocks are a family of time-stamping schemes that use smaller time stamps at the expense of some accuracy. To date, all plausible clocks have been designed to use fixed-sized time stamps, and the inaccuracy of these schemes varies from run to run. In this paper, we define a new metric, imprecision, that formally characterizes the fidelity of a plausible clock. We present a new plausible clock system that guarantees an arbitrary constant bound on imprecision. This bound is achieved by allowing time stamps to grow and shrink over the course of the computation. We verify the correctness of our algorithm, present results of a simulation study, and evaluate its performance.

• Type: Conference
• Year: 2005
• Where: WDAG
• Authors: Brad T. Moore, Paolo A. G. Sivilotti
• Keywords: Algorithms, Plausible Clock, Smaller Time Stamps, Time Stamps, WDAG 2005