Calcul réparti d'un extrémum et du routage associé dans un réseau quelconque

Jean-Michel Helary; Aomar Maddi; Michel Raynal

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

  • Volume: 21, Issue: 3, page 223-244
  • ISSN: 0988-3754

How to cite

top

Helary, Jean-Michel, Maddi, Aomar, and Raynal, Michel. "Calcul réparti d'un extrémum et du routage associé dans un réseau quelconque." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 21.3 (1987): 223-244. <http://eudml.org/doc/92286>.

@article{Helary1987,
author = {Helary, Jean-Michel, Maddi, Aomar, Raynal, Michel},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {Distributed algorithms; distributed systems; processes; messages; communication network; control; information diffusion},
language = {fre},
number = {3},
pages = {223-244},
publisher = {EDP-Sciences},
title = {Calcul réparti d'un extrémum et du routage associé dans un réseau quelconque},
url = {http://eudml.org/doc/92286},
volume = {21},
year = {1987},
}

TY - JOUR
AU - Helary, Jean-Michel
AU - Maddi, Aomar
AU - Raynal, Michel
TI - Calcul réparti d'un extrémum et du routage associé dans un réseau quelconque
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1987
PB - EDP-Sciences
VL - 21
IS - 3
SP - 223
EP - 244
LA - fre
KW - Distributed algorithms; distributed systems; processes; messages; communication network; control; information diffusion
UR - http://eudml.org/doc/92286
ER -

References

top
  1. 1. B. AWERBUCH, A New Distributed Depth-First Search Algorithm, Inf. Proc. Letters, vol. 20, avril 1985, p. 147-150. Zbl0573.68013
  2. 2. P. A. BERNSTEINet M. GOODMAN, Concurrency Control in Distributed Data Base Systems, A.C.M., Computing Surveys, vol. 13, n° 2, juin 1981, p. 185-201. MR642091
  3. 3. K. M. CHANDYet J. MISRA, Distributed Computing on Graphs: Shortest Paths Algorithms, Comm. A.C.M., vol. 25, n° 11, novembre 1982, p. 833-837. Zbl0491.68064MR691758
  4. 4. K. M. CHANDY, J. MISRAet J. HAAS, Distributed Deadlock Detection, A.C.M. T.O.C.S., vol. 1, n° 2, mai 1983, p. 144-156. 
  5. 5. E. J. CHANGet R. ROBERTS, An Improved Algorithm for Decentralized Extrema-Finding in Circular Configurations of Processors, Comm. A.C.M. vol. 22, n° 5, mai 1979, p. 281-283. Zbl0394.68023
  6. 6. T. CHEUNG, Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation, I.E.E.E. Trans. on soft. Eng., vol. SE9, n° 4, juillet 1983, p. 504-512. Zbl0513.68066
  7. 7. E. W. DIJKSTRA et C. S. SHOLTEN, Terminaison Detection for Diffusing Computations, Inf. Proc. Letters, vol. 11, n° 1, août 1980, p. 1-4. Zbl0439.68039
  8. 8. D. DOLEV, M. KLAWE et M. RODEH, An O (n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle, Journal of Algorithms, vol. 3, 1982, p. 245-260. Zbl0493.68074MR668088
  9. 9. N. FRANCEZ et M. RODEH, Achieving Distributed Terminaison Without Freezing, I.E.E.E. Trans, on Soft. Eng., vol. SE 8, n° 3, mai 1982, p. 287-292. Zbl0478.68024
  10. 10. W. R. FRANKLIN, On an Improved Algorithm for Decentralized Extrema-Finding in Circular Configurations of Processors, Comm. A.C.M. vol. 25, n° 5, mai 1982. p. 336-337. 
  11. 11. H. GARCIA-MOLINA, Elections in a Distributed Computing System, I.E.E.E. Trans. on Computers, vol. C31, n° 1, janvier 1981, p. 48-59. 
  12. 12. J. N. GRAY, Notes on Data Base Operating Systems, L.N.C.S., n° 68, Springer-Verlag, 1978, p. 393-481. 
  13. 13. T. HERMAN et K. M. CHANDY, On Distributed Search, Inf. Processing Letters, vol. 21, 1985, p. 129-133. Zbl0582.68037MR812158
  14. 14. D. S. HIRSCHBERG et J. B. SINCLAIR, Decentralized Extrema Finding in Circular Configurations of Processors, Comm. A.C.M., vol. 23, n° 11, novembre 1980, p. 627-628. Zbl0444.68022MR593048
  15. 15. J. M. HELARY, A. MADDI et M. RAYNAL, Controlling Knowledge Transfers in Distributed Algorithms: Application to Deadlock Detection, Rapport de recherche I.N.R.I.A., n° 493, mars 1986, 28 p. 
  16. 16. J. M. HELARY, A. MADDI et M. RAYNAL, Calcul distribué d'un extrêmum et du routage associé dans un réseau quelconque, Rapport de recherche I.N.R.I.A., n° 516, avril 1986, 36 p. A paraître dans Computer journal 1988. 
  17. 17. J. M. HELARY, N. PLOUZEAU et M. RAYNAL, A Distributed Algorithm for Mutual Exclusion in an Arbitrary Network, Rapport de recherche I.N.R.I.A. n° 496, mars 1986, 15 p. Zbl0648.68032
  18. 18. C. JARD, J. F. MONIN et R. GROZ, VEDA: a Software Simulator for the Validation of Protocol Specifications, C.O.M.N.E.T., 1985, Hongrie, octobre 1985. 
  19. 19. E. KORACH, S. MORAN et S. ZAKS, Tight Lower and Upper Bounds for Some Distributed Algorithms for a Complete Network of Processors, Proc. of the 3rd A.CM. conf. on principles of distributed Computing, août 1984, p. 199-207. 
  20. 20. G. LE LANN, Distributed Systems: Towards a Formal Approach, I.F.I.P. Congres, Toronto, août 1977, p. 155-160. 
  21. 21. J. MISRA et K. M. CHANDY, A Distributed Graph Algorithm: Knot Detection, A.C.M. T.O.P.L.A.S., vol. 4, n° 4, octobre 1982, p. 678-680. Zbl0489.68061
  22. 22. J. MISRA et K. M. CHANDY, Terminaison Detecting of Diffusing Computations in C.S.P., A.C.M. T.O.P.L.A.S., vol. 4, n° 1, janvier 1982, p. 37-43. Zbl0479.68025
  23. 23. J. A. PACHL, E. KORACH et D. ROTEM, Lower Bounds for Distributed Maximum Finding Algorithms, Journal of the A.C.M., vol. 31, n° 4, octobre 1984, p. 905-918. Zbl0628.68046MR819171
  24. 24. G. L. PETERSON, An O (n log n) Unidirectional Algorithm for the Circular Extrema Problem, A.C.M. T.O.P.L.A.S., vol. 4, n° 4, octobre 1982, p. 758-762. Zbl0489.68040
  25. 25. J. PETERSON et A. SILBERSCHATZ, Operating System Concepts, Addison Wesley, 1983, 548 p. Zbl0758.68023
  26. 26. M. RAYNAL, Algorithmes distribués et protocoles, Eyrolles, septembre 1985, 144 p. 
  27. 27. F. D. SCHNEIDE, D. GRIES et R. SCHLICHTING, Fault Tolerant Broadcasts, Science of Programming, vol. 4, n° 1, 1984, p. 1-15. Zbl0534.68019MR747296
  28. 28. A. SEGALL, Distributed Network Protocols, I.E.E.E. Trans. on Inf. Theory, vol. IT29, 1, janvier 1983, p. 23-35. Zbl0531.94026MR711275
  29. 29. R. H. THOMAS, A Majority Consensus Approach to Concurrency Controlfor Multiple Copy Databases, A.C.M. Trans. on Database Systems, vol. 4, n° 2, juin 1979, p. 180-209. 

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.