多重队列的消息传递实现的改进与部分紧致下界
Improved and Partially-Tight Lower Bounds for Message-Passing Implementations of Multiplicity Queues
AI总结:
针对多重队列消息传递实现,本文通过扩展移动参数和归纳不可区分性证明提高了统一算法的下界,并给出特殊情况的紧致上界,为未来下界证明技术提供了新思路。
摘要:
多重队列是一种并发定义的数据类型,它放宽了线性一致 FIFO 队列的条件,允许并发的 Dequeue 实例返回相同的值。这似乎应该允许更快的实现,因为进程不需要等待那么长时间来了解远程进程的并发操作,并且先前的工作已经表明,多重队列在计算上比未放宽的版本复杂度更低。有趣的是,最近的工作表明,与未放宽的队列实现相比,实际上并没有太多可能的加速。为了理解这种直觉与真实行为之间的差异,我们扩展了该项工作,提高了统一算法的下界。此外,我们概述了一条通向为更高下界构建证明的路径,使我们能够假设 Dequeue 的最坏情况时间接近最大消息延迟,这与未放宽的 Dequeue 所需的时间相似。我们还给出了一个特殊情况的上界,以表明我们的界限在该点是紧致的。为了实现我们的下界,我们使用了扩展的移动参数,这些参数很少被使用,但允许比传统移动参数更大的下界。我们在一系列归纳不可区分性证明中使用这些参数,这使我们能够将证明扩展到移动参数的通常限制之外。这种证明结构是独立于主要结果的一个有趣贡献,因为开发新的下界证明技术可能在未来的工作中有许多用途。
英文摘要:
A multiplicity queue is a concurrently-defined data type which relaxes the conditions of a linearizable FIFO queue to allow concurrent Dequeue instances to return the same value. It would seem that this should allow faster implementations, as processes should not need to wait as long to learn about concurrent operations at remote processes and previous work has shown that multiplicity queues are computationally less complex than the unrelaxed version. Intriguingly, recent work has shown that there is, in fact, not much speedup possible versus an unrelaxed queue implementation. Seeking to understand this difference between intuition and real behavior, we extend that work, increasing the lower bound for uniform algorithms. Further, we outline a path forward toward building proofs for even higher lower bounds, allowing us to hypothesize that the worst-case time to Dequeue approaches maximum message delay, which is similar to the time required for an unrelaxed Dequeue. We also give an upper bound for a special case to show that our bounds are tight at that point. To achieve our lower bounds, we use extended shifting arguments, which have been rarely used but allow larger lower bounds than traditional shifting arguments. We use these in series of inductive indistinguishability proofs which allow us to extend our proofs beyond the usual limitations of shifting arguments. This proof structure is an interesting contribution independently of the main result, as developing new lower bound proof techniques may have many uses in future work.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。