Please use this identifier to cite or link to this item:
Title: Keeping track of the latest gossip in a distributed system
Authors: MUKUND, M
Keywords: Asynchronous Cellular-Automata
Issue Date: 1997
Citation: DISTRIBUTED COMPUTING, 10(3), 137-148
Abstract: We tackle a natural problem from distributed computing, involving time-stamps. Let P = {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 subset of or equal to 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.
ISSN: 0178-2770
Appears in Collections:Article

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.