- \n
- C++11<\/strong> and C++14 <\/strong>have the basic building blocks for creating concurrent or parallel programs.<\/li>\n
- With C++17<\/strong> we got the parallel algorithms of the Standard Template Library (STL). That means, most of the algorithms of the STL can be executed sequential, parallel, or vectorized.<\/li>\n
- The concurrency story in C++ goes on. With C++20<\/strong> we can hope for extended futures, coroutines, transactions, and more.<\/li>\n<\/ul>\n
<\/p>\n
<\/p>\n
![\"educative\"](\"https:\/\/www.modernescpp.com\/wp-content\/uploads\/2017\/08\/educative.png\")
<\/a><\/p>\n<\/span>How to Get it?<\/span><\/h2>\n
Use the link to educative: Modern C++ Concurrency: Get the most out of any machine<\/a><\/p>\n
<\/span>What’s Inside?<\/span><\/h2>\n
- \n
- 140 lessons<\/li>\n
- 110 code playgrounds => Run in browser<\/li>\n
- 78 code snippets<\/li>\n
- 55 illustrations<\/li>\n<\/ul>\n
This interactive course explains the details of concurrency<\/strong> in modern C++ and gives you, in addition, more than 100 running code examples<\/strong>. Therefore you can combine the theory with the practices and get the most of it.<\/p>\n
Because this interactive course is about concurrency, I present a lot of pitfalls and show you how to overcome them<\/strong>.<\/p>\n
<\/span>Give me the Details!<\/span><\/h2>\n
If you are curious and you should be, here are the details to the more than 300 pages:<\/p>\n
- \n
- \n
<\/span>Introduction<\/span><\/h3>\n
- \n
- Guide to Follow this Course<\/li>\n<\/ul>\n<\/li>\n
- \n
<\/span>A Quick Overview<\/span><\/h3>\n
- \n
- C++11 and C++14: The FoundationPreview<\/span><\/a><\/li>\n
- Multithreading in C++Preview<\/span><\/a><\/li>\n
- Case StudiesPreview<\/span><\/a><\/li>\n
- C++17: Parallel Algorithms of the Standard Template LibraryPreview<\/span><\/li>\n
- C++20: The Concurrent Future<\/li>\n
- Challenging Issues in C++<\/li>\n<\/ul>\n<\/li>\n
- \n
<\/span>Memory Model: The Contract<\/span><\/h3>\n
- \n
- The Contract<\/li>\n
- The Foundation & Challenges<\/li>\n<\/ul>\n<\/li>\n
- \n
<\/span>Memory Model: Atomics<\/span><\/h3>\n
- \n
- Strong Memory Model<\/li>\n
- Weak Memory Model<\/li>\n
- The Atomic Flag<\/li>\n
- Spinlock vs. Mutex<\/li>\n
- std::atomic<bool><\/span><\/li>\n
- User-Defined Atomics<\/li>\n
- All Atomic Operations<\/li>\n
- Free Atomic Functions<\/li>\n
- Atomic Operations on std::shared_ptr<\/span><\/li>\n<\/ul>\n<\/li>\n
- \n
<\/span>Memory Model: Synchronization and Ordering Constraints<\/span><\/h3>\n
- \n
- Introduction<\/li>\n
- Types of Synchronization & Ordering Constraints<\/li>\n
- Sequential Consistency<\/li>\n
- Acquire Release Semantic<\/li>\n
- Is Acquire-Release Semantic Transitive?<\/li>\n
- Acquire Release: The Typical Misunderstanding<\/li>\n
- std::memory_order_consume<\/span><\/li>\n
- Data dependencies with std::memory_order_consume<\/span><\/li>\n
- Relaxed Semantic<\/li>\n<\/ul>\n<\/li>\n
- \n
<\/span>Memory Model: Fences<\/span><\/h3>\n
- Data dependencies with std::memory_order_consume<\/span><\/li>\n
- Multithreading in C++Preview<\/span><\/a><\/li>\n
- C++11 and C++14: The FoundationPreview<\/span><\/a><\/li>\n
- \n
- With C++17<\/strong> we got the parallel algorithms of the Standard Template Library (STL). That means, most of the algorithms of the STL can be executed sequential, parallel, or vectorized.<\/li>\n
![\"RainerGrimmSmall\"](\"https:\/\/www.modernescpp.com\/wp-content\/uploads\/2016\/04\/RainerGrimmSmall.png\")
<\/p>\n