Abstract
This paper analyzes computation of causality relationships in distributed systems. We give a formal framework based upon partial orders for this study. The initial algorithm dealing with reconstruction of the causal past of given events is greatly improved. We show a greedy algorithm whose complexity is O(S2) where S is the number of processes involved in the system. Furthermore, distributed implementation of our algorithm is optimal since it uses only messages.
This work was partially supported by the french PRC C3
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Adam, M., Hurfin, M., Raynal, M., Plouzeau N.: Distributed debugging techniques. Research Report 1459 INRIA, Rennes France (1991)
Baldy, P., Dicky, H., Medina, R., Morvan, M., Vilarem, J.-F.: Efficient reconstruction of the causal relationship in distributed computations. Research Report LIRMM 92-013, LIRMM, Montpellier France (1992)
Charron-Bost, B.: Mesures de la concurrence et du parallélisme des calculs répartis. PhD thesis, Universit'e Paris VII, Paris France (1992)
Cooper, R., Marzullo, K.: Consistent detection of global predicates. In Proc. ACM/ONR Workshop on Parallel and Distributed Debugging Santa-Cruz, California (1991) 163–173
Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. Proc. 19th Annual Symposium on the Theory of Computation (1987) 1–6
Fidge, C. J.: Timestamps in message-passing systems that preserve the partial ordering. Proc. 11th Australian Computer Science Conference, University of Queensland Australia (1988) 55–66
Fowler, J., Zwaenepoel, W.: Causal distributed breakpoints. Proc. 10th Int. Conference on Distributed Computing Systems, Paris France (1990) 134–141
Hseush, W., Kaiser, G.E.: Modeling concurrency in parallel debugging. ACM SIGPLAN Notices 25(3) (1990) 11–20
Haban, D., Weigel, W.: Global events and global breakpoints in distributed systems. Proc. 21th Annual Hawaii Int. Conference on System Sciences (1988) 166–175
Lamport, L.: Time, clocks and the ordering of events in a distributed system. Communications of the ACM, 21(3) (1978) 558–565
Mattern, F.: Virtual time and global states of distributed systems. In M. Cosnard et al. editor, Parallel and Distributed Algorithms (1989) Elsevier / North-Holland 215–226
Medina, R.: Incremental garbage collection for causal relationship computation in distributed systems. Proc. 5th IEEE Symposium on Parallel and Distributed Processing (1993) 650–655
Morvan, M.: Algoritmes linéaires et invariants d'ordres. PhD thesis, Université de Montpellier II, Montpellier France (1991)
Raynal, M., Schiper, A., Toueg, S.: The causal ordering abstraction and a simple way to implement it. Information Processing Letters 39 (1991) 343–350
Schwarz, R., Mattern, F.: Detecting causal relationships in distributed computations: in search of the holy-grail. To appear in Distributed Computing.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baldy, P., Dicky, H., Medina, R., Morvan, M., Vilarem, J.F. (1994). Efficient reconstruction of the causal relationship in distributed systems. In: Cosnard, M., Ferreira, A., Peters, J. (eds) Parallel and Distributed Computing Theory and Practice. CFCP 1994. Lecture Notes in Computer Science, vol 805. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58078-6_10
Download citation
DOI: https://doi.org/10.1007/3-540-58078-6_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58078-2
Online ISBN: 978-3-540-48435-6
eBook Packages: Springer Book Archive