Skip to main navigation Skip to search Skip to main content

Plausible clocks: Constant size logical clocks for distributed systems

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

25 Scopus citations

Abstract

In a Distributed System with N sites, the detection of causal relationships between events can only be done with vector clocks of size N. This gives rise to scalability and efficiency problems for accurate logical clocks. In this paper we propose a class of logical clocks called plausible clocks that can be implemented with a number of components not affected by the size of the system and yet they provide good ordering accuracy. We develop rules to combine plausible clocks to produce more accurate clocks. Several examples of plausible clocks and their combination are presented. Using a simulation model, we evaluate the performance of these clocks.

Original languageEnglish
Title of host publicationDistributed Algorithms - 10th International Workshop, WDAG 1996, Proceedings
EditorsOzalp Babaoglu, Keith Marzullo
PublisherSpringer Verlag
Pages71-88
Number of pages18
ISBN (Print)9783540617693
DOIs
StatePublished - 1996
Externally publishedYes
Event10th International Workshop on Distributed Algorithms, WDAG 1996 - Bologna, Italy
Duration: 9 Oct 199611 Oct 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1151
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference10th International Workshop on Distributed Algorithms, WDAG 1996
Country/TerritoryItaly
CityBologna
Period9/10/9611/10/96

Fingerprint

Dive into the research topics of 'Plausible clocks: Constant size logical clocks for distributed systems'. Together they form a unique fingerprint.

Cite this