TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

The C11 and C++11 Concurrency Model (2014) [pdf]

63 pointsby clemlaisover 9 years ago

2 comments

mrpopoover 9 years ago
The absolute minimum that average users of the C++ memory ordering system in std atomic loads, etc. [1] should know is that the default memory access scheme is &#x27;sequentially consistent ordering&#x27;, whereas to get the ultimate performance, one should use the &#x27;relaxed&#x27; scheme, or alternatively use &#x27;release&#x2F;acquire&#x27; as described both in the article and in [1].<p>[1] <a href="http:&#x2F;&#x2F;en.cppreference.com&#x2F;w&#x2F;cpp&#x2F;atomic&#x2F;memory_order" rel="nofollow">http:&#x2F;&#x2F;en.cppreference.com&#x2F;w&#x2F;cpp&#x2F;atomic&#x2F;memory_order</a>
评论 #10643053 未加载
评论 #10642951 未加载
评论 #10643078 未加载
chubotover 9 years ago
What are some applications that use &quot;relaxed memory concurrency&quot;? Which ones really benefit from the performance increase?<p>How does it compare with using lock-free &#x2F; immutable data structures? IMO this strategy is less error prone and easier to test. I&#x27;ve written multi-threaded C++, but mostly before C++11.
评论 #10643280 未加载
评论 #10643333 未加载