• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Parallel and Distributed Systems, IEEE Transactions on >Integrating Lock-Free and Combining Techniques for a Practical and Scalable FIFO Queue
【24h】

Integrating Lock-Free and Combining Techniques for a Practical and Scalable FIFO Queue

机译：集成无锁和组合技术以实现实用且可扩展的FIFO队列

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Concurrent FIFO queues can be generally classified into lock-free queues and combining-based queues. Lock-free queues require manual parameter tuning to control the contention level of parallel execution, while combining-based queues encounter a bottleneck of single-threaded sequential combiner executions at a high concurrency level. In this paper, we introduce a different approach using both lock-free techniques and combining techniques synergistically to design a practical and scalable concurrent queue algorithm. As a result, we have achieved high scalability without any parameter tuning: on an 80-thread average throughput in our experimental results, our queue algorithm outperforms the most widely used Michael and Scott queue by 14.3 times, the best-performing combining-based queue by 1.6 times, and the best performing 86-dependent lock-free queue by 1.7 percent. In addition, we designed our algorithm in such a way that the life cycle of a node is the same as that of its element. This has huge advantages over prior work: efficient implementation is possible without dedicated memory management schemes, which are supported only in some languages, may cause a performance bottleneck, or are patented. Moreover, the synchronized life cycle between an element and its node enables application developers to further optimize memory management.
机译：并发FIFO队列通常可以分为无锁队列和基于组合的队列。无锁队列需要手动调整参数以控制并行执行的竞争级别，而基于组合的队列则在高并发级别遇到了单线程顺序组合器执行的瓶颈。在本文中，我们介绍了一种使用无锁技术和协同组合技术的不同方法，以设计一种实用且可扩展的并发队列算法。结果，我们无需进行任何参数调整即可实现高可伸缩性：在实验结果中，平均80个线程的吞吐量上，我们的队列算法的性能比最广泛使用的Michael和Scott队列高出14.3倍，是性能最佳的基于组合的队列的性能提高了1.6倍，而性能最佳的依赖于86的无锁队列提高了1.7％。此外，我们以一种节点的生命周期与其元素的生命周期相同的方式设计了算法。与以前的工作相比，它具有巨大的优势：无需专用的内存管理方案（仅在某些语言中受支持，可能导致性能瓶颈或已申请专利），就可以高效实现。此外，元素与其节点之间的同步生命周期使应用程序开发人员可以进一步优化内存管理。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号