Bounded concurrrent time-stamp systems are constructible
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Distributed computing: models and methods
Handbook of theoretical computer science (vol. B)
The causal ordering abstraction and a simple way to implement it
Information Processing Letters
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Asynchronous mappings and asynchronous cellular automata
Information and Computation
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Tutorial on message sequence charts
Computer Networks and ISDN Systems - Special issue on SDL and MSC
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Linear Time Temporal Logics over Mazurkiewicz Traces
MFCS '96 Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science
A New Algorithm to Implement Causal Ordering
Proceedings of the 3rd International Workshop on Distributed Algorithms
Approximation of a TRace, Asynchronous Automata and the Ordering of Events in a Distributed System
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Robust Asynchronous Protocols Are Finite-State
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Keeping track of the latest gossip in a distributed system
Distributed Computing
A theory of regular MSC languages
Information and Computation
Bandwidth guaranteed multicast scheduling for virtual output queued packet switches
Journal of Parallel and Distributed Computing
A theory of regular MSC languages
Information and Computation
Synthesis of safe message-passing systems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Products of message sequence charts
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Causal closure for MSC languages
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Hi-index | 5.23 |
Consider a distributed system running a protocol in which processes exchange information by passing messages. The gossip problem for the protocol is the following: Whenever a process q receives a message from another process p, q must be able to decide which of p and q has more recent information about r, for every other process r in the system. With this data, q is in a position to update its knowledge about the global state of the system.We propose a solution wherein to each message of the protocol, the sender adds information about its current state of knowledge about other processes. We do not add any new messages to the underlying computation. The additional information tagged onto each message is uniformly bounded if the channels are bounded. This means that for systems with bounded channels, the overhead of maintaining the latest gossip is a constant, independent of the length of the underlying computation. Moreover, gossip information can be used to implement bounded channels by inhibiting the sending of new messages over channels that are potentially full.Our solution to the gossip problem has several applications in the analysis of distributed systems. Many distributed algorithms rely, either explicitly or implicitly, on the local information available at a process about the global state of the system. Using our scheme, each process can ensure that during a computation it always maintains the best possible information about every other process. At a theretical level, the gossip problem plays an important role in formal characterizations of finite-state message-passing systems.