首页> 外文会议>Principles and practice of parallel programming >Supporting Lock-Free Composition of Concurrent Data Objects
【24h】

Supporting Lock-Free Composition of Concurrent Data Objects

机译:支持并发数据对象的无锁组合

获取原文

摘要

Lock-free data objects offer several advantages over their blocking counterparts, such as being immune to deadlocks and convoying and, more importantly, being highly concurrent. But they share a common disadvantage in that the operations they provide are difficult to compose into larger atomic operations while still guaranteeing lock-freedom. We present a lock-free methodology for composing highly concurrent linearizable objects together by unifying their linearization points. This makes it possible to relatively easily introduce atomic lock-free move operations to a wide range of concurrent objects. Experimental evaluation has shown that the operations originally supported by the data objects keep their performance behavior under our methodology.
机译:与无阻塞数据对象相比,无锁数据对象具有多个优点,例如,不受死锁和攻击的影响,更重要的是,高度并发。但是它们有一个共同的缺点,即它们所提供的操作很难组成更大的原子操作,同时仍然保证了锁的自由性。我们提出了一种无锁方法,可通过统一其线性化点来将高度并行的线性化对象组合在一起。这使得可以相对容易地将原子无锁移动操作引入到大量并发对象中。实验评估表明,数据对象最初支持的操作在我们的方法论下保持其性能行为。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号