Affiliation:
1. The Technion, Haifa, Israel
Abstract
This article introduces the
sieve
, a novel building block that allows to adapt to the number of simultaneously active processes (the
point contention
) during the execution of an operation. We present an implementation of the sieve in which each sieve operation requires
O
(
k
log
k
) steps, where
k
is the point contention during the operation.The sieve is the cornerstone of the first wait-free algorithms that adapt to point contention using only read and write operations. Specifically, we present efficient algorithms for long-lived renaming, timestamping and collecting information.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference25 articles.
1. Atomic snapshots of shared memory
2. Afek Y. Attiya H. Fouren A. Stupp G. and Touitou D. 1999b. Adaptive long-lived renaming using bounded memory. www.cs.technion.ac.il/∼hagit/pubs/AAFST99disc.ps.gz. Afek Y. Attiya H. Fouren A. Stupp G. and Touitou D. 1999b. Adaptive long-lived renaming using bounded memory. www.cs.technion.ac.il/∼hagit/pubs/AAFST99disc.ps.gz.
Cited by
41 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Anonymous Shared Memory;Journal of the ACM;2022-08-16
2. A visit to mutual exclusion in seven dates;Theoretical Computer Science;2022-06
3. The RedBlue family of universal constructions;Distributed Computing;2020-02-22
4. Lock-free Concurrent Data Structures and How to Model their Performance;2019 19th International Conference on Application of Concurrency to System Design (ACSD);2019-06
5. Poly-logarithmic adaptive algorithms require revealing primitives;Journal of Parallel and Distributed Computing;2017-11