arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2107.03492cs.DC
收藏

持久性软件组合

Persistent Software Combining

Panagiota Fatourou, Nikolaos D. Kallimanis, Eleftherios Kosmas

摘要:

我们研究了在设计持久算法和数据结构时软件结合的性能能力。我们提出了Bcomb,一个新的阻塞高效的组合协议,并建立在它得到PBcomb,它的持久版本,执行少量的持久化指令,并表现出低同步成本。我们构建了基本的可恢复的数据结构,例如基于PBcomb的堆栈和队列,以及基于PWFcomb的堆栈和队列,PWFcomb是我们提出的一种无等待的通用结构。我们的实验表明,PBcomb和PWFcomb优于迄今为止最先进的可恢复通用结构和事务存储器系统,其中许多确保比我们的算法更弱的一致性属性。我们建立了可恢复的队列和堆栈,PBcomb和PWFcomb的基础上,目前的实验表明,他们有更好的性能比以前的可恢复实现的堆栈和队列。我们建立了第一个并发堆的可恢复实现,并给出了实验,以表明它具有良好的性能时,堆的大小不是很大。

英文摘要:

We study the performance power of software combining in designing persistent algorithms and data structures. We present Bcomb, a new blocking highly-efficient combining protocol, and built upon it to get PBcomb, a persistent version of it that performs a small number of persistence instructions and exhibits low synchronization cost. We built fundamental recoverable data structures, such as stacks and queues based on PBcomb, as well as on PWFcomb, a wait-free universal construction we present. Our experiments show that PBcomb and PWFcomb outperform by far state-of-the-art recoverable universal constructions and transactional memory systems, many of which ensure weaker consistency properties than our algorithms. We built recoverable queues and stacks, based on PBcomb and PWFcomb, and present experiments to show that they have much better performance than previous recoverable implementations of stacks and queues. We build the first recoverable implementation of a concurrent heap and present experiments to show that it has good performance when the size of the heap is not very large.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑