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

Bernadette Charron-Bost; Gérard Tel

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1997)

  • Volume: 31, Issue: 4, page 305-330
  • ISSN: 0988-3754

How to cite

top

Charron-Bost, Bernadette, and 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 31.4 (1997): 305-330. <http://eudml.org/doc/92564>.

@article{Charron1997,
author = {Charron-Bost, Bernadette, Tel, Gérard},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {distributed infinimum approximation; global virtual time},
language = {fre},
number = {4},
pages = {305-330},
publisher = {EDP-Sciences},
title = {Calculs approchés de la borne inférieure de valeurs réparties},
url = {http://eudml.org/doc/92564},
volume = {31},
year = {1997},
}

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
PB - EDP-Sciences
VL - 31
IS - 4
SP - 305
EP - 330
LA - fre
KW - distributed infinimum approximation; global virtual time
UR - http://eudml.org/doc/92564
ER -

References

top
  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. 
  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. 
  3. 3. B. CHARRON-BOST, F. MATTERN et G. TEL, Synchronous, asynchronous, and causally ordered communication, Distributed Computing, 1996, 9, 4, p. 173-191. MR1380838
  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. Zbl0566.68025MR709657
  5. 5. E. W. DIJKSTRA et C. S. SCHOLTEN, Termination detection for diffusing computations. Inf. Process. Lett., 1980, 11, 1, p. 1-4. Zbl0439.68039MR585394
  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. 
  7. 7. D. JEFFERSON, Virtual time. ACM Trans. Program. Lang. Syst., 1985, 7, 3, p. 404-425. 
  8. 8. T. H. LAI et T. H. YANG, On distributed snapshots. Inf. Process. Lett., 1987, 25, p. 153-158. Zbl0653.68008MR896409
  9. 9. L. LAMPORT, Time, clocks, and the ordering of events in a distributed system. Commun. ACM, 1978, 21, p. 558-564. Zbl0378.68027
  10. 10. F. MATTERN, Algorithms for distributed termination detection. Distributed Computing, 1987, 2, 3, p. 161-175. 
  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. 
  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. 
  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. 
  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. Zbl0813.68096
  15. 15. G. TEL, Topics in Distributed Algorithms, tome 1 de Cambridge Int. Series on Parallel Computation. Cambridge University Press, Cambridge, 1991. Zbl0755.68062
  16. 16. G. TEL, Introduction to Distributed Algorithms. Cambridge University Press, Cambridge, 1994. Zbl0826.68056

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.