Keeping track of the latest gossip in a distributed system

Mukund, Madhavan ; Sohoni, Milind (1997) Keeping track of the latest gossip in a distributed system Distributed Computing, 10 (3). pp. 137-148. ISSN 0178-2770

Full text not available from this repository.

Official URL:

Related URL:


We tackle a natural problem from distributed computing, involving time-stamps. Let ?={p1, p2, …, pN} be a set of computing agents or processes which synchronize with each other from time to time and exchange information about themselves and others. The gossip problem is the following: Whenever a set P⊆? meets, the processes in P must decide amongst themselves which of them has the latest information, direct or indirect, about each agent p in the system. We propose an algorithm to solve this problem which is finite-state and local. Formally, this means that our algorithm can be implemented as an asynchronous automaton.

Item Type:Article
Source:Copyright of this article belongs to Springer-Verlag.
Keywords:Distributed Algorithms; Synchronous Communication; Bounded time-stamps; Asynchronous Automata
ID Code:114223
Deposited On:25 May 2018 04:43
Last Modified:25 May 2018 04:43

Repository Staff Only: item control page