.png){kind=icon}
返回
Improved implementations of binary universal operations
.png){kind=icon}
PRE
AI
DOI：10.1145/502102.502105.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
暂无期刊信息
机构
暂无机构信息
引用论文
暂无论文信息