Beyond Lamport's Happened-before

The coordination of a sequence of actions, to be performed in a linear temporal order in a distributed system, is studied. While in asynchronous message-passing systems such ordering of events requires the construction of message chains based on Lamport's happened-before relation, this is no longer true in the presence of time bounds on message delivery. Given such bounds, the mere passage of time can provide information about the occurrence of events at remote sites, without the need for explicit confirmation. A new causal structure called the centipede is introduced, and it is shown that centipedes must exist in every execution where linear ordering of actions is ensured. Centipedes capture the subtle interplay between the explicit information obtained via message chains, and the indirectly derived information gained by the passage of time, given the time bounds. Centipedes are defined using two relations. One is called syncausality, a slight generalisation of the happened-before relation. The other is a novel bound guarantee relation among events, that is based on the bounds on message transmission. In a precise sense, centipedes play a role in the synchronous setting analogous to that played by message chains in asynchronous systems. Our study is based on a knowledge-based analysis of distributed coordination. Temporally linear coordination is reduced to nested knowledge (knowledge about knowledge). Obtaining nested knowledge of a spontaneous event is, in turn, shown to require the existence of an appropriate centipede.

[1]  Yoram Moses,et al.  Knowledge, timed precedence and clocks (preliminary report) , 1994, PODC '94.

[2]  Leslie Lamport,et al.  Using Time Instead of Timeout for Fault-Tolerant Distributed Systems. , 1984, TOPL.

[3]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[4]  David Lewis Convention: A Philosophical Study , 1986 .

[5]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[6]  Maurice Herlihy,et al.  The topological structure of asynchronous computability , 1999, JACM.

[7]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[8]  Michael O. Rabin,et al.  How To Exchange Secrets with Oblivious Transfer , 2005, IACR Cryptol. ePrint Arch..

[9]  Yoram Moses,et al.  Beyond Lamport's Happened-Before: On the Role of Time Bounds in Synchronous Systems , 2010, DISC.

[10]  Rohit Parikh Levels of Knowledge in Distributed Computing , 1986, LICS.

[11]  Yoram Moses,et al.  On interactive knowledge with bounded communication , 2011, J. Appl. Non Class. Logics.

[12]  Rohit Parikh,et al.  Levels of knowledge in distributed systems , 1992 .

[13]  Jon M. Kleinberg,et al.  The structure of information pathways in a social communication network , 2008, KDD.

[14]  Rohit Parikh Finite and Infinite Dialogues , 1992 .

[15]  Jelle Gerbrandy,et al.  Dynamic epistemic logic , 1998 .

[16]  John McCarthy,et al.  SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE , 1987 .

[17]  R. Kirk CONVENTION: A PHILOSOPHICAL STUDY , 1970 .

[18]  Siobhan Chapman Logic and Conversation , 2005 .

[19]  Joseph Y. Halpern,et al.  Knowledge and common knowledge in a distributed environment , 1984, JACM.

[20]  Joao Antonio Pereira,et al.  Linked: The new science of networks , 2002 .

[21]  K. Mani Chandy,et al.  How processes learn , 1985, PODC '85.

[22]  Ramaswamy Ramanujam,et al.  Knowledge and the Ordering of Events in Distributed Systems , 1994, TARK.

[23]  Hermann Kopetz,et al.  Real-time systems , 2018, CSC '73.

[24]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[25]  Yoram Moses,et al.  Timely Common Knowledge , 2013, TARK.

[26]  Boaz Patt-Shamir,et al.  A theory of clock synchronization (extended abstract) , 1994, STOC '94.

[27]  Yoram Moses,et al.  Knowledge and communication: a tutorial , 1992 .

[28]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[29]  Joseph Y. Halpern,et al.  Knowledge, probability, and adversaries , 1993, JACM.

[30]  Polly S Nichols,et al.  Agreeing to disagree. , 2005, General dentistry.

[31]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[32]  Yoram Moses,et al.  Agent-Time Epistemics and Coordination , 2012, ICLA.

[33]  Mark S. Granovetter The Strength of Weak Ties , 1973, American Journal of Sociology.

[34]  Yoram Moses,et al.  Known unknowns: time bounds and knowledge of ignorance , 2011, TARK XIII.

[35]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .