Dining philosophers with masking tolerance to crash faults
| Title: | Dining philosophers with masking tolerance to crash faults |
| Author: | Idimadakala, Vijaya K. |
| Abstract: | We examine the tolerance of dining philosopher algorithms subject to process crash faults in arbitrary conflict graphs. This classic problem is unsolvable in asynchronous message-passing systems subject to even a single crash fault. By contrast, dining can be solved in synchronous systems capable of implementing the perfect failure detector P (from the Chandra-Toueg hierarchy). We show that dining is also solvable in weaker timing models using a combination of the trusting detector T and the strong detector S; Our approach extends and composes two currents of previous research. First, we define a parametric generalization of Lynch’s classic algorithm for hierarchical resource allocation. Our construction converts any mutual exclusion algorithm into a valid dining algorithm. Second, we consider the fault-tolerant mutual exclusion algorithm (FTME) of Delporte-Gallet, et al., which uses T and the strong detector S to mask crash faults in any environment. We instantiate our dining construction with FTME, and prove that the resulting dining algorithm guarantees masking tolerance to crash faults. Our contribution (1) defines a new construction for transforming mutual exclusion algorithms into dining algorithms, and (2) demonstrates a better upper-bound on the fault-detection capabilities necessary to mask crash faults in dining philosophers. |
| Subject: |
dining
masking tolerance |
| URI: | http://hdl.handle.net/1969.1/ETD-TAMU-1072 |
| Date: | 2006-12 |
Citation
(2006).
Dining philosophers with masking tolerance to crash faults.
Master's thesis,
Texas A&M University. Available electronically from
http : / /hdl .handle .net /1969 .1 /ETD -TAMU -1072.
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| IDIMADAKALA-THESIS.pdf | 274.3Kb |
View/ |
This item appears in the following Collection(s)
-
Electronic Theses, Dissertations, and Records of Study (2002-present) [10425]
Electronic Theses, Dissertations, and Records of Study Collection
Browse
