Keeping Track of the Latest Gossip in Shared Memory Systems
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.
KeywordsShared Memory Mutual Exclusion Garbage Collection Primary Graph Primary Information
Unable to display preview. Download preview PDF.
- 1.B. Adsul, A. Mehta and M. Sohoni: Keeping Track of the Latest Gossip in Shared Memory Systems, Technical Report, Dept of CSE, IIT Bombay. Electronic version available http://www.cse.iitb.ernet.in/~abharat/gossip.html
- 3.C. Dwork and O. Waarts: Bounded Concurrent Timestamp Systems are Compre-hensible!, Proc. ACM STOC (1992) 655–666.Google Scholar
- 4.N. A. Lynch: Distributed Algorithms, Morgan Kaufmann (1996).Google Scholar
- 5.A. Mehta: Keeping Track of the Latest Gossip in Shared Memory Systems, BTech Project Report, Dept of CSE, IIT Bombay. Electronic version available http://www.cse.iitb.ernet.in/~abharat/gossip.html
- 6.M. Mukund, K. Narayan Kumar and M. Sohoni: Keeping Track of the Latest Gossip in Message-Passing Systems, Proc. Structures in Concurrency Theory (STRICT), Berlin 1995, Workshops in Computing Series, Springer-Verlag (1995) 249–263.Google Scholar
- 7.M. Mukund, K. Narayan Kumar, J. Radhakrishnan and M. Sohoni: Robust Asyn-chronous Protocols are Finite-State, Proc. 25th ICALP, Springer LNCS 1443 (1998) 188–199.Google Scholar
- 9.P. S. Thiagarajan: TrPTL: A Trace Based Extension of Linear Time Temporal Logic, Proc. 9th IEEE LICS (1994) 438–447.Google Scholar