Abstract
Lamport’s Happened-before relation is fundamental to coordinating actions in asynchronous systems. Its role is less dominant in synchronous systems, in which bounds are available on transmission times over channels. This paper initiates a study of the role that time bounds play in synchronous systems by focusing on two classes of problems: Ordered Response, in which a triggering event must be followed by a sequence of events (“responses”) performed in a prescribed temporal order, and Simultaneous Response, in which the responses must be performed simultaneously. In both cases, information about the triggering event must flow from its site of origin to the responding sites, and the responses must be timed as specified. A generalization of happened- before called Syncausality, is defined. A pattern of communication consisting of a syncausal chain coupled with an appropriate set of time bound guarantees gives rise to a communication structure called a centipede. Centipedes are a nontrivial generalization of message chains, and their existence is shown to be necessary in every execution of every protocol that solves ordered response. A variation on centipedes called centibrooms are shown to play an analogous role for Simultaneous Response: Every execution of a protocol for Simultaneous Response must contain a centibroom.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aumann, R.J.: Agreeing to disagree. Annals of Statistics 4(6), 1236–1239 (1976)
Ben-Zvi, I., Moses, Y.: Sufficient conditions for knowledge gain and information flow in synchronous systems (2010) (in preparation)
Chandy, K.M., Misra, J.: How processes learn. Distributed Computing 1(1), 40–52 (1986)
Clark, H.H., Marshall, C.R.: Definite reference and mutual knowledge. In: Joshi, A.K., Webber, B.L., Sag, I.A. (eds.) Elements of Discourse Understanding. Cambridge University Press, Cambridge (1981)
Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transactions on Information Theory 22(5), 644–654 (1976)
Dwork, C., Moses, Y.: Knowledge and common knowledge in a Byzantine environment: crash failures. Information and Computation 88(2), 156–186 (1990)
Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Common knowledge revisited. In: Proc. 6th TARK, pp. 283–298. Morgan Kaufmann, San Francisco (1996)
Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about Knowledge. MIT Press, Cambridge (2003)
Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM Journal on Computing 18(1), 186–208 (1989)
Grice, H.P.: Logic and conversation, pp. 41–58 (1975)
Hadzilacos, V., Halpern, J.Y.: Message-optimal protocols for byzantine agreement. Mathematical Systems Theory 26(1), 41–102 (1993)
Halpern, J.Y., Moses, Y.: Knowledge and common knowledge in a distributed environment. Journal of the ACM 37(3), 549–587 (1990)
Krasucki, P.J., Ramanujam, R.: Knowledge and the ordering of events in distributed systems (extended abstract). In: Proc. 5th TARK, pp. 267–283. Morgan Kaufmann, San Francisco (1994)
Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 21(7), 558–565 (1978)
Lewis, D.: Convention, A Philosophical Study. Harvard University Press, Cambridge (1969)
McCarthy, J., Hayes, P.J.: Some philosophical problems from the standpoint of artificial intelligence. In: Michie, D. (ed.) Machine Intelligence, vol. 4, pp. 463–502. Edinburgh University Press, Edinburgh (1969)
Mizrahi, T., Moses, Y.: Continuous consensus via common knowledge. Distributed Computing 20(5), 305–321 (2008)
Moses, Y., Bloom, B.: Knowledge, timed precedence and clocks. In: Proc. 13th ACM Symp. on Principles of Distributed Computing, pp. 294–303 (1994)
Moses, Y., Tuttle, M.R.: Programming simultaneous actions using common knowledge. Algorithmica 3, 121–169 (1988)
Moses, Y.: Knowledge and communication: a tutorial. In: Proc. 4th TARK, pp. 1–14. Morgan Kaufmann, San Francisco (1992)
Parikh, R.: Finite and infinite dialogues. In: Moschovakis, Y.N. (ed.) Logic from Computer Science, MSRI Publication No. 21, pp. 481–497. Springer, Heidelberg (1991)
Parikh, R., Krasucki, P.: Levels of knowledge in distributed computing. Sādhanā 17(1), 167–191 (1992)
Patt-Shamir, B., Rajsbaum, S.: A theory of clock synchronization (extended abstract). In: Proc. 26th ACM STOC, pp. 810–819 (1994)
Rabin, M.O.: How to exchange secrets with oblivious transfer. Cryptology ePrint Archive, Report 2005/187 (2005), Originally written in (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ben-Zvi, I., Moses, Y. (2010). Beyond Lamport’s Happened-Before: On the Role of Time Bounds in Synchronous Systems. In: Lynch, N.A., Shvartsman, A.A. (eds) Distributed Computing. DISC 2010. Lecture Notes in Computer Science, vol 6343. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15763-9_42
Download citation
DOI: https://doi.org/10.1007/978-3-642-15763-9_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15762-2
Online ISBN: 978-3-642-15763-9
eBook Packages: Computer ScienceComputer Science (R0)