Self-stabilizing philosophers with generic conflicts

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4280 LNCS, Issue , 2006, Pages 214-230

  Danturi, Praveen ^a   Nesterenko, Mikhail ^a   Tixeuil, Sébastien ^b  

^a KENT STATE UNIVERSITY   (United States)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; SENSOR DATA FUSION; SENSORS;

DRINKING PHILOSOPHERS PROBLEM; K-HOP NEIGHBORHOOD; WIRELESS SENSOR NETWORKS (WSN);

DISTRIBUTED DATABASE SYSTEMS;

EID: 33845527944     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-49823-0_15     Document Type: Conference Paper

References (27)

1. G. Antonoiu and P.K. Srimani. Mutual exclusion between neighboring nodes in an arbitrary system graph that stabilizes using read/write atomicity. In EuroPar'99, volume 1685 of LNCS, pages 823-830. Springer-Verlag, 1999.
2. A. Arora and M. Nesterenko. Unifying stabilization and termination in message-passing systems. Distributed Computing, 17(3):279-290, March 2005.
3. M. Arumugam and S.S. Kulkarni. Self-stabilizing deterministic TDMA for sensor networks. Technical Report MSU-CSE-05-19, Michigan State University, 2005.
4. J. Beauquier, A.K. Datta, M. Gradinariu, and F. Magniette. Self-stabilizing local mutual exclusion and daemon refinement. In 14th International Symposium on Distributed Computing, volume 1914 of LNCS, pages 223-237. Springer, 2000.
5. C. Boulinier, F. Petit, and V. Villain. When graph theory helps self-stabilization. In PODC '04: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pages 150-159, New York, NY, USA, 2004. ACM Press.
6. A. Bui, A.K. Datta, F. Petit, and V. Villain. Space optimal PIF algorithm: self-stabilized with no extra space. In IEEE International Conference on Performance, Computing and Communications, pages 20-26, 1999.
7. S. Cantarell, A.K. Datta, and F. Petit. Self-stabilizing atomicity refinement allowing neighborhood concurrency. In 6th International Symposium on Self-Stabilizing Systems, volume 2704 of LNCS, pages 102-112. Springer, 2003.
8. K.M. Chandy and J. Misra. The drinking philosophers problem. ACM Transactions on Programming Languages and Systems, 6(4):632-646, October 1984.
9. K.M. Chandy and J. Misra. Parallel Program Design: a Foundation. Addison-Wesley, Reading, Mass., 1988.
10. A.K. Datta, M. Gradinariu, and M. Raynal. Stabilizing mobile philosophers. Information Procesing Letters, 95(1):299-306, 2005.
11. E. Dijkstra. Cooperating Sequential Processes. Academic Press, 1968.
12. S. Dolev. Self-Stabilization. MIT Press, 2000.
13. M. Gairing, W. Goddard, S.T. Hedetniemi, P. Kristiansen, and A.A. McRae. Distance-two information in self-stabilizing algorithms, Parallel Processing Letters, 14(3-4):387-398, 2004.
14. W. Goddard, S.T. Hedetniemi, D.P Jacobs, and V Trevisan. Distance-k information in self-stabilizing algorithms, to appear in the Proceedings of the 13th Colloquium on Structural Information and Communication Complexity (SIROCCO'06).
15. M.G. Gouda. Elmnts. of Network Protocol Design. John Wiley & Sons, Inc., 1998.
16. M.G. Gouda and F. Haddix, The alternator. In Proceedings of the Fourth Workshop on Self-Stabilizing Systems, pages 48-53. IEEE Computer Society, 1999.
17. T. Herman. A comprehensive bibliography on self-stabilization (working paper). CJTCS: Chicago Journal of Theoretical Computer Science, 1995.
18. T. Herman and S. Tixeuil. A distributed TDMA slot assignment algorithm for wireless sensor networks, In Proceedings of the First International Workshop on Algorithmic Aspects of Wireless Sensor Networks, pages 45-58, 2004.
19. Ted Herman and Sébastien Tixeuil. A distributed TDMA slot assignment algorithm for wireless sensor networks. In Proceedings of the First Workshop on Algorithmic Aspects of Wireless Sensor Networks (AlgoSensors'2004), number 3121 in LNCS, pages 45-58, Springe, July 2004.
20. S.T. Huang. The fuzzy philosophers. In J. Rolim et al., editor, Proceedings of the 15th IPDPS 2000 Workshops, volume 1800 of Lecture Notes in Computer Science, pages 130-136, Cancun, Mexico, May 2000. Springer-Verlag.
21. C. Johnen, L.O. Alima, A.K. Datta, and S. Tixeuil. Optimal snap-stabilizing neighborhood synchronizer in tree networks. Parallel Processing Letters, 12(3-4):327-340, 2002.
22. S.S. Kulkarni and M. Arumugam. Collision-free communication in sensor networks. In Proceedings of the Symposium on Self-Stabilizing Systems (SSS), Springer-Verlag LNCS:2704, pages 17-31, San Francisco,CA, June 2003.
23. M. Malhotra, M. Krasniewski, C. Yang, S. Bagchi, and W. Chappbell. Location estimation in ad-hoc networks with directional antennas, In the 25th IEEE International Conference on Distributed Computing Systems, pages 633-642, 2005.
24. Nathalie Mitton, Eric Fleury, Isabelle Guérin-Lassous, Bruno Séricola, and Sébastien Tixeuil. On fast randomized colorings in sensor networks. In Proceedings of ICPADS 2006, page to appear. IEEE Press, July 2006.
25. M. Mizuno and M. Nesterenko. A transformation of self-stabilizing serial model programs for asynchronous parallel computing environments, Information Processing Letters, 66(6):285-290, 1998.
26. M. Nesterenko and A. Arora. Stabilization-preserving atomicity refinement. Journal of Parallel and Distributed Computing, 62(5):766-791, 2002.
27. P.A.G. Sivilotti, S.M. Pike, and N. Sridhar. A new distributed resource-allocation algorithm with optimal failure locality. In Proceedings of the 12th IASTED International Conference on Parallel and Distributed Computing and Systems, volume 2, pages 524-529. IASTED/ACTA Press, November 2000.