Please use this identifier to cite or link to this item:
|Title:||Keeping track of the latest gossip in shared memory systems|
|Citation:||FST TCS 2000: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS,1974,477-488|
|Abstract:||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 , and for synchronously communicating systems . Our algorithm uses a modified version of the consume and update protocols of Dwork and Waarts , 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.|
|Appears in Collections:||Proceedings papers|
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.