|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'506'133
Articles rated: 2609
27 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
A Wait-Free Stack | | Seep Goel
; Pooja Aggarwal
; Smruti R. Sarangi
; | | Date: |
1 Oct 2015 | | Abstract: | In this paper, we describe a novel algorithm to create a con- current
wait-free stack. To the best of our knowledge, this is the first wait-free
algorithm for a general purpose stack. In the past, researchers have proposed
restricted wait-free implementations of stacks, lock-free implementations, and
efficient universal constructions that can support wait-free stacks. The crux
of our wait-free implementation is a fast pop operation that does not modify
the stack top; instead, it walks down the stack till it finds a node that is
unmarked. It marks it but does not delete it. Subsequently, it is lazily
deleted by a cleanup operation. This operation keeps the size of the stack in
check by not allowing the size of the stack to increase beyond a factor of W as
compared to the actual size. All our operations are wait-free and linearizable. | | Source: | arXiv, 1510.0116 | | 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 Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER