Abstract
We generalize the classic dining philosophers problem to separate the conflict and communication neighbors of each process. Communication neighbors may directly exchange information while conflict neighbors compete for the access to the exclusive critical section of code. This generalization is motivated by a number of practical problems in distributed systems including problems in wireless sensor networks. We present a self-stabilizing deterministic algorithm—GDP that solves this generalized problem. Our algorithm is terminating. We formally prove GDP correct and evaluate its performance. We extend the algorithm to handle a similarly generalized drinking philosophers and the committee coordination problem. We describe how GDP can be implemented in wireless sensor networks and demonstrate that this implementation does not jeopardize its correctness or termination properties.
- Antoniu, G. and Srimani, P. 1999. A self-stabilizing distributed algorithm to find the median of a tree graph. J. Comput. Syst. Sci. 58, 215--221. Google Scholar
Digital Library
- Arora, A. and Nesterenko, M. 2005. Unifying stabilization and termination in message-passing systems. Distrib. Comput. 17, 3, 279--290. Google Scholar
Digital Library
- Arumugam, M. and Kulkarni, S. 2005. Self-stabilizing deterministic TDMA for sensor networks. Tech. rep. MSU-CSE-05-19, Michigan State University.Google Scholar
- Banerjee, S., Kommareddy, C., Kar, K., Bhattacharjee, S., and Khuller, S. 2003. Construction of an efficient overlay multicast infrastructure for real-time applications. In Proceedings of the Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). 1521--1531.Google Scholar
- Beauquier, J., Datta, A., Gradinariu, M., and Magniette, F. 2000. Self-stabilizing local mutual exclusion and daemon refinement. In Proceedings of the 12th International Symposium on Distributed Computing. Springer, 223--237. Google Scholar
Digital Library
- Blin, L., Cournier, A., and Villain, V. 2003. An improved snap-stabilizing PIF algorithm. In Proceedings of the 6th International Symposium on Self-Stabilizing Systems, (SSS03), S.-T. Huang and T. Herman, Eds. Lecture Notes in Computer Science, vol. 2704. Springer, 199--214. Google Scholar
Digital Library
- Boulinier, C., Petit, F., and Villain, V. 2004. When graph theory helps self-stabilization. In Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing. ACM Press, 150--159. Google Scholar
Digital Library
- Bui, A., Datta, A., Petit, F., and Villain, V. 1999. State-optimal snap-stabilizing PIF in tree networks. In Proceedings of the Forth Workshop on Self-Stabilizing Systems. IEEE, 78--85. Google Scholar
Digital Library
- Cantarell, S., Datta, A., and Petit, F. 2003. Self-stabilizing atomicity refinement allowing neighborhood concurrency. In Proceedings of the 6th International Symposium on Self-Stabilizing Systems. Lecture Notes in Computer Science, vol. 2704. Springer, 102--112. Google Scholar
Digital Library
- Chandy, K. and Misra, J. 1984. The drinking philosophers problem. ACM Trans. Program. Lang. Syst. 6, 4, 632--646. Google Scholar
Digital Library
- Chandy, K. and Misra, J. 1988. Parallel Program Design: a Foundation. Addison-Wesley, Reading, MA. Google Scholar
Digital Library
- Datta, A., Gradinariu, M., and Raynal, M. 2005. Stabilizing mobile philosophers. Inform. Proces. Lett. 95, 1, 299--306. Google Scholar
Digital Library
- Dijkstra, E. 1968. Cooperating Sequential Processes. Academic Press.Google Scholar
- Dolev, S. 2000. Self-Stabilization. MIT Press. Google Scholar
Digital Library
- Gairing, M., Goddard, W., Hedetniemi, S., Kristiansen, P., and McRae, A. 2004. Distance-two information in self-stabilizing algorithms. Parall. Process. Lett. 14, 3-4, 387--398.Google Scholar
Cross Ref
- Goddard, W., Hedetniemi, S., Jacobs, D., and Trevisan, V. 2006. Distance-K information in self-stabilizing algorithms. In Proceedings of the 13th Colloquium on Structural Information and Communication Complexity (SIROCCO), 349--356. Google Scholar
Digital Library
- Gouda, M. 1998. Elements of Network Protocol Design. John Wiley & Sons, Inc. Google Scholar
Digital Library
- Gouda, M. and Haddix, F. 1999. The alternator. In Proceedings of the 4th Workshop on Self-Stabilizing Systems. IEEE Computer Society, 48--53. Google Scholar
Digital Library
- Gouda, M. and Multari, N. 1991. Stabilizing communication protocols. IEEE Trans. Comput. 40, 448--458. Google Scholar
Digital Library
- Gradinariu, M. and Tixeuil, S. 2007. Conflict managers for self-stabilization without fairness assumption. In Proceedings of the International Conference on Distributed Computing Systems (ICDCS 2007). IEEE, 46. Google Scholar
Digital Library
- Herman, T. 1991. Adaptivity through distributed convergence. Ph.D. thesis, Department of Computer Science, University of Texas at Austin. Google Scholar
Digital Library
- Herman, T. and Tixeuil, S. 2004. A distributed TDMA slot assignment algorithm for wireless sensor networks. In Proceedings of the 1st International Workshop on Algorithmic Aspects of Wireless Sensor Networks, 45--58.Google Scholar
- Hoover, H. 1995. On the self-stabilization of processors with continuous states. In Proceedings of the 2nd Workshop on Self-Stabilizing Systems, 8.1--8.15.Google Scholar
- Huang, S. 2000. The fuzzy philosophers. In Proceedings of the 15th International Parallel and Distributed Processing Symposium Workshops, J. R. et al., Ed. Lecture Notes in Computer Science, vol. 1800, 130--136. Google Scholar
Digital Library
- Jayanti, P. 2003. Adaptive and efficient abortable mutual exclusion. In Proceedings of the 22nd Annual ACM Symposium on Principles of Distributed Computing (PODC'03), 295--304. Google Scholar
Digital Library
- Johnen, C., Alima, L., Datta, A., and Tixeuil, S. 2002. Optimal snap-stabilizing neighborhood synchronizer in tree networks. Parall. Process. Lett. 12, 3-4, 327--340.Google Scholar
Cross Ref
- Kulkarni, S. and Arumugam, M. 2003. Collision-free communication in sensor networks. In Proceedings of the Symposium on Self-Stabilizing Systems (SSS). Lecture Notes in Computer Science, vol. 2704, 17--31. Google Scholar
Digital Library
- Lynch, N. 1980. Fast allocation of nearby resources in a distributed system. In Proceedings of the 12th Annual ACM Symposium on Theory of Computing (STOC). ACM Press, 70--81. Google Scholar
Digital Library
- Malhotra, M., Krasniewski, M., Yang, C., Bagchi, S., and Chappbell, W. 2005. Location estimation in ad-hoc networks with directional antennas. In Proceedings of the 25th IEEE International Conference on Distributed Computing Systems. 633--642. Google Scholar
Digital Library
- Mitton, N., Fleury, E., Guérin-Lassous, I., Sericola, B., and Tixeuil, S. 2006. Fast convergence in self-stabilizing wireless networks. In Proceedings of the International Conference on Parallel and Distributed Systems. IEEE Computer Society, 31--38. Google Scholar
Digital Library
- Mitton, N., Paroux, K., Sericola, B., and Tixeuil, S. 2008. Ascending runs in dependent uniformly distributed random variables: Application to wireless networks. Methodology and Computing in Applied Probability.Google Scholar
- Mizuno, M. and Nesterenko, M. 1998. A transformation of self-stabilizing serial model programs for asynchronous parallel computing environments. Inform. Proc. Lett. 66, 6, 285--290. Google Scholar
Digital Library
- Nesterenko, M. and Arora, A. 2001. Self-stabilizing routing in wireless embedded. In Proceedings of the SRDS Workshop on Reliability in Embedded Systems, 16--22.Google Scholar
- Nesterenko, M. and Arora, A. 2002a. Dining philosophers that tolerate malicious crashes. In Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS). IEEE, 191--198. Google Scholar
Digital Library
- Nesterenko, M. and Arora, A. 2002b. Stabilization-preserving atomicity refinement. J. Parall. Distrib. Comput. 62, 5, 766--791. Google Scholar
Digital Library
- Scott, M. L. and Scherer, III, W. N. 2001. Scalable queue-based spin locks with timeout. In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP'01), ACM SIGPLAN Notices (8th PPOPP'01), 44--52. Google Scholar
Digital Library
- Shi, S. and Turner, J. S. 2002. Routing in overlay multicast networks. In Proceedings of the IEEE INFOCOM. Vol. 3. IEEE Computer Society, 1200--1208.Google Scholar
- Sivilotti, P., Pike, S., and Sridhar, N. 2000. 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. Vol. 2. IASTED/ACTA Press, 524--529.Google Scholar
Index Terms
Self-stabilizing philosophers with generic conflicts
Recommendations
Self-stabilizing philosophers with generic conflicts
SSS'06: Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systemsWe generalize the classic dining philosophers problem to separate the conflict and communication neighbors of each process. Communication neighbors may directly exchange information while conflict neighbors compete for the access to the exclusive ...
Stabilizing mobile philosophers
We present a self-stabilizing solution to a new version of the dining philosophers problem. We call this problem mobile philosophers problem because the philosophers can move around a logical ring formed out of a dynamic network.
A modular drinking philosophers algorithm
A variant of the drinking philosophers algorithm of Chandy and Misra is described and proved correct in a modular way. The algorithm of Chandy and Misra is based on a particular dining philosophers algorithm and relies on certain properties of its ...








Comments