On the minimal information to encode timestamps in distributed computations

Authors:
Roberto Baldoni;Giovanna Melideo
Affiliations:
Dipartimento di Informatica e Sistemistica, University of Rome "La Sapienza ", Via Salaria I13, 00198 Roma, Italy;Dipartimento di Matematica Pura ed Applicata, University of L'Aquila, Via Vetoio - Loc. Coppito, 67100 L'Aquila, Italy
Venue:
Information Processing Letters
Year:
2002

Citing 5
Cited 0

Concerning the size of logical clocks in distributed systems

Information Processing Letters
An efficient implementation of vector clocks

Information Processing Letters
Logical Time: Capturing Causality in Distributed Systems

Computer
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
Detecting causal relationships in distributed computations: in search of the holy grail

Distributed Computing

Quantified Score

Hi-index	0.89

Visualization

Abstract

Timestamping protocols are used to capture the causal order or the concurrency of events in asynchronous distributed computations. In this paper we give an answer to the open problem issued by Schwarz and Mattern [Distrib. Comput. 7 (3) (1994) 149-174] about the minimum amount of information managed by protocols which represent causality in an isomorphic way. We point out that to encode each timestamp an amount of non-structured information (i.e., the number of bits) of ⌈log2((m+1)n - Σk=3n(nk)(2k-35))⌉ bits is necessary.