Filters








27,949 Hits in 3.1 sec

Brief Announcement: Neighborhood Mutual Remainder and Its Self-Stabilizing Implementation of Look-Compute-Move Robots

Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, Koichi Wada, Michael Wagner
<span title="2019-10-11">2019</span> <i > <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2pcluxp32rfojgwekdrryxoaqu" style="color: black;">International Symposium on Distributed Computing</a> </i> &nbsp;
In this paper, we define a new concept neighborhood mutual remainder (NMR). An NMR distributed algorithms should satisfy global fairness, l-exclusion and repeated local rendezvous requirements.  ...  We give a simple self-stabilizing algorithm to demonstrate the design paradigm to achieve NMR, and also present applications of NMR to a Look-Compute-Move robot system.  ...  One may think we can apply mutual exclusion or local mutual exclusion to solve the local synchronization problem.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.disc.2019.43">doi:10.4230/lipics.disc.2019.43</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/wdag/DolevKKOW19.html">dblp:conf/wdag/DolevKKOW19</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/p3j6kgu2anhwjgu7sni4w7gg2y">fatcat:p3j6kgu2anhwjgu7sni4w7gg2y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220121042750/https://drops.dagstuhl.de/opus/volltexte/2019/11350/pdf/LIPIcs-DISC-2019-43.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/8a/79/8a79f8508d099ef22ff2d1df72b366de5f8ab889.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.disc.2019.43"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Lower Bounds for Randomized Mutual Exclusion

Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin, David Zuckerman
<span title="">1998</span> <i title="Society for Industrial &amp; Applied Mathematics (SIAM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/7dys7zoberdktmxyjciuy5bnse" style="color: black;">SIAM journal on computing (Print)</a> </i> &nbsp;
Theorem 4: Every mutual-exclusion algorithm A for n processes which guarantees O(t)-fairness requires a shared variable of (log log n) bits.  ...  Then, there exists a randomized mutual-exclusion algorithm for n processes, that guarantees f-fairness, and uses a sharedvariable of 2 log B + O(1) bits.  ...  In fact, we prove a lower bound of (log logn) bits on the size of the shared-variable, which is also tight.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/s009753979426513x">doi:10.1137/s009753979426513x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/khhyeod6sjce3piukp4xg4lr6a">fatcat:khhyeod6sjce3piukp4xg4lr6a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190220195559/http://pdfs.semanticscholar.org/28c6/cab78ed72b3fd478c815cbeda7144a58adc2.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/28/c6/28c6cab78ed72b3fd478c815cbeda7144a58adc2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/s009753979426513x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

An optimal self-stabilizing strarvation-free alternator

Mehmet Hakan Karaata
<span title="">2005</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/p6ovb2qpkfenhmb7mcksobrcxq" style="color: black;">Journal of computer and system sciences (Print)</a> </i> &nbsp;
of the existing alternators, we propose a fairness refinement for self-stabilizing distributed systems based on a state-space optimal self-stabilizing a (SFA) for arbitrary topologies and verify its correctness  ...  In this paper, we first establish the relationships between various mutual exclusion assumptions and the starvation-free alternators (SFAs) under various execution models.Then, as a remedy for the deficiencies  ...  Acknowledgments We thank Ted Herman and the anonymous referees for their suggestions and constructive comments on the manuscript. Their suggestions have greatly enhanced the paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.jcss.2005.05.001">doi:10.1016/j.jcss.2005.05.001</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zw7tfzuwizhuvevwimsqsnixyu">fatcat:zw7tfzuwizhuvevwimsqsnixyu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170924120622/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/147/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDAyMjAwMDAwNTAwMDU0MQ%3D%3D.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/82/a0/82a0180c9a8c4c664f6fbd764f049e9b3cb889df.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.jcss.2005.05.001"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Cluster Based Distributed Mutual Exclusion Algorithms for Mobile Networks [chapter]

Kayhan Erciyes
<span title="">2004</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> &nbsp;
Each cluster is represented by a coordinator node on the ring which implements various distributed mutual exclusion algorithms on behalf of any member in the cluster it represents.  ...  We propose an architecture that consists of a ring of clusters for distributed mutual exclusion algorithms in mobile networks.  ...  Lamport's algorithm and RA algorithm are considered as one of the only fair distributed mutual exclusion algorithms in literature.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-27866-5_124">doi:10.1007/978-3-540-27866-5_124</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/a526kory2nernlcivktrxr47ki">fatcat:a526kory2nernlcivktrxr47ki</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810032856/http://ube.ege.edu.tr/~erciyes/euro_erciyes.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/08/8d/088d355bb5721c574b723d671b7f86abfade536d.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-540-27866-5_124"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A Taxonomy of Daemons in Self-stabilization [article]

Swan Dubois, Sébastien Tixeuil (LIP6, IUF)
<span title="2011-10-03">2011</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We show that four main characteristics (distribution, fairness, boundedness, and enabledness) are enough to encapsulate the various differences presented in existing work.  ...  We survey existing scheduling hypotheses made in the literature in self-stabilization, commonly referred to under the notion of daemon.  ...  Local mutual exclusion refines mutual exclusion since it requires the same exclusion and liveness properties but only within a vicinity around each vertex (and not for the whole graph as for the -global  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1110.0334v1">arXiv:1110.0334v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/thaia53xyzeg3c3tjktdywq5yi">fatcat:thaia53xyzeg3c3tjktdywq5yi</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1110.0334/1110.0334.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> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1110.0334v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Toward a non-atomic era: l-exclusion as a test case

Danny Dolev, Eli Gafni, Nir Shavit
<span title="">1988</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jlc5kugafjg4dl7ozagimqfcbm" style="color: black;">Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC &#39;88</a> </i> &nbsp;
Though it has been shown that "test and set" cannot be implemented from safe registers, we show how to achieve a fair solu-  ...  useful tools for process synchronization.  ...  Acknowledgements We wish to thank Mike Merrit and Larry Rudolph for important conversations during the course of our work.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/62212.62220">doi:10.1145/62212.62220</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/stoc/DolevGS88.html">dblp:conf/stoc/DolevGS88</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xmtsek3crza7jndsu4g7rxp4v4">fatcat:xmtsek3crza7jndsu4g7rxp4v4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160629095358/http://www.cs.tau.ac.il/~shanir/nir-pubs-web/Papers/Non_Atomic_Era.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/08/1a/081af7a7d7d76eb80e924532747c6ae199c53d90.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/62212.62220"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Wait-Free Stabilizing Dining Using Regular Registers [chapter]

Srikanth Sastry, Jennifer L. Welch, Josef Widder
<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> &nbsp;
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  ...  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  ...  Mutual exclusion. Mutual exclusion [10] is a degenerate case of the dining philosophers problem in which the conflict graph is a complete graph.  ... 
<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>
<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>

Neighborhood Mutual Remainder: Self-Stabilizing Implementation of Look-Compute-Move Robots (Extended Abstract) [article]

Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita and Koichi Wada
<span title="2019-03-07">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Local mutual exclusion guarantees that no two neighboring processes enter a critical section at the same time while satisfying both mutual exclusion and no starvation properties.  ...  A distributed algorithm that satisfies the neighborhood mutual remainder requirement should satisfy global fairness, l-exclusion and repeated local rendezvous requirements.  ...  Acknowledgement This research was supported by Japan Science and Technology Agency (JST) as part of Strategic International Collaborative Research Program (SICORP).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1903.02843v1">arXiv:1903.02843v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5i2mk2f2dfbpfgjmewif3nmy5a">fatcat:5i2mk2f2dfbpfgjmewif3nmy5a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200910144236/https://arxiv.org/pdf/1903.02843v1.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/02/ad/02adb522426eb05d86567761b32ae2cc6ac955c5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1903.02843v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Page 9537 of Mathematical Reviews Vol. , Issue 2003m [page]

<span title="">2003</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
The local mutual exclusion problem is to grant a process the privilege to enter the critical section if and only if none of its neighbors has the privilege.  ...  The core of the transformer is a self-stabilizing local mutual exclusion algorithm.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_2003-12_2003m/page/9537" title="read fulltext microfilm" 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> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_2003-12_2003m/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Mutually-aware Sub-Graphs Differentiable Architecture Search [article]

Haoxian Tan, Sheng Guo, Yujie Zhong, Matthew R. Scott, Weilin Huang
<span title="2021-11-06">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The core of our framework is a differentiable Gumbel-TopK sampler that produces multiple mutually exclusive single-path sub-graphs.  ...  We demonstrate the effectiveness of our methods on ImageNet and CIFAR10, where the searched models show a comparable performance as the most recent approaches.  ...  In other words, they are mutually exclusive. The sampling of mutually exclusive sub-graphs can be implemented in a differentiable manner by our Gumbel TopK sampler.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2107.04324v3">arXiv:2107.04324v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xi47dor6ljdp3iygqhvgcvucwq">fatcat:xi47dor6ljdp3iygqhvgcvucwq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20211113210702/https://arxiv.org/pdf/2107.04324v3.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/09/c2/09c2de3fa0a1762e5aa78e7a8d2135725c6d0f28.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2107.04324v3" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Partial mutual exclusion for infinitely many processes [article]

Wim H. Hesselink
<span title="2011-12-06">2011</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Partial mutual exclusion is the drinking philosophers problem for complete graphs.  ...  It is the problem that a process may enter a critical section CS of its code only when some finite set nbh of other processes are not in their critical sections.  ...  The proof of mutual exclusion In Section 2.3, we saw that the mutual exclusion predicate PMX is implied by Iq0, Iq1, and Iq2.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1111.5775v2">arXiv:1111.5775v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mulbn7ykxngbrbs44nkt7345oe">fatcat:mulbn7ykxngbrbs44nkt7345oe</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1111.5775/1111.5775.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> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1111.5775v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

A semantics driven temporal verification system [chapter]

G. D. Gough, H. Barringer
<span title="">1988</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> &nbsp;
We present an overview of SMG, a generic state machine generator, which interfaces to various temporal logic model checkers and provides a practical generic temporal verification system.  ...  It can be applied, in particular, to the verification of temporal properties of concurrent and reactive systems.  ...  mutual exclusion property, as a formula in the same logic.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-19027-9_2">doi:10.1007/3-540-19027-9_2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/okuk3f5cnzamtf7out7kqp25li">fatcat:okuk3f5cnzamtf7out7kqp25li</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180724151704/https://link.springer.com/content/pdf/10.1007%2F3-540-19027-9_2.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/ba/37/ba37100342d2265c8680196de94011f609519173.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-19027-9_2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Weak Fairness Semantic Drawbacks in Java Multithreading [chapter]

Claude Kaiser, Jean-François Pradat-Peyre
<span title="">2009</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> &nbsp;
It is the aim of this paper to exemplify some subtle programming errors that may result from the process queuing and awaking policy, which corresponds to a weak fairness semantic and which has been chosen  ...  In this example, several implementations are presented, the last ones aiming to provide deterministic process awakening.  ...  Every implementation has to provide mutual exclusion during the execution of a distinguished sequence .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-01924-1_7">doi:10.1007/978-3-642-01924-1_7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/scn4cbtf4zhpxlveo5dmpbvhmm">fatcat:scn4cbtf4zhpxlveo5dmpbvhmm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170705060932/http://cedric.cnam.fr/fichiers/RC1668.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/0e/d4/0ed402a6cdd62b0f361e98bf292508ce624b434d.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-01924-1_7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Page 5690 of Mathematical Reviews Vol. , Issue 99h [page]

<span title="">1999</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
This figure is Q(logn) bits for fair mutual exclusion between n processes 68 COMPUTER SCIENCE 5690 done deterministically, but just O(loglogn) bits randomized—a re- sult established by Rabin [J.  ...  Although this result is use- ful, in that a loose end is tied up, perhaps of greater interest is the technique by which the result was achieved, which was by relat- ing the fairness of mutual exclusion  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1999-08_99h/page/5690" title="read fulltext microfilm" 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> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1999-08_99h/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Bounded Fairness [chapter]

Nachum Dershowitz, D. N. Jayasimha, Seungjoon Park
<span title="">2003</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> &nbsp;
processes that access the resource with mutual exclusion.  ...  Bounded fairness, a stronger notion than the usual fairness based on eventuality, can be used, for example, to relate the frequency of shared resource access of a particular process with regard to other  ...  Acknowledgments We thank Tim Carlson and Neelam Soundararajan for useful discussions on this topic and Lenore Zuck for helping with the proof of Theorem 2.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-39910-0_14">doi:10.1007/978-3-540-39910-0_14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kuo4m5c7qneshflzz3rr72hpdq">fatcat:kuo4m5c7qneshflzz3rr72hpdq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190228083319/http://pdfs.semanticscholar.org/8f0a/fcc83a673ea2f1c31e2216bbb558760671a9.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/8f/0a/8f0afcc83a673ea2f1c31e2216bbb558760671a9.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-540-39910-0_14"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 27,949 results