A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
A proof of burns N-process mutual exclusion algorithm using abstraction
[chapter]
1998
Lecture Notes in Computer Science
Preserved Fulltext
We use our abstraction theorem to verify that Burns distributed mutual exclusion algorithm parameterized in the number of processes n satisfies the mutual exclusion property. ...
The concrete n-process algorithm is abstracted by a simple 2-process algorithm which is property preserving with respect to the mutual exclusion property. ...
[2 5 Burns N-Process Mutual Exclusion Algorithm In this section we present Burns n-process distributed mutual exclusion algorithm, which we will verify with respect to the mutual exclusion property ...
doi:10.1007/bfb0054186
fatcat:vat3youkjja4zfax5lkho3vuqq
Page 342 of Mathematical Reviews Vol. , Issue 84a
[page]
1984
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
N-process mutual exclusion with bounded waiting by
4-log, N-valued shared variable.
J. Comput. System Sci. 25 (1982), no. 1, 66-75. ...
We introduce the idea of employing randomization in the mutual exclusion protocol and achieve a mutual exclusion solution, which is with probability 1 lockout-free and bounded-waiting, using just a 4-log ...
Invisible Invariants in the Spotlight
2020
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We study the problem of automatically proving parameterized mutual exclusion algorithms mutually exclusive. ...
We show that this technique is able to automatically produce modular proofs of mutual exclusion for basic algorithms from the literature. ...
Interestingly, the proof makes extensive use of the fact that the model captures mutual exclusion algorithms. ...
doi:10.5281/zenodo.4091560
fatcat:nwt4uh4z4ffnneaq73z57kjdfa
Invisible Invariants in the Spotlight
2020
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We study the problem of automatically proving parameterized mutual exclusion algorithms mutually exclusive. ...
We show that this technique is able to automatically produce modular proofs of mutual exclusion for basic algorithms from the literature. ...
Interestingly, the proof makes extensive use of the fact that the model captures mutual exclusion algorithms. ...
doi:10.5281/zenodo.4094708
fatcat:pdzvwxzaabbfjdnslwqmuprhkq
Allocate-On-Use Space Complexity of Shared-Memory Algorithms
2018
International Symposium on Distributed Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Many fundamental problems in shared-memory distributed computing, including mutual exclusion [8], consensus [18] , and implementations of many sequential objects [14] , are known to require linear space ...
The significance of these bounds is justified by an assumption that any space that is used in some execution must be allocated for all executions. ...
We can guard against this using Lamport's fast mutual exclusion algorithm [15] , which is now often abstracted in the form of a splitter object [16] . ...
doi:10.4230/lipics.disc.2018.8
dblp:conf/wdag/AspnesHTW18
fatcat:vhpuhanqjvc6neot5bzpnsqyh4
Tight time-space tradeoff for mutual exclusion
2012
Proceedings of the 44th symposium on Theory of Computing - STOC '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
Mutual Exclusion is a fundamental problem in distributed computing, and the problem of proving upper and lower bounds on the RMR complexity of this problem has been extensively studied. ...
To prove these results we show that the complexity of mutual exclusion, which can be "messy" to analyze because of system details such as asynchrony and cache coherence, is captured precisely by a simple ...
Let A be a one-shot mutual exclusion algorithm for a set Π of n processes and V be the set of shared variables used in A. ...
doi:10.1145/2213977.2214065
dblp:conf/stoc/BansalBJK12
fatcat:nwjpn6tqzzfhhdow62jqcs3xdy
Lower Bounds for Randomized Mutual Exclusion
1998
SIAM journal on computing (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
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. ...
Theorem 4: Every mutual-exclusion algorithm A for n processes which guarantees O(t)-fairness requires a shared variable of (log log n) bits. ...
Rabin x David Zuckerman { Abstract We establish, for the rst time, lower bounds for randomized mutual-exclusion algorithms (with a read-modify-write operation). ...
doi:10.1137/s009753979426513x
fatcat:khhyeod6sjce3piukp4xg4lr6a
Tournaments for mutual exclusion: verification and concurrent complexity
2017
Formal Aspects of Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Given a mutual exclusion algorithm MXd for d ≥ 2 threads, a mutual exclusion algorithm for N > d threads can be built in a tree of degree d with N leaves, with the critical section at the root of the tree ...
If moreover MXd satisfies FCFS (first-come first-served), the worst case individual delay of the tournament algorithm is of order N . This is optimal. ...
MXd is used to form a mutual exclusion algorithm for N > d threads by means of a d -ary tree with N leaves, one leaf per thread. When a thread is idle, it resides in its leaf. ...
doi:10.1007/s00165-016-0407-x
fatcat:ero6y6vs5jbuxhu74odovgmxc4
All for the Price of Few
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
It relies on an abstraction function that views the system from the perspective of a fixed number of processes. ...
The abstraction is used during the verification procedure in order to dynamically detect cut-off points beyond which the search of the state space need not continue. ...
Furthermore, our algorithm relies on a very simple abstraction function, where a configuration of the system is approximated by its sub-structures (subwords, subtrees, etc.). ...
doi:10.1007/978-3-642-35873-9_28
fatcat:wx5okrcigzhfvc76x6iosisvmy
A note on group mutual exclusion
2001
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing - PODC '01
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Keane and Moir later gave a precise statement of this property and devised a simple group mutual exclusion algorithm that satisfies it. ...
In group mutual exclusion a process requests a "session" before entering its critical section; processes are allowed to be in the critical section simultaneously provided they have requested the same session ...
We are investigating the feasibility of a FCFS group mutual exclusion algorithm that uses only O(N) bounded shared variables. ...
doi:10.1145/383962.383997
dblp:conf/podc/Hadzilacos01
fatcat:cyvdytu65nfsbapocdpgmhq5jm
Evolution of distributed computing theory
2008
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing - PODC '08
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Mutual exclusion Concurrent processes must coordinate their activities to avoid interference. The mutual exclusion problem is to provide exclusive access to a critical region of code. ...
Process abstraction and pseudo-concurrency Desire to run multiple tasks on a single computer led to the development of the process abstraction. ...
doi:10.1145/1400751.1400858
dblp:conf/podc/Fischer08
fatcat:ospmit6o2jfbnos53f7zvpl4n4
A lightweight regular model checking approach for parameterized systems
2011
International Journal on Software Tools for Technology Transfer (STTT)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper we give a uniform presentation of several variations of a symbolic backward reachability scheme in which different classes of regular expressions are used in place of BDDs. ...
Our approach combines the strength of regular languages, used for representing infinite sets of configurations, with symbolic model checking and approximations. ...
These examples include the Illinois and the DEC Firefly cache coherence protocols from [18] , the Bakery and Burns mutual exclusion algorithms used in [4] ; a model of Szymanski's algorithm with atomicity ...
doi:10.1007/s10009-011-0213-y
fatcat:kyrrmlmlznhtlklnmbn4vhay6e
A hundred impossibility proofs for distributed computing
1989
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing - PODC '89
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
very simple problem of achieving mutual algorithm, in which the processes request the resource exclusion between two processes, using a single shared and take steps in various orders. ...
(mutual exclusion, clusion. ...
doi:10.1145/72981.72982
dblp:conf/podc/Lynch89
fatcat:pvj6wtkwsnffvne5mdfdxpe6bi
Ordered Counter-Abstraction
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Such a system consists of arbitrary many finite processes placed in an array. Processes communicate using global transitions constrained by their relative positions (i.e., priorities). ...
The proposed automatic analysis is at least as precise and e cient as monotonic abstraction when performed backwards. It can also be used in forward, something monotonic abstraction is incapable of. ...
Burns mutual exclusion algorithm. In this algorithm (left of Fig.4) , each process has a local boolean flag f in addition to seven locations {l 1 , . . . l 7 }. ...
doi:10.1007/978-3-319-04921-2_32
fatcat:vbjuc57b2veuhdc4zqkzmryncq
Tight Bounds for Asynchronous Renaming
2014
Journal of the ACM
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The proof is based on a new reduction from renaming to another fundamental problem in distributed computing: mutual exclusion. ...
This article presents the first tight bounds on the time complexity of shared-memory renaming, a fundamental problem in distributed computing in which a set of processes need to pick distinct identifiers ...
Mutual Exclusion The goal of the mutual exclusion (mutex) problem is to allocate a single, indivisible, nonshareable resource among n processes. ...
doi:10.1145/2597630
fatcat:gt7j4fblafgwlmghg7psymbhfi
« Previous
Showing results 1 — 15 out of 3,114 results