Keeping track of the latest gossip in a distributed system

DSpace/Manakin Repository

Keeping track of the latest gossip in a distributed system

Show full item record

Title: Keeping track of the latest gossip in a distributed system
Author: MUKUND, M; SOHONI, M
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.
URI: http://dx.doi.org/10.1007/s004460050031
http://dspace.library.iitb.ac.in/xmlui/handle/10054/12264
http://hdl.handle.net/10054/12264
Date: 1997


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show full item record

Search DSpace


Advanced Search

Browse

My Account