Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"Dining Philosophers, The eventually perfect failure detector, Wait-Freedom, Bounded Fairness"”.

  1. The Weakest Failure Detector for Solving Wait-Free, Eventually Bounded-Fair Dining Philosophers

    This dissertation explores the necessary and sufficient conditions to solve a variant of the dining philosophers problem. This dining variant is defined by three properties: wait-freedom, eventual weak exclusion, and eventual bounded fairness. Wait-freedom guarantees that every correct hungry …

    tdl Repository record for The Weakest Failure Detector for Solving Wait-Free, Eventually Bounded-Fair Dining Philosophers (opens in a new tab)