Introduction à l'algorithmique des objets partagés

Bernadette Charron-Bost; Robert Cori; Antoine Petit

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

  • Volume: 31, Issue: 2, page 97-148
  • ISSN: 0988-3754

How to cite

top

Charron-Bost, Bernadette, Cori, Robert, and Petit, Antoine. "Introduction à l'algorithmique des objets partagés." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 31.2 (1997): 97-148. <http://eudml.org/doc/92558>.

@article{Charron1997,
author = {Charron-Bost, Bernadette, Cori, Robert, Petit, Antoine},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {distributed algorithms; shared memory model},
language = {fre},
number = {2},
pages = {97-148},
publisher = {EDP-Sciences},
title = {Introduction à l'algorithmique des objets partagés},
url = {http://eudml.org/doc/92558},
volume = {31},
year = {1997},
}

TY - JOUR
AU - Charron-Bost, Bernadette
AU - Cori, Robert
AU - Petit, Antoine
TI - Introduction à l'algorithmique des objets partagés
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1997
PB - EDP-Sciences
VL - 31
IS - 2
SP - 97
EP - 148
LA - fre
KW - distributed algorithms; shared memory model
UR - http://eudml.org/doc/92558
ER -

References

top
  1. [Abr] U. ABRAHAM, On interprocess communication and the problem of common atomic registers, Technical Report Ben-gurion University, Israel, 1988. 
  2. [And] J. H. ANDERSON, Composite registers, Distributed Computing, 1993, 6, pp. 141-154. Zbl0781.68042
  3. [Ang] F. D. ANGER, On Lamport's Interprocessor Communication Model, ACM Trans. on Programming Languages and Systems, 1989, 11, pp. 404-417. 
  4. [Arn ] A. ARNOLD, An example of use of MEC: verification of Tromp's algorithm, Technical Report, Université Bordeaux 1, 1993. 
  5. [AKKV] B. AWERBUCH, L. M. KIROUSIS, E. KRANAKISet P. VITÁNYI, A proof technique for register atomicity, Proceedings of Conference on Foundations of Software Technology and Theoretical Computer Science, LNCS, Springer Verlag, 1988, 338, pp. 286-303. Zbl0669.68019MR1023903
  6. [Blo] B. BLOOM, Constructing Two-writer atomic register, IEEE Trans. on Computers, 1988, 37, pp. 1506-1514. Zbl0663.68034MR975401
  7. [HS] S. HALDARet P. S. SUBRAMANIAN, Space-optimal conflict free construction of 1-writer 1-reader multivalued atomic register, International 8th Workshop on Distrubuted Computing, LNCS, Springer Verlag, 1994, 857, pp. 116-129. MR1325246
  8. [Her] M. HERLIHY, Wait free synchronization, ACM Trans. on Programming Languages and Systems, 1991, 13, pp. 124-149. 
  9. [HW] M. HERLIHYet M. WING, Linearizability : a correctness condition for concurrent objects, ACM Trans. on Programming Languages and Systems, 1990, 12, pp. 463-492. 
  10. [IS] A. ISRAELI et A. SHAHAM, Optimal multi-writer atomic register, Proceedings of the 11th ACM Symposium on Principles of Distributed Computing, 1992. Zbl1082.68017
  11. [KKV] L. M. KIROUSIS, E. KRANAKISet P. VITÁNYI, Atomic Mulitreader Register, International 2nd Workshop on Distributed Computing, LNCS, Springer Verlag 1987, 312, pp. 278-296. 
  12. [KV] L. M. KIROUSIS et A. G. VENERIS, Efficient algorithms for checking atomicity of a run of read and write operations, International 7th Workshop on Distributed Computing, LNCS, Springer Verlag 1993, 725, pp. 54-68. Zbl0925.68169MR1284489
  13. [L78] L. LAMPORT, Time, Clocks, and the Orderings of Events in a Distributed System, Communications of the ACM, 1978, 21, pp. 558-564. Zbl0378.68027
  14. [L85] L. LAMPORT, Interprocess communication, SRI Technical Report, March 1985. 
  15. [L86a] L. LAMPORT, On interprocess communication: Part I-Basic formalism, Distributed Computing, 1986, 1, pp. 77-85. Zbl0598.68022
  16. [L86b] L. LAMPORT, On interprocess communication: Part II-Algorithms, Distributed Computing, 1986, 1, pp. 86-101. Zbl0598.68023
  17. [Mis] J. MISRA, Axioms for memory access in asynchronous hardware systems, ACM Trans. on Programming Languages and Systems, 1986, 8, pp. 142-153. Zbl0593.68017MR822269
  18. [Mor] R. H. MÖRING, Algorithmic aspects of comparability graphs and interval graphs in Graphs and Order(NATO ASI C147), L Rival ed D. Reidel, 1985, pp. 41-101. Zbl0569.05046MR818493
  19. [Ore] O. ORE, Theory of Graphs, Amer. Math. Soc. Colloq. Publ., Providence, 1962, 38. Zbl0105.35401MR150753
  20. [Pet] G. L. PETERSON, Concurrent reading while writing, ACM Trans. on Programming Languages and Systems, 1983, 5, pp. 46-55. Zbl0498.68010
  21. [Tro] J. TROMP, How to Construct an Atomic Variable, International Workshop on Distributed Algorithms, LNCS, Springer Verlag 1989, 392, pp. 292-302. 
  22. [Vid] K. VIDYASANKAR, Converting Lamport's regular register to atomic register, Information Processing Letters, 1988, 28, pp. 287-290. Zbl0662.68049MR963515
  23. [VA] P. VITÁNYI et B. AWERBUCH, Atomic shared acces by asynchronous hardware, Proceedings of the 27th Symposium on Foundations of Computer Science, 1986, Errata, Ibid, 1987. 
  24. [Wie] N. WIENER, A contribution to the theory of relative position, Proc. Camb. Philos. Soc., 1914, 17, pp. 441-449. Zbl45.1150.10JFM45.1150.10

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.