Stabilizing Dining with Failure Locality 1 Conference Paper

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 ?P 1, and show that this failure detector is sufficient to solve the problem at hand. 2014 Springer-Verlag.

authors

• Welch, Jennifer

published proceedings

• DISTRIBUTED COMPUTING AND NETWORKING, ICDCN 2014

author list (cited authors)

• Chung, H. C., Sastry, S., & Welch, J. L.

citation count

• 0

complete list of authors

• Chung, Hyun Chul||Sastry, Srikanth||Welch, Jennifer L

publication date

• February 2014

publisher

• Springer Nature  Publisher

published in

• Lecture Notes in Computer Science  Journal

keywords

• 46 Information And Computing Sciences
• 4613 Theory Of Computation

Digital Object Identifier (DOI)

• 10.1007/978-3-642-45249-9_38

International Standard Book Number (ISBN) 13

• 978-3-642-45248-2

start page

• 532

end page

• 537

volume

• 8314

URL

• http://dx.doi.org/10.1007/978-3-642-45249-9_38