Record Details

Keeping track of the latest gossip in a distributed system

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Keeping track of the latest gossip in a distributed system
 
Creator MUKUND, M
SOHONI, M
 
Subject asynchronous cellular-automata
distributed algorithms
synchronous communication
bounded time-stamps
asynchronous automata
 
Description 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.
 
Publisher SPRINGER VERLAG
 
Date 2011-08-30T09:19:20Z
2011-12-26T12:58:52Z
2011-12-27T05:49:31Z
2011-08-30T09:19:20Z
2011-12-26T12:58:52Z
2011-12-27T05:49:31Z
1997
 
Type Article
 
Identifier DISTRIBUTED COMPUTING, 10(3), 137-148
0178-2770
http://dx.doi.org/10.1007/s004460050031
http://dspace.library.iitb.ac.in/xmlui/handle/10054/12264
http://hdl.handle.net/10054/12264
 
Language en