Calculs approchés de la borne inférieure de valeurs réparties
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 31 (1997) no. 4, pp. 305-330. 
@article{ITA_1997__31_4_305_0,
     author = {Charron-Bost, Bernadette and Tel, G\'erard},
     title = {Calculs approch\'es de la borne inf\'erieure de valeurs r\'eparties},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {305--330},
     publisher = {EDP-Sciences},
     volume = {31},
     number = {4},
     year = {1997},
     mrnumber = {1605784},
     zbl = {0892.68042},
     language = {fr},
     url = {http://archive.numdam.org/item/ITA_1997__31_4_305_0/}
}
TY  - JOUR
AU  - Charron-Bost, Bernadette
AU  - Tel, Gérard
TI  - Calculs approchés de la borne inférieure de valeurs réparties
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1997
SP  - 305
EP  - 330
VL  - 31
IS  - 4
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1997__31_4_305_0/
LA  - fr
ID  - ITA_1997__31_4_305_0
ER  - 
%0 Journal Article
%A Charron-Bost, Bernadette
%A Tel, Gérard
%T Calculs approchés de la borne inférieure de valeurs réparties
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1997
%P 305-330
%V 31
%N 4
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1997__31_4_305_0/
%G fr
%F ITA_1997__31_4_305_0
Charron-Bost, Bernadette; Tel, Gérard. Calculs approchés de la borne inférieure de valeurs réparties. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 31 (1997) no. 4, pp. 305-330. http://archive.numdam.org/item/ITA_1997__31_4_305_0/

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. | MR

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. | MR

5. E. W. Dijkstra et C. S. Scholten, Termination detection for diffusing computations. Inf. Process. Lett., 1980, 11, 1, p. 1-4. | MR | Zbl

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. | MR | Zbl

9. L. Lamport, Time, clocks, and the ordering of events in a distributed system. Commun. ACM, 1978, 21, p. 558-564. | Zbl

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. | Zbl

15. G. Tel, Topics in Distributed Algorithms, tome 1 de Cambridge Int. Series on Parallel Computation. Cambridge University Press, Cambridge, 1991. | Zbl

16. G. Tel, Introduction to Distributed Algorithms. Cambridge University Press, Cambridge, 1994. | Zbl