首页> 外文会议>Distributed computing >A Scalable Lock-Free Universal Construction with Best Effort Transactional Hardware
【24h】

A Scalable Lock-Free Universal Construction with Best Effort Transactional Hardware

机译:具有尽力而为的交易硬件的可扩展的无锁通用结构

获取原文
获取原文并翻译 | 示例

摘要

The imminent arrival of best-effort transactional hardware has spurred new interest in the construction of nonblocking data structures, such as those that require atomic updates to k words of memory (for some small value of k). Since transactional memory itself (TM) was originally proposed as a universal construction for crafting scalable lock-free data structures, we explore the possibility of using this emerging transactional hardware to implement a scalable, unbounded transactional memory that is simultaneously nonblocking and compatible with strong language-level semantics. Our results show that it is possible to use this new hardware to build nonblocking TM systems that perform as well as their blocking counterparts. We also find that while the construction of a lock-free TM is possible, correctness arguments are complicated by the many caveats and corner cases that are built into current transactional hardware proposals.
机译:尽力而为的交易硬件的到来已经激发了人们对构建非阻塞数据结构的新兴趣,例如那些需要对k个内存字进行原子更新(对于k的较小值)的数据结构。由于事务内存本身(TM)最初是作为用于构建可伸缩的无锁数据结构的通用结构而提出的,因此我们探索了使用这种新兴的事务硬件来实现可伸缩的,无边界的事务内存的可能性,该事务同时无阻塞且与强语言兼容级语义。我们的结果表明,可以使用这种新硬件来构建性能非阻塞的非阻塞TM系统。我们还发现,尽管可以构建无锁TM,但由于当前交易硬件建议中内置的许多警告和极端情况,使得正确性参数变得复杂。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号