Gianluigi Alari

Learn More
In this paper we present a new probabilistic clock synchronization algorithm, its prototype implementation and experimental results. The algorithm follows the client-server programming paradigm and is designed to work in a departmental environment with few servers and a number of clients connected through an arbitrary network topology. At the core of the(More)
We present a deterministic distributed depth rst token passing protocol on a rooted network This protocol does not use either the processor identi ers or the size of the network but as sumes the existence of a distinguished processor called the root of the network The protocol is self stabilizing meaning that starting from an arbitrary state in response to(More)
Instead of immediately replying as in [cri89], the master records the value of its clock and continues its work. During the next FME, it inserts the previously recorded value and the actual value of its clock in the message to the server. If the server measures the entire round trip delay, it can obtain an approximation of the value of the master clock(More)
A self stabilizing distributed system is a network of state machines which, regardless of its initial global state, once started will regain its consistency by itself in a nite number of steps. Two are the main issues in the design of a self-stabilizing system: stabilization time and memory requirements. In this paper we present an almost two state self(More)
  • 1