|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'500'096
Articles rated: 2609
19 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Randomized Two-Process Wait-Free Test-and-Set | | John Tromp
; Paul Vitanyi
; | | Date: |
28 Jun 2001 | | Subject: | Distributed, Parallel, and Cluster Computing ACM-class: C.2; F.2.2 | cs.DC | | Affiliation: | CWI and BioInformatics Solutions) and Paul Vitanyi (CWI and University of Amsterdam | | Abstract: | We present the first explicit, and currently simplest, randomized algorithm for 2-process wait-free test-and-set. It is implemented with two 4-valued single writer single reader atomic variables. A test-and-set takes at most 11 expected elementary steps, while a reset takes exactly 1 elementary step. Based on a finite-state analysis, the proofs of correctness and expected length are compressed into one table. | | Source: | arXiv, cs.DC/0106056 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER