Free Access
RAIRO-Theor. Inf. Appl.
Volume 31, Number 4, 1997
Page(s) 305 - 330
Published online 01 February 2017
  1. 1. K. M. CHANDY et L. LAMPORT, Distributed snapshots: Determining global states of distributed systems. ACM Trans. Comput. Syst., 1985, 3, 1, p. 63-75. [Google Scholar]
  2. 2. B. CHARRON-BOST, Mesures de la Concurrence et du Parallélisme des Calculs Répartis. Thèse de doctorat, Université Paris VII, 1989. [Google Scholar]
  3. 3. B. CHARRON-BOST, F. MATTERN et G. TEL, Synchronous, asynchronous, and causally ordered communication, Distributed Computing, 1996, 9, 4, p. 173-191. [MR: 1380838] [Google Scholar]
  4. 4. E. W. DIJKSTRA, W. H. J. FEIJEN et A. J. M. VAN GASTEREN, Derivation of a termination detection algorithm for distributed computations. Inf. Process. Lett., 1983, 16, 5, p. 217-219. [Zbl: 0566.68025] [MR: 709657] [Google Scholar]
  5. 5. E. W. DIJKSTRA et C. S. SCHOLTEN, Termination detection for diffusing computations. Inf. Process. Lett., 1980, 11, 1, p. 1-4. [MR: 585394] [Zbl: 0439.68039] [Google Scholar]
  6. 6. J. HUGHES, A distributed garbage collection algorithm. Dans Functional Programming Language and Computer Architecture, 1985, p. J. P. Jouannaud, Ed., tome 201 de Lecture Notes in Computer Science, Springer-Verlag, p. 256-272. [Google Scholar]
  7. 7. D. JEFFERSON, Virtual time. ACM Trans. Program. Lang. Syst., 1985, 7, 3, p. 404-425. [Google Scholar]
  8. 8. T. H. LAI et T. H. YANG, On distributed snapshots. Inf. Process. Lett., 1987, 25, p. 153-158. [MR: 896409] [Zbl: 0653.68008] [Google Scholar]
  9. 9. L. LAMPORT, Time, clocks, and the ordering of events in a distributed system. Commun. ACM, 1978, 21, p. 558-564. [Zbl: 0378.68027] [Google Scholar]
  10. 10. F. MATTERN, Algorithms for distributed termination detection. Distributed Computing, 1987, 2, 3, p. 161-175. [Google Scholar]
  11. 11. F. MATTERN, H. MEHL, A. A. SCHOONE et G. TEL, Global virtual time approximation with distributed termination detection algorithms. Rapport RUU-CS-91-32, Dept d'Informatique, Université d'Utrecht, Pays Bas, Sept. 1991. [Google Scholar]
  12. 12. S. K. SARIN et N. A. LYNCH, Discarding obsolete information in a replicated database system. IEEE Trans. Softw. Eng. SE-13, 1987, p. 39-47. [Google Scholar]
  13. 13. A. SCHIPER, J. EGGLI et A. SANDOZ, A new algorithm to implement causal ordering. Dans Int. Workshop on Distributed Algorithms, 1989, p. J.-C. Bermond et M. Raynal, Eds., tome 392 de Lecture Notes in Computer Science, Springer-Verlag, p. 219-232. [Google Scholar]
  14. 14. R. Schwartz et F. MATTERN, Detecting causal relationships in distributed computations: In search of the holy grail. Distributed Computing, 1994, 7, 3, p. 149-174. [Zbl: 0813.68096] [Google Scholar]
  15. 15. G. TEL, Topics in Distributed Algorithms, tome 1 de Cambridge Int. Series on Parallel Computation. Cambridge University Press, Cambridge, 1991. [Zbl: 0755.68062] [Google Scholar]
  16. 16. G. TEL, Introduction to Distributed Algorithms. Cambridge University Press, Cambridge, 1994. [Zbl: 0826.68056] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.