Keeping Track of the Latest Gossip in Message-Passing Systems

  • Madhavan Mukund
  • K. Narayan Kumar
  • Milind Sohoni
Conference paper
Part of the Workshops in Computing book series (WORKSHOPS COMP.)


Consider a distributed system in which processes exchange information by passing messages. The gossip problem is the following: Whenever a process q receives a message from another process p, q must be able to decide which of p and q has more recent information about r, for every other process r in the system. With this data, q is in a position to update its knowledge about the global state of the system.

We propose a solution where each message between processes carries information about the current state of knowledge of the sender. This information is uniformly bounded if we make reasonable assumptions about the number of undelivered messages present at any time in the system. This means that the overhead of maintaining the latest gossip is a constant, independent of the length of the underlying computation.


Transitive Closure Primary Graph Late Information Primary Information Message Complexity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    R. Cori, Y. Metivier: Approximations of a trace, asynchronous automata and the ordering of events in a distributed system, Proc. ICALP ’88, LNCS 317 (1988) 147–161.MathSciNetGoogle Scholar
  2. [2]
    R. Cori, Y. Metivier, W. Zlelonka: Asynchronous mappings and asynchronous cellular automata, Inform, and Comput., 106 (1993) 159–202.CrossRefMATHMathSciNetGoogle Scholar
  3. [3]
    D. Dolev, N. Shavit: Bounded concurrent time-stamps are constructible, Proc. ACM STOC (1989) 454–466.Google Scholar
  4. [4]
    A. Israeli, M. Li: Bounded time-stamps, Proc. 28th IEEE FOCS (1987) 371–382.Google Scholar
  5. [5]
    R. Krishnan, S. Venkatesh: Optimizing the gossip automaton, Report TCS- 94–3, School of Mathematics, SPIC Science Foundation, Madras, India (1994).Google Scholar
  6. [6]
    L. Lamport: Time, clocks and the ordering of events in a distributed system, Comm. ACM 17 (8) (1978) 558–565.CrossRefMathSciNetGoogle Scholar
  7. [7]
    L. Lamport, N. Lynch: Distributed Computing: Models and Methods, in: J. van Leeuwen (ed.), Handbook of Theoretical Computer Science: Volume B, North-Holland, Amsterdam (1990) 1157–1200.Google Scholar
  8. [8]
    M. Mukund, K. Narayan Kumar, M. Sohoni: Keeping track of the latest gossip in message-passing systems, Report TCS-95-3, School of Mathematics, SPIC Science Foundation, Madras, India (1995).Google Scholar
  9. [9]
    M. Mukund, M. Sohoni: Keeping track of the latest gossip: Bounded time- stamps suffice, Proc. FSTℰTCS ’93, LNCS 761 (1993) 388–399.MathSciNetGoogle Scholar

Copyright information

© British Computer Society 1995

Authors and Affiliations

  • Madhavan Mukund
    • 1
  • K. Narayan Kumar
    • 2
  • Milind Sohoni
    • 3
  1. 1.School of MathematicsSPIC Science FoundationMadrasIndia
  2. 2.Computer Science GroupTata Institute of Fundamental ResearchBombayIndia
  3. 3.Department of Computer Science and EngineeringIndian Institute of TechnologyBombayIndia

Personalised recommendations