Filters








60,532 Hits in 3.8 sec

A fast mutual exclusion algorithm

Leslie Lamport
<span title="1987-01-05">1987</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/th23p5ixr5d5joiuac47oiqstq" style="color: black;">ACM Transactions on Computer Systems</a> </i> &nbsp;
A new solution to the mutual exclusion problem is presented that, in the absence of contention, requires only seven memory accesses. It assumes atomic reads and atomic writes to shared registers.  ...  Michael Powell independently discovered the basic write x, read y, write y, read x mutual exclusion protocol used in the algorithms.  ...  This completes the proof of mutual exclusion for Algorithm 2.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/7351.7352">doi:10.1145/7351.7352</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/isvyp2r5qvgs5nx5r2ylwbxobq">fatcat:isvyp2r5qvgs5nx5r2ylwbxobq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810174357/http://www.hh.se/download/18.70cf2e49129168da0158000145730/lamport-fast-mutual-exclusion.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/72/9e/729e23d784a1e5e9b207c35a3b3aaa539621d52d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/7351.7352"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

A fast, scalable mutual exclusion algorithm

Jae-Heon Yang, James H. Anderson
<span title="1995-08-01">1995</span> <i title="Springer Nature America, Inc"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/c5flcyc6ozdv3p2dehbhbc7pqy" style="color: black;">Distributed computing</a> </i> &nbsp;
We present a new algorithm for N-process mutual exclusion that requires only read and write operations and that has O(log N) time complexity, where \time" is measured by counting remote memory references  ...  Performance studies are presented that show that our mutual exclusion algorithm exhibits scalable performance under heavy contention.  ...  We w ould also like t o a c knowledge Argonne National Laboratories and Lawrence Livermore National Laboratories for providing us with access to the machines used in these studies.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s004460050009">doi:10.1007/s004460050009</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wjeltd2t4ve27nub57vdbill5e">fatcat:wjeltd2t4ve27nub57vdbill5e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20031219001433/http://wwwx.cs.unc.edu:80/~anderson/papers/dc95.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/44/8e/448eeb724de8ff146eee7f40aa689d74b56f3601.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s004460050009"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A fast, scalable mutual exclusion algorithm

Jae-Heon Yang, Jams H. Anderson
<span title="">1995</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/c5flcyc6ozdv3p2dehbhbc7pqy" style="color: black;">Distributed computing</a> </i> &nbsp;
We present a new algorithm for N-process mutual exclusion that requires only read and write operations and that has O(log N) time complexity, where \time" is measured by counting remote memory references  ...  Performance studies are presented that show that our mutual exclusion algorithm exhibits scalable performance under heavy contention.  ...  We w ould also like t o a c knowledge Argonne National Laboratories and Lawrence Livermore National Laboratories for providing us with access to the machines used in these studies.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bf01784242">doi:10.1007/bf01784242</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wmqycjbeqfcitlfpxmfoqexfym">fatcat:wmqycjbeqfcitlfpxmfoqexfym</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20031219001433/http://wwwx.cs.unc.edu:80/~anderson/papers/dc95.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/44/8e/448eeb724de8ff146eee7f40aa689d74b56f3601.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bf01784242"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A Fast Token-Chasing Mutual Exclusion Algorithm in Arbitrary Network Topologies

Yong Yan, Xiaodong Zhang, Haixu Yang
<span title="">1996</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/rwjg7tprafhufajayuvxj2q4n4" style="color: black;">Journal of Parallel and Distributed Computing</a> </i> &nbsp;
We have conducted a group of experiments on a network of workstations for comparisons between our algorithm and two other existing mutual exclusion algorithms.  ...  mutual exclusion algorithm has the following two wellknown features: 1. the algorithms are implemented using available local state information and a message passing mechanism, instead of simply using shared  ...  three existing mutual exclusion algorithms.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1006/jpdc.1996.0078">doi:10.1006/jpdc.1996.0078</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tqqltlniw5evrbi6nlsxgv32se">fatcat:tqqltlniw5evrbi6nlsxgv32se</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20030517154034/http://www.cs.wm.edu:80/hpcs/WWW/HTML/publications/papers/TR-96-01-01.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/3a/6f/3a6f77d6ac40260908bc9166daf9a4b5d05342e8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1006/jpdc.1996.0078"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Read/Write Based Fast-Path Transformation for FCFS Mutual Exclusion [chapter]

Prasad Jayanti, Srdjan Petrovic, Neha Narula
<span title="">2005</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;
Anderson and Kim designed a general transformation that can turn any mutual exclusion algorithm A into a new algorithm A that is fast [3].  ...  This led to research on fast mutual exclusion algorithms that, in the absence of contention, allow a process to enter and exit the Critical Section in O(1) steps.  ...  transforms any FCFS mutual exclusion algorithm into a fast FCFS mutual exclusion algorithm.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-30577-4_24">doi:10.1007/978-3-540-30577-4_24</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/m2f65perj5ddrovw27rdov7p7i">fatcat:m2f65perj5ddrovw27rdov7p7i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060924021234/http://www.cs.dartmouth.edu/~spetrovic/papers/sofsem.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/62/e1/62e18e82bce501408377f338fb4f2cec16ec7108.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-30577-4_24"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Evaluating and designing software mutual exclusion algorithms on shared-memory multiprocessors

X. Zhang, Y. Yan, R. Castaneda
<span title="">1996</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/dpkmwwrufnapfnnny62efrtina" style="color: black;">IEEE Parallel &amp; Distributed Technology Systems &amp; Applications</a> </i> &nbsp;
Figure 16 . 16 The two-process mutual exclusion algorithm for the fast 2,ary tree algorithm.  ...  Figure 17 shows the fast 2-ary tree mutual exclusion algorithm. To avoid interference among node mutual exclusion algorithms in the tree, each node employs an independent set of variables.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/88.481663">doi:10.1109/88.481663</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rdpg2oxmofas5cdeu5btuzhox4">fatcat:rdpg2oxmofas5cdeu5btuzhox4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20070417170042/http://www.cse.ohio-state.edu/hpcs/WWW/HTML/publications/papers/TR-95-06-02.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/0e/0e0eac01d1f4cefb69a5051e5a7d270ac2a9c2b7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/88.481663"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Shared-memory mutual exclusion: major research trends since 1986

James H. Anderson, Yong-Jik Kim, Ted Herman
<span title="2003-09-01">2003</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/c5flcyc6ozdv3p2dehbhbc7pqy" style="color: black;">Distributed computing</a> </i> &nbsp;
Through the years, algorithms such as this, in which a process executes a constant-time "fast path" in the absence of contention, have come to be known simply as "fast" mutual exclusion algorithms.  ...  In Section 4, an overview of research on such algorithms is presented. Over the years, work on fast mutual exclusion algorithms evolved into a broader study of "adaptive" algorithms.  ...  To say that all research on shared-memory mutual exclusion algorithms conducted over the last seventeen years fits within the categories noted above would be incorrect.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00446-003-0088-6">doi:10.1007/s00446-003-0088-6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/g57iqdjp5neu7eu6sm5hpamohi">fatcat:g57iqdjp5neu7eu6sm5hpamohi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20070724051806/http://www.cs.unc.edu/~anderson/papers/survey.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/18/b8/18b864ae7aec09f3975e7235ad8ee2b98a02cf57.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00446-003-0088-6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Fast and Scalable Mutual Exclusion [chapter]

James H. Anderson, Yong-Jik Kim
<span title="">1999</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 a n N-process algorithm for mutual exclusion under read/write atomicity that has O(1) time complexity in the absence of contention and (log N) time complexity under contention, where \time"  ...  Our algorithm is obtained by c o m bining a new \fast-path" mechanism with an arbitration-tree algorithm presented previously by Y ang and Anderson.  ...  In Yang and Anderson's algorithm, instances of a local-spin mutual exclusion algorithm for two processes are embedded within a binary arbitration tree, as depicted in Fig. 1(a) .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-48169-9_13">doi:10.1007/3-540-48169-9_13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4i4ygsabkreejfpo3hfnpqcx2a">fatcat:4i4ygsabkreejfpo3hfnpqcx2a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829225546/http://www.cs.unc.edu/~anderson/papers/disc99.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/d1/f4/d1f4273e5db08a6526cb34d2c20ef2e3e4f07ea8.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-48169-9_13"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Speeding Lamport's fast mutual exclusion algorithm

Michael Merritt, Gadi Taubenfeld
<span title="">1993</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5xfy4fcdxvcvdiybp6iqbffqc4" style="color: black;">Information Processing Letters</a> </i> &nbsp;
A linked list is used to speed up a mutual exclusion algorithm.  ...  Mutual Exclusion Algorithm -process i's program.  ...  There is still the question of maintaining mutual exclusion between inserts and deletes. A natural alternative is to use Lamport's original algorithm to implement mutual exclusion for this purpose.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0020-0190(93)90015-2">doi:10.1016/0020-0190(93)90015-2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gt5xbs4r2necln2jkhdco6l4jy">fatcat:gt5xbs4r2necln2jkhdco6l4jy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20081204130130/http://www.faculty.idc.ac.il/gadi/MyPapers/1993-MT-speedingLamport.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/d5/d6/d5d6c17f0e78574381da7629c5124e8503362dcf.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0020-0190(93)90015-2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

RC4c : A Secured Way to View Data Transmission in Wireless Communication Networks

Olakanmi O.O
<span title="2012-03-31">2012</span> <i title="Academy and Industry Research Collaboration Center (AIRCC)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/oapmgmuv5vasljoxpa3mvlxso4" style="color: black;">International Journal of Computer Networks &amp; Communications</a> </i> &nbsp;
In this paper, a novel method is developed to counter the negative effect of the mutual exclusiveness of the functional operator on RC4 and RC42s.  ...  This encryption algorithm innovatively solves the problem of mutual exclusive of XOR operator in RC4; however, the experimental result shows the improvement rate of 68% over RC4.  ...  It is a fast algorithm, and has also been implemented in hardware chipsets, making it even faster [15] . RC4 is a cipher invented by Ron Rivest.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5121/ijcnc.2012.4208">doi:10.5121/ijcnc.2012.4208</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dgbnttzsnnffxaekzmmyk6bcvy">fatcat:dgbnttzsnnffxaekzmmyk6bcvy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180604022935/http://www.airccse.org/journal/cnc/0312cnc08.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/8e/6a/8e6a127c13029edb2e61975c5748f408207a20e0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5121/ijcnc.2012.4208"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

The notion of a timed register and its application to indulgent synchronization

Michel Raynal, Gadi Taubenfeld
<span title="">2007</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/tewj77cuufbzbgbk265bb462ga" style="color: black;">Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures - SPAA &#39;07</a> </i> &nbsp;
The usefulness of this new type of shared object is demonstrated by presenting simple and elegant indulgent timing-based algorithms that solve the mutual exclusion, -exclusion, adaptive renaming, test&  ...  In this context, a timing-based algorithm is an algorithm whose correctness relies on the existence of a bound ∆ such that any pair of consecutive constrained read and write operations issued by the same  ...  An indulgent mutual exclusion algorithm with a known bound The algorithm. The mutual exclusion problem is well-known.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1248377.1248413">doi:10.1145/1248377.1248413</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/spaa/RaynalT07.html">dblp:conf/spaa/RaynalT07</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ulz3moilfzgxfdbdypdyimrdxy">fatcat:ulz3moilfzgxfdbdypdyimrdxy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20120415082813/http://www.faculty.idc.ac.il/gadi/MyPapers/2007RT-timedRegister.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/7c/f8/7cf806d5c27ecebfbf8b5ecde98ef5d6eda24be4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1248377.1248413"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.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;
This paper proposes a new transformation technique for daemon re- finement. The core of the transformer is a self-stabilizing local mutual exclusion algorithm.  ...  First, we present a bounded-memory self-stabilizing local mutual exclusion algorithm for arbitrary net- works, assuming any arbitrary daemon.  ... 
<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>

A note on group mutual exclusion

Vassos Hadzilacos
<span title="">2001</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/t5fzg7fyy5byfdcl2vrzbn43ty" style="color: black;">Proceedings of the twentieth annual ACM symposium on Principles of distributed computing - PODC &#39;01</a> </i> &nbsp;
Keane and Moir later gave a precise statement of this property and devised a simple group mutual exclusion algorithm that satisfies it.  ...  Group mutual exclusion is a natural problem, formulated by Joung in 1998, that generalises the classical mutual exclusion problem.  ...  Row two uses Lamport's "fast" mutual exclusion algorithm, and rows three and four use the two versions of Yang and Anderson's "scalable" mutual exclusion algorithm.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/383962.383997">doi:10.1145/383962.383997</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/podc/Hadzilacos01.html">dblp:conf/podc/Hadzilacos01</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cyvdytu65nfsbapocdpgmhq5jm">fatcat:cyvdytu65nfsbapocdpgmhq5jm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809025332/http://web.cs.du.edu/~hlee/Teaching/DistAlgo/groupMutualExclusion.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/4c/09/4c09a1dc18f8e989765ed566a05bec92fed46333.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/383962.383997"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

An Adaptive Approach to Recoverable Mutual Exlcusion [article]

Sahil Dhoked, Neeraj Mittal
<span title="2020-08-03">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
This gives rise to the problem of recoverable mutual exclusion (RME) that involves designing a mutual exclusion algorithm that can tolerate failures, while maintaining safety and liveness properties.  ...  Traditionally, mutual exclusion algorithms have been designed under the assumption that a process does not fail while acquiring/releasing a lock or while executing its critical section.  ...  Herea er, we use the terms "mutual exclusion algorithm", "ME algorithm" and "lock" interchangeably. e execution model of a process with respect to a lock is depicted in Algorithm 1.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2006.07086v2">arXiv:2006.07086v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6d7dau2xmffvng3ajndrrm4x5y">fatcat:6d7dau2xmffvng3ajndrrm4x5y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200826040208/https://arxiv.org/pdf/2006.07086v2.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/a3/89/a3894f35575f8b72dd983abd5356c8c767efea07.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2006.07086v2" 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 Practical Single-Register Wait-Free Mutual Exclusion Algorithm on Asynchronous Networks [chapter]

Hyungsoo Jung, Heon Y. Yeom
<span title="">2006</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;
This paper is motivated by a need of practical asynchronous network systems, i.e., a wait-free distributed mutual exclusion algorithm (WDME).  ...  of a naive transformation of the shared-memory mutual exclusion algorithm to an asynchronous network model.  ...  Although a large number of researchers have delved into devising efficient shared-memory mutual exclusion (SME) algorithms, true masterpieces on distributed mutual exclusion (DME) algorithms on practical  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11823285_56">doi:10.1007/11823285_56</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kb5lypx3avbfphnozhy57uo32q">fatcat:kb5lypx3avbfphnozhy57uo32q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20150921191556/http://dl.ifip.org/db/conf/europar/europar2006/JungY06.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/af/bf/afbf8e35cfb974a65284a9f203cfef77265c0a49.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11823285_56"> <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 60,532 results