区分非阻塞:一种新的进程条件和匹配队列算法
Differentiated nonblocking: a new progress condition and a matching queue algorithm
摘要:
本文首先对共享对象和数据结构提出了一个新的活性要求,然后给出了满足该要求的共享队列算法,并证明了其正确性。我们还实现了该算法,并将其与实践中使用的一个众所周知的共享队列算法进行比较。除了有一个更强的最坏情况下的进度保证,我们的实验结果表明,在吞吐量的边际下降的成本,我们的算法是显着公平,我们在这里介绍的公平性的自然定义。
英文摘要:
In this paper, we first propose a new liveness requirement for shared objects and data structures, we then give a shared queue algorithm that satisfies this requirement and we prove its correctness. We also implement this algorithm and compare it to a well-known shared queue algorithm that is used in practice. In addition to having a stronger worst-case progress guarantee, our experimental results suggest that, at the cost of a marginal decrease in throughput, our algorithm is significantly fairer, by a natural definition of fairness that we introduce here.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。