Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Keeping track of the latest gossip in a distributed system

  • 76 Accesses

  • 20 Citations


 We tackle a natural problem from distributed computing, involving time-stamps. Let ?={p 1, p 2, …, p N } 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.

This is a preview of subscription content, log in to check access.

Author information

Additional information

Received: December 1994 / Accepted: July 1996

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Mukund, M., Sohoni, M. Keeping track of the latest gossip in a distributed system. Distrib Comput 10, 137–148 (1997). https://doi.org/10.1007/s004460050031

Download citation

  • Key words: Distributed algorithms
  • Synchronous communication
  • Bounded time-stamps
  • Asynchronous automata