Plausible clocks: Constant size logical clocks for distributed systems

Francisco J. Torres-Rojas, Mustaque Ahamad

Producción científica: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

25 Citas (Scopus)

Resumen

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.

Idioma originalInglés
Título de la publicación alojadaDistributed Algorithms - 10th International Workshop, WDAG 1996, Proceedings
EditoresOzalp Babaoglu, Keith Marzullo
EditorialSpringer Verlag
Páginas71-88
Número de páginas18
ISBN (versión impresa)9783540617693
DOI
EstadoPublicada - 1996
Publicado de forma externa
Evento10th International Workshop on Distributed Algorithms, WDAG 1996 - Bologna, Italia
Duración: 9 oct 199611 oct 1996

Serie de la publicación

NombreLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumen1151
ISSN (versión impresa)0302-9743
ISSN (versión digital)1611-3349

Conferencia

Conferencia10th International Workshop on Distributed Algorithms, WDAG 1996
País/TerritorioItalia
CiudadBologna
Período9/10/9611/10/96

Huella

Profundice en los temas de investigación de 'Plausible clocks: Constant size logical clocks for distributed systems'. En conjunto forman una huella única.

Citar esto