Building a global time on parallel machines - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1989

Building a global time on parallel machines

Abstract

This paper presents a pragmatic algorithm to build a global time on any distributed system, which is optimal for homogeneous parallel machines. After some discution on time, clocks and distributed systems, we survey and criticize the classical approaches based on clock synchronisation techniques. Satisfying better our purposes, a statistical method is chosen as a building block to derive an original algorithm valid for any topology. This algorithm is particularly well suited for distributed algorithm experimentation purposes because, after an acquisition phasis, it induces neither CPU nor message overhead. We provide in the conclusion some data about its behavior and performances on some parallel machines.
Fichier principal
Vignette du fichier
nice89.pdf (193.29 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00765061 , version 1 (12-03-2019)

Identifiers

  • HAL Id : hal-00765061 , version 1

Cite

Jean-Marc Jézéquel. Building a global time on parallel machines. Proc. of the 3rd International Workshop on Distributed Algorithms, Sep 1989, Nice, France. ⟨hal-00765061⟩
99 View
161 Download

Share

Gmail Facebook X LinkedIn More