Summary
Events in a distributed global computation framework, unlike those in a sequential local computation, form a partially ordered set with respect to the causality relation revealed by timestamps. This paper describes a new logical timestamping mechanism based on multicasting, called Collective Logical Time, and compares it with other known schemes that have been developed in the domain mainly to help in detecting undesired (global) properties of distributed computations (such as deadlock). Unfortunately, due to excessive complexity and some unrealistic restrictions (such as a fixed number of processes), these schemes have produced limited results. Some of the benefits in using our scheme are revealed, together with the possibilities for direct applications in the development of low-level communication protocols.
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
Lamport, L.: Time, Clocks, and the Ordering of Events in a Distributed System. Comm. ACM 21(7), 558–565 (1978)
Charron-Bost, B.: Concerning the Size of Logical Clocks in Distributed Systems. Information Processing Letters 39, 11–16 (1991)
Fidge, C.J.: Fundamentals of Distributed System Observation. IEEE Software 13(6), 77–83 (1996)
Landes, T.: Dynamic Vector Clocks for Consistent Ordering of Events in Dynamic Distributed Applications. In: Arabnia, H.R. (ed.) Proc. Intl. Conference on Parallel and Distributed Processing Techniques and Applications, Las Vegas, Nevada, vol. 1, pp. 31–37 (2006)
Raynal, M., Singhal, M.: Logical Time: Capturing Causality in Distributed Systems. IEEE Computer 29(2), 49–56 (1996)
Schwarz, R., Mattern, F.: Detecting Causal Relationships in Distributed Computations: In Search of the Holy Grail. Distr. Computing 7(3), 149–174 (1994)
Basten, T.a.o.: Vector Time and Causality among Abstract Events in Distributed Computations, TR-NSERC, University of Waterloo, Canada, pp.1-33 (1996)
Santoro, N.: Design and Analysis of Distributed Algorithms. John Wiley and Sons, Chichester (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mocanu, M., Guţuleac, E. (2008). Understanding Distributed Program Behavior Using a Multicast Communication Scheme. In: Badica, C., Mangioni, G., Carchiolo, V., Burdescu, D.D. (eds) Intelligent Distributed Computing, Systems and Applications. Studies in Computational Intelligence, vol 162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85257-5_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-85257-5_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85256-8
Online ISBN: 978-3-540-85257-5
eBook Packages: EngineeringEngineering (R0)