Record Details

Keeping track of the latest gossip in shared memory systems

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Keeping track of the latest gossip in shared memory systems
 
Creator ADSUL, B
MEHTA, A
SOHONI, M
 
Description In this paper we present a solution to the 'Latest Gossip Problem' for a shared memory distributed system. The Latest Gossip Problem is essentially one of bounded timestamping in which processes must locally keep track of the 'latest' information, direct or indirect, about all other processes. A solution to the Latest Gossip Problem is fundamental to the understanding of information flow in a distributed computation, and has applications to problems such as global state detection and mutual exclusion. Our solution is along the lines of that for message passing systems in [6], and for synchronously communicating systems [8]. Our algorithm uses a modified version of the consume and update protocols of Dwork and Waarts [3], where these were introduced to construct a 'Bounded Concurrent Timestamping System (BCTS)'. As applications of our Gossip Protocol, we also indicate another construction of a BCTS and a solution to the global state detection problem, which, we believe, are improvements over older solutions.
 
Publisher SPRINGER-VERLAG BERLIN
 
Date 2011-10-23T13:43:47Z
2011-12-15T09:11:11Z
2011-10-23T13:43:47Z
2011-12-15T09:11:11Z
2000
 
Type Article; Proceedings Paper
 
Identifier FST TCS 2000: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS,1974,477-488
3-540-41413-4
0302-9743
http://dspace.library.iitb.ac.in/xmlui/handle/10054/15144
http://hdl.handle.net/100/1901
 
Source 20th Conference on Foundations of Software Technology and Theoretical Computer Science,NEW DELHI, INDIA,DEC 13-15, 2000
 
Language English