Self-Stabilizing Local Mutual Exclusion and Daemon Refinement-Reference-Cited by-同舟云学术

Self-Stabilizing Local Mutual Exclusion and Daemon Refinement

Published:2000 Issue: Volume: Page:223-237
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Beauquier Joffroy,Datta Ajoy K.,Gradinariu Maria,Magniette Frederic

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-40026-5_15

Reference19 articles.

1. A. Arora and M. Nesterenko. Stabilization-preserving atomicity refinement. DISC’99, pages 254–268, 1999.

2. B. Awerbuch and M. Saks. A dining philosophers algorithm with polynomial response time. 31st Annual Symposium on Foundations of Computer Science, volume 1:65–74, October 1990.

3. Lect Notes Comput Sci;G.H. Antonoiu,1999

4. V. Barbosa and E. Gafni. Concurrency in heavily loaded neighborhood-constrained systems. Transactions on Programming Languages and Systems Vol 11 Num 4, pages 562–584, 1989.

5. J.M. Couvreur, N. Francez, and M.G. Gouda. Asynchronous unison. ICD-CS92 Proceedings of the 12th International Conference on Distributed Computing Systems, pages 486–493, 1992.

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A self‐stabilizing distributed algorithm for the local ( 1 , | N i | ) ‐critical section problem;Concurrency and Computation: Practice and Experience;2019-12-23

2. Benefit of self-stabilizing protocols in eventually consistent key-value stores;Proceedings of the 20th International Conference on Distributed Computing and Networking;2019-01-04

3. Self-stabilizing Consensus Average Algorithm in Distributed Sensor Networks;Transactions on Large-Scale Data- and Knowledge-Centered Systems IX;2013

4. Daemon Conversions in Distributed Self-stabilizing Algorithms;WALCOM: Algorithms and Computation;2013

5. A self-stabilizing algorithm to maximal 2-packing with improved complexity;Information Processing Letters;2012-07