Abstract
The dining philosophers problem, or simply dining, is a fundamental distributed resource allocation problem. We propose two algorithms for solving stabilizing dining with failure locality 1 in asynchronous shared-memory systems with regular registers. Since this problem cannot be solved in pure asynchrony, we augment the shared-memory system with failure detectors. Specifically, we introduce the local anonymous eventually perfect failure detector \(?\diamondsuit{\mathcal P}^1\), and show that this failure detector is sufficient to solve the problem at hand.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dijkstra, E.W.: Hierarchical ordering of sequential processes. Acta Informatica 1(2), 115–138 (1971)
Lynch, N.A.: Fast allocation of nearby resources in a distributed system. In: Proc. of 12th ACM Symposium on Theory of Computing, pp. 70–81 (1980)
Choy, M., Singh, A.K.: Efficient fault-tolerant algorithms for distributed resource allocation. ACM Toplas 17(3), 535–559 (1995)
Choy, M., Singh, A.K.: Localizing failures in distributed synchronization. IEEE Trans. Parall. Distrib. Syst. 7(7), 705–716 (1996)
Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43(2), 225–267 (1996)
Lynch, N.A.: Upper bounds for static resource allocation in a distributed system. Journal of Computer and System Sciences 23(2), 254–278 (1981)
Dolev, S., Herman, T.: Dijkstra’s self-stabilizing algorithm in unsupportive environments. In: Datta, A.K., Herman, T. (eds.) WSS 2001. LNCS, vol. 2194, pp. 67–81. Springer, Heidelberg (2001)
Chandy, K.M., Misra, J.: The drinking philosophers problem. ACM Toplas 6(4), 632–646 (1984)
Pike, S.M., Song, Y., Sastry, S.: Wait-free dining under eventual weak exclusion. In: Proc. of 9th ICDCN, pp. 135–146 (2008)
Nesterenko, M., Arora, A.: Tolerance to unbounded byzantine faults. In: Proc. of 21st IEEE SRDS, pp. 22–29 (2002)
Nesterenko, M., Arora, A.: Dining philosophers that tolerate malicious crashes. In: Proc. of  22nd IEEE ICDCS, pp. 172–179 (2002)
Sastry, S., Welch, J.L., Widder, J.: Wait-free stabilizing dining using regular registers. In: Proc. of 16th OPODIS, pp. 284–299 (2012)
Hoepman, J.H., Papatriantafilou, M., Tsigas, P.: Self-stabilization of wait-free shared memory objects. J. Parall. & Distribut. Comput. 62(5), 818–842 (2002)
Johnen, C., Higham, L.: Fault-tolerant implementations of regular registers by safe registers with applications to networks. In: Garg, V., Wattenhofer, R., Kothapalli, K. (eds.) ICDCN 2009. LNCS, vol. 5408, pp. 337–348. Springer, Heidelberg (2008)
Chung, H.C., Sastry, S., Welch, J.L.: Stabilizing dining with failure locality 1. Dept. of Comput. Sci. & Eng., Texas A&M Univ. Technical Report 2013-10-1 (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chung, H.C., Sastry, S., Welch, J.L. (2014). Stabilizing Dining with Failure Locality 1. In: Chatterjee, M., Cao, Jn., Kothapalli, K., Rajsbaum, S. (eds) Distributed Computing and Networking. ICDCN 2014. Lecture Notes in Computer Science, vol 8314. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45249-9_38
Download citation
DOI: https://doi.org/10.1007/978-3-642-45249-9_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45248-2
Online ISBN: 978-3-642-45249-9
eBook Packages: Computer ScienceComputer Science (R0)