CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Adaptive Plausible Clocks

Anders Gidenstam (Institutionen för datavetenskap, Datakommunikation och Distribuerade System) ; Marina Papatriantafilou (Institutionen för datavetenskap, Datakommunikation och Distribuerade System)
Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS 2004) p. 86--93. (2004)
[Konferensbidrag, refereegranskat]

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.

Nyckelord: clocks, computer networks, distributed algorithm, NUREV, adaptive plausible clock, distributed system, logical clock timestamps, nonuniformly mapped R-entries vector clock, peer-to-peer communication system

Denna post skapades 2006-08-25. Senast ändrad 2013-06-19.
CPL Pubid: 1578


Läs direkt!

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för datavetenskap, Datakommunikation och Distribuerade System (2002-2004)


Information Technology

Chalmers infrastruktur

Relaterade publikationer

Denna publikation ingår i:

Synchronization and consistency in concurrent systems

Algorithms for synchronization and consistency in concurrent system services