- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
事务内存提议transactionalmemory-TransactionalLanguage
Transactional Language Constructs for C++
Authors: Hans Boehm, HP, hans.boehm@
Justin Gottschlich, Intel, justin.e.gottschlich@
Victor Luchangco, Oracle, victor.luchangco@
Maged Michael, IBM, maged.michael@
Mark Moir, Oracle, mark.moir@
Clark Nelson, Intel, clark.nelson@
Torvald Riegel, Red Hat, triegel@
Tatiana Shpeisman, Intel, tatiana.shpeisman@
Michael Wong, IBM, michaelw@
Document number: N3341=12-0031
Date: 2012-01-11
Project: Programming Language C++, Evolution Working Group
Reply-to: Michael Wong, IBM, michaelw@
Revision: 1
Introduction
We propose that transactional language constructs be integrated into the C++ programming language,
initially as a technical report (TR). We believe that this TR should be considered by the Concurrency
Subgroup. It has impact to both the Core Language and the Library Working Group. This paper should be
of interest to anyone who would like parallel programming in C++ to be easier, and to more easily
support a modular programming paradigm.
1. The Problem
Two types of synchronization supported by C++11 are mutexes, or locks, and atomics. Locks and atomics
are basic abstractions used to access and mutate shared state, as defined by the Three Pillars of
Concurrency [8]. From this view, these abstractions aim to avoid data races and synchronize objects in
shared memory. Unfortunately, locks and atomics are notoriously difficult to use [9]. Simple coarse-grain
locking strategies, where all program data are protected using one or few locks, lead to unnecessary
serialization of program execution and loss of performance. Sophisticated fine-grain locking or use of
atomics result in complex associat
文档评论(0)