Calculs approchés de la borne inférieure de valeurs réparties

Theoretical Informatics and Applications

Volumn 31, Issue 4, 1997, Pages 305-330

  Charron Bost, Bernadette ^a   Tel, Gerard ^b  

^a ECOLE POLYTECHNIQUE   (France)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031313430     PISSN: 09883754     EISSN: 28047346     Source Type: Journal    
DOI: 10.1051/ita/1997310403051     Document Type: Article

References (16)

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.
2. B CHARRON-BOST, Mesures de la Concurrence et du Parallélisme des Calculs Répartis. Thèse de doctorat, Université Paris VII, 1989.
3. B. CHARRON-BOST, F. MATTERN et G. TEL, Synchronous, asynchronous, and causally ordered communication. Distributed Computing, 1996, 9, 4, p. 173-191.
4. E. W. DUKSTRA, 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.
5. E. W. DUKSTRA et C. S. SCHOLTEN, Termination detection for diffusing computations. Inf. Process. Lett., 1980, 11, 1, p. 1-4.
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.
7. D. JEFFERSON, Virtual time. ACM Trans. Program. Lang. Syst., 1985, 7, 3, p. 404-425.
8. T. H. LAI et T. H. YANG, On distributed snapshots. Inf. Process. Lett., 1987, 25, p. 153-158.
9. L. LAMPORT, Time, clocks, and the ordering of events in a distributed system. Commun. ACM, 1978, 21, p. 558-564.
10. F. MATTERN, Algorithms for distributed termination detection. Distributed Computing, 1987, 2, 3, p. 161-175.
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.
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.
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.
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.
15. G. TEL, Topics in Distributed Algorithms, tome 1 de Cambridge Int. Series on Parallel Computation. Cambridge University Press, Cambridge, 1991.
16. G. TEL, Introduction to Distributed Algorithms. Cambridge University Press, Cambridge, 1994.