...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Journal of supercomputing >Fast and efficient commits for Lazy-Lazy hardware transactional memory
【24h】

Fast and efficient commits for Lazy-Lazy hardware transactional memory

机译：快速高效地提交Lazy-Lazy硬件事务存储

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

摘要

Transactional memory (TM) is a compelling alternative to simplify multithreaded programming that traditionally relies on error-prone lock-based synchronization for implementing cooperative tasks. Lazy-Lazy hardware TM is one of the most efficient schemes in today's hardware TM systems. Nonetheless, the commit protocol in these systems has severe impact on performance and energy. The SEQ in Scalable-TCC implementation (STCC-SEQ) is the most popular and efficient commit protocol to date. In this paper, we propose GCommit, a cost-effective hardware-based STCC-SEQ protocol. GCommit employs a G-Arbiter microarchitecture for achieving minimal-latency and high-efficient commits. We implement G-Arbiter with a standard 45 nm cell library. For a target 16-core CMP, a G-Arbiter just represents 0.07 % of the whole on-chip area, requiring marginal energy consumption. Full-system simulations of the target system with the STAMP benchmarks show that GCommit achieves average reductions of 15.7 and 13.7 % in execution time and energy, respectively, when compared with STCC-SEQ.
机译：事务性内存（TM）是简化多线程编程的一种引人注目的替代方案，该线程传统上依靠易于出错的基于锁的同步来实现协作任务。懒惰-懒惰硬件TM是当今硬件TM系统中最高效的方案之一。但是，这些系统中的提交协议对性能和能耗有严重影响。可伸缩TCC实现中的SEQ（STCC-SEQ）是迄今为止最流行和最有效的提交协议。在本文中，我们提出了GCommit，一种经济高效的基于硬件的STCC-SEQ协议。 GCommit采用G-Arbiter微体系结构来实现最小延迟和高效提交。我们使用标准的45 nm单元库实现G-Arbiter。对于目标16核CMP，G仲裁器仅占整个片上面积的0.07％，这需要边际能耗。使用STAMP基准测试对目标系统进行的全系统仿真显示，与STCC-SEQ相比，GCommit分别在执行时间和能源上分别减少了15.7和13.7％。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号