Affiliation:
1. The Technion, Haifa, Israel
Abstract
We present an algorithm for implementing binary operations (of any type) from unary
load-linked
(LL) and
store-conditional
(SC) operations. The performance of the algorithm is evaluated according to its
sensitivity
, measuring the distance between operations in the graph induced by conflicts, which guarantees that they do not influence the step complexity of each other. The sensitivity of our implementation is
O
(log
*
n
), where
n
is the number of processors in the system. That is, operations that are Ω(log
*
n
) apart in the graph induced by conflicts do not delay each other. Constant sensitivity is achieved for operations used to implement heaps and array-based linked lists.We also prove that there is a problem which can be solved in
O
(1) steps using binary LL/SC operations, but requires
O
(log log
*
n
) operations if only unary LL/SC operations are used. This indicates a non-constant gap between unary and binary, LL/SC operations.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Faster Randomized Repeated Choice and DCAS;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17
2. Fast and Fair Randomized Wait-Free Locks;Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing;2022-07-20
3. Efficient randomized DCAS;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15
4. Universal constructions that ensure disjoint-access parallelism and wait-freedom;Distributed Computing;2016-01-21
5. Built-in Coloring for Highly-Concurrent Doubly-Linked Lists;Theory of Computing Systems;2012-08-01