On the hierarchy of functioning rules in distributed computing

A. Bui; M. Bui; C. Lavault

RAIRO - Operations Research - Recherche Opérationnelle (1999)

  • Volume: 33, Issue: 1, page 15-27
  • ISSN: 0399-0559

How to cite

top

Bui, A., Bui, M., and Lavault, C.. "On the hierarchy of functioning rules in distributed computing." RAIRO - Operations Research - Recherche Opérationnelle 33.1 (1999): 15-27. <http://eudml.org/doc/105181>.

@article{Bui1999,
author = {Bui, A., Bui, M., Lavault, C.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {distributed systems; performance evaluation; Markov chains; optimization},
language = {eng},
number = {1},
pages = {15-27},
publisher = {EDP-Sciences},
title = {On the hierarchy of functioning rules in distributed computing},
url = {http://eudml.org/doc/105181},
volume = {33},
year = {1999},
}

TY - JOUR
AU - Bui, A.
AU - Bui, M.
AU - Lavault, C.
TI - On the hierarchy of functioning rules in distributed computing
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1999
PB - EDP-Sciences
VL - 33
IS - 1
SP - 15
EP - 27
LA - eng
KW - distributed systems; performance evaluation; Markov chains; optimization
UR - http://eudml.org/doc/105181
ER -

References

top
  1. 1. D. BRAND and P. ZAFIROPULO, On communicating finite-state machines, Journal of the ACM, 198330 (2), pp. 323-342. Zbl0512.68039MR700785
  2. 2. A. Bui, Analyse du fonctionnement d'un type d'algorithmes distribués, Rev. R. de Math. Pures et Appl., 1995, 40 (7-8), pp. 583-593. Zbl0856.68074MR1405099
  3. 3. A. Bui, Etude analytique d'algorithmes distribués de routage, Thèse de doctorat, Université Paris-7, 1, 1994. 
  4. 4. M. Bui, Tuning Distributed Control Algorithms for Optimal Functioning, J. of Global Optimization, 1992, 2, pp. 177-199. Zbl0783.68030MR1263602
  5. 5. M. Bui, Résolution du Problème de Multi-Rendez-Vous à l'aide d'un modèle d'algorithme distribué, RAIRO, 1993, 27 (2), pp. 249-264. Zbl0771.68055MR1222389
  6. 6. T. L. CASAVANT and J. G. KUHL, A communicating finite automata approach to modeling distributed computation and its application to distributed décision making, IEEE Trans. on Computers, 1990, 39 (5), pp. 628-639. 
  7. 7. J. G. KEMENY and J. L. SNELL, Finite Markov chains, Springer, 1983. Zbl0537.60061MR410929
  8. 8. B. ROZOY, On distributed languages and models for distributed computation, Res.Rept. No. 563, University Paris-11, 1990. 
  9. 9. K. M. CHANDRY and J. MISRA, The Drinking Philosophers Problem, ACM TOPLAS, 1984, 6 (4), pp. 632-646. 
  10. 10. G. GAO and G. V. BOCHMANN, An Virtual Ring Algorithm for the Distributed Implementation of Multi-Rendez-Vous, Tech. Rept No. 675, Dpt IRO, Université de Montréal, 1990. 
  11. 11. S. P. RANA and D. K. BANERJI, An optimal distributed solution to the dining philosophers, Res. Rept., Waystate University, Détroit, Michigan, 1987. Zbl0641.68040
  12. 12. A. SEGALL, Distributed Network Protocols, IEEE transactions on Information Theory, 1983, 29 (1), pp. 23-25. Zbl0531.94026MR711275
  13. 13. W. D. TAJIBNAPISA Correctness Proof of a Topology Information Maintenance Protocol for a Distributed Computer Network, Communications of the ACM, 1977, 20 (7), pp. 477-485. Zbl0352.68053MR484836

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.