A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit <a rel="external noopener" href="http://groups.csail.mit.edu/tds/papers/Sastry/opodis12-preprint.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Wait-Free Stabilizing Dining Using Regular Registers
[chapter]
<span title="">2012</span>
<i title="Springer Berlin Heidelberg">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a>
</i>
Preserved Fulltext
Dining philosophers is a scheduling paradigm that determines when processes in a distributed system should execute certain sections of their code so that processes do not execute 'conflicting' code sections concurrently, for some application-dependent notion of a 'conflict'. Designing a stabilizing dining algorithm for shared-memory systems subject to process crashes presents an interesting challenge: classic stabilization relies on all processes continuing to execute actions forever, an
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-35476-2_20">doi:10.1007/978-3-642-35476-2_20</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jbsioc6tsvffthw3a665utxmpq">fatcat:jbsioc6tsvffthw3a665utxmpq</a>
</span>
more »
... ion which is violated when crash failures are considered. We present a dining algorithm that is both wait-free (tolerates any number of crashes) and is pseudo-stabilizing. Our algorithm works in an asynchronous system in which processes communicate via shared regular registers and have access to the eventually perfect failure detector ♦P. Furthermore, with a stronger failure detector, the solution becomes wait-free and self-stabilizing. To our knowledge, this is the first such algorithm. Prior results show that ♦P is necessary for wait-freedom. We would like to thank the reviewers for their suggestions in improving the paper.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130108004135/http://groups.csail.mit.edu/tds/papers/Sastry/opodis12-preprint.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/a2/4b/a24b4b62528fa61a635712b51dd345d3716791f2.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-35476-2_20">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
springer.com
</button>
</a>