October 25, Pavia, Italy
November 6-8, Berlin, Germany
November 3-8, Kona, HI, USA
By Adrien Hamelin | Aug 5, 2016 01:57 PM | Tags: basics
Quick A: A set does not allow the modification of its keys.
Recently on SO:
Why does std::set seem to force the use of a const_iterator?
A set is like a map with no values, only keys. Since those keys are used for a tree that accelerates operations on the set, they cannot change. Thus all elements must be const to keep the constraints of the underlying tree from being broken.
By Adrien Hamelin | Aug 5, 2016 01:52 PM | Tags: performance experimental
Have you registered for CppCon 2016 in September? Don’t delay – Registration is open now.
While we wait for this year’s event, we’re featuring videos of some of the 100+ talks from CppCon 2015 for you to enjoy. Here is today’s feature:
C++ Atomics: The Sad Story of memory_order_consume: A Happy Ending At Last?
by Paul E. McKenney
Summary of the talk:
One of the big advantages of C++ atomics is that developers can now let the compiler know about the intent behind their multi-threaded synchronization mechanisms. At least they can tell the compiler as long as the synchronization mechanism in question is not RCU. You see, all production compilers promote RCU's memory_order_consume to memory_order_acquire. Although this promotion does ensure correctness, it also ensures the additional overhead of memory-barrier instructions on weakly ordered systems and of needlessly suppressed compiler optimizations on all systems.
All previous attempts to resolve this issue have foundered on either standard-committee reluctance to eviscerate the standard for a special case, compiler-writer reluctance to eviscerate their compilers for a special case, and kernel-developers reluctance to eviscerate their source base for late-to-the-party compiler support.
But now there is a glimmer of hope in the guise of a small set of small patches to the Linux kernel that eliminate the most challenging use cases. Will this hope be realized? Come to this talk to here the story, which by September will hopefully have a happy ending!
By robwirving | Aug 5, 2016 10:51 AM | Tags: None
Episode 66 of CppCast the only podcast for C++ developers by C++ developers. In this episode Rob and Jason are joined by Michael Afanasiev to discuss his work on the Salvus library used for performing full-waveform inversions.
CppCast Episode 66: Salvus with Michael Afanasiev
by Rob Irving and Jason Turner
About the interviewee:
Michael Afanasiev is currently working on his PhD in Geophysics. He became interested in programming and high performance computing during his BSc in Computational Physics, playing around with simulations of star formation. After a brief attempt to lead a roguish and exciting lifestyle as a field Geophysicist, he was brought back to the keyboard during a MSc, where he began working on full waveform inversion (FWI). In 2013 he moved to Switzerland to continue working on FWI as a PhD student at ETH Zurich, where he’s currently wrapping things into a thesis. He spends most of his time writing scientific software, wandering through the alps, and atoning for the times he repeated the mantra “Fortran is the best language for scientific computing.”
By Adrien Hamelin | Aug 3, 2016 01:56 PM | Tags: performance experimental
Have you registered for CppCon 2016 in September? Don’t delay – Registration is open now.
While we wait for this year’s event, we’re featuring videos of some of the 100+ talks from CppCon 2015 for you to enjoy. Here is today’s feature:
Concurrency TS Editor's Report
by Artur Laksberg
Summary of the talk:
In this presentation we will talk about the new C++ concurrency features that have been included in the Concurrency Technical Specification.
The TS should be of interest to anyone writing concurrent code in C++. The proposal includes improved futures for wait-free composition of asynchronous operations (including their relationship with C++ 'await'), new synchronization constructs as well as atomic smart pointers.
By Meeting C++ | Aug 3, 2016 01:15 AM | Tags: performance intermediate efficiency c++11 basics advanced
The last video from Meeting C++ 2015 is online:
Taming the Performance Beast
by Klaus Iglberger
By Jason Turner | Aug 1, 2016 02:05 PM | Tags: c++17 basics
Episode 22 of C++ Weekly.
C++17's Nested Namespaces and `std::clamp`
by Jason Turner
About the show:
This week Jason describes C++17's nested namespace support and the new library function `std::clamp`.
By Adrien Hamelin | Aug 1, 2016 12:58 PM | Tags: efficiency community
Have you registered for CppCon 2016 in September? Don’t delay – Registration is open now.
While we wait for this year’s event, we’re featuring videos of some of the 100+ talks from CppCon 2015 for you to enjoy. Here is today’s feature:
Writing Great Libraries: 89 Easy Steps
by Zach Laine
Summary of the talk:
Writing code that does what you want it to do, correctly and efficiently, is hard. Doing so when you don't even know yet what you want the code to do yet is quite a bit harder. Yet this is the job of a library writer -- the users of a library may have a very different use case from that of the original author.
How do library writers develop correct and efficient APIs that are also:
- easy to use correctly - hard to use incorrectly - highly reusable - gracefully interoperable with other code
This talk gives lots of practical advice and techniques for accomplishing those goals and more.
By Meeting C++ | Jul 31, 2016 06:16 AM | Tags: user groups community
The monthly overview on upcoming C++ User Group meetings on Meeting C++:
C++ User Group Meetings in August
by Jens Weller
From the article:
The monthly overview on the upcoming C++ User Group meetings. As there is again a group meeting at the first, I have to publish this today, so that there will still be some groups not in the listing, as they are publishing their meetings in the coming days. Still, already 26 groups will meet in August!
There are 3 new C++ User Groups: Copenhagen, Singapore, and Gdansk.
By Blog Staff | Jul 29, 2016 03:50 PM | Tags: None
A new WG21 paper is available. If you are not a committee member, please use the comments section below or the std-proposals forum for public discussion.
Document number: N4608
Date: 2016-07-21
PL22.16/WG21 draft agenda: 7-12 Nov 2016, Issaquah, WA, US
by Clark Nelson
Excerpt:
The primary goals of this meeting will be:
- Process ballot comments for C++17 CD (N4604)
- Try to advance Library Fundamentals v2 to TS
Additional, lower-priority goals include:
- Try to advance Modules to PDTS
- Try to advance Ranges to PDTS
- Try to advance Networking to PDTS
- Try to advance Parallelism v2 to PDTS
- Try to advance Concurrency v2 to NP
By Adrien Hamelin | Jul 29, 2016 01:21 PM | Tags: advanced
How to synchronize between threqds or
Memory consistency made simple(ish)
by Glennan Carnie
From the article:
The C++11 memory consistency model is probably one of the most significant aspects of Modern C++; and yet probably one of the least well-understood. I think the reason is simple: it’s really difficult to understand what the problem actually is.
The memory consistency problem is a concurrency problem. That is, it’s a problem that occurs when we start writing multi-threaded code. More specifically, it’s a parallelism problem – the real subtleties occur when you have two or more processors executing code...