确定性近似对象的上下界
Upper and Lower Bounds for Deterministic Approximate Objects
摘要：
放松共享对象的顺序规范已被提出作为一个有前途的方法，以获得更好的复杂性实现。在本文中，我们研究了两个共同的共享对象：最大寄存器和计数器的放松变种的步骤复杂性。特别地，我们考虑$k$ -乘法精确最大寄存器和$k$ -乘法精确计数器，其中允许读取操作以$k$的乘法因子出错（对于某些$k \in \mathbb{N}$）。更准确地说，允许读取分别返回先前写入最大寄存器的最大值$v$的近似值$x$，或者先前应用于计数器的增量的数目$v$的近似值$x$，使得$v/k \leq x \leq v \cdot k$。我们提供了在共享内存模型中以无等待方式实现这些对象的复杂性的上限和下限。
英文摘要：
Relaxing the sequential specification of shared objects has been proposed as a promising approach to obtain implementations with better complexity. In this paper, we study the step complexity of relaxed variants of two common shared objects: max registers and counters. In particular, we consider the $k$-multiplicative-accurate max register and the $k$-multiplicative-accurate counter, where read operations are allowed to err by a multiplicative factor of $k$ (for some $k \in \mathbb{N}$). More accurately, reads are allowed to return an approximate value $x$ of the maximum value $v$ previously written to the max register, or of the number $v$ of increments previously applied to the counter, respectively, such that $v/k \leq x \leq v \cdot k$. We provide upper and lower bounds on the complexity of implementing these objects in a wait-free manner in the shared memory model.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
