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 [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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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
K. M. Chandy and L. Lamport: Distributed Snapshots: Determining Global States of Distributed Systems, ACM Transactions on Computer Systems 3(1) (1985) 63–75.
C. Dwork and O. Waarts: Bounded Concurrent Timestamp Systems are Compre-hensible!, Proc. ACM STOC (1992) 655–666.
N. A. Lynch: Distributed Algorithms, Morgan Kaufmann (1996).
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
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.
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.
M. Mukund and M. Sohoni: Keeping Track of the Latest Gossip in a Distributed System, Distributed Computing, 10(3) (1997) 137–148.
P. S. Thiagarajan: TrPTL: A Trace Based Extension of Linear Time Temporal Logic, Proc. 9th IEEE LICS (1994) 438–447.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Adsul, B., Mehta, A., Sohoni, M. (2000). Keeping Track of the Latest Gossip in Shared Memory Systems. In: Kapoor, S., Prasad, S. (eds) FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2000. Lecture Notes in Computer Science, vol 1974. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44450-5_39
Download citation
DOI: https://doi.org/10.1007/3-540-44450-5_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41413-1
Online ISBN: 978-3-540-44450-3
eBook Packages: Springer Book Archive