Leanpub The Leanpub Logo is a Registered Trademark
AccountLibraryOverviewPurchasesStoreSupport
BooksBundlesCoursesFeaturedNewslettersPodcastSupportWhy Leanpub
BooksBundlesCoursesFeaturedNewslettersPodcastSupportWhy Leanpub
Concurrency with Modern C++
Concurrency with Modern C++
$33.00
Minimum price
$41.00
Suggested price
  • 964

    Readers

  • 543

    Pages

  • English

  • PDF

  • EPUB

  • MOBI

  • WEB

Concurrency with Modern C++

This book is 100% complete

Completed on 2019-10-15

About the Book

Concurrency with Modern C++ is a journey through current and upcoming concurrency in C++.

  • C++11 and C++14 have the basic building blocks for creating concurrent or parallel programs.
  • With C++17 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.
  • The concurrency story in C++ goes on. With C++20/23 we can hope for executors, extended futures, coroutines, transactions, and more.

This book explains you the details to concurrency in modern C++ and gives you, in addition, more than 100 running code examples . Therefore you can combine the theory with the practices and get the most of it.

Because this book is about concurrency, I present a lot of pitfalls and show you how to overcome them.

About the Author

Rainer
Rainer

I worked as a software architect, team lead and instructor for about 20 years. In my spare time, I like to write articles on the topics C++, Python and Haskell, but I also like to speak at conferences. Since 2016 I'm independent trainer giving seminars about modern C++ and Python.

My books "C++ 11 für Programmierer ", "C++" and "C++ Standardbibliothek kurz & gut" for the "kurz & gut" series were published by the publisher Pearson and O'Reilly. They are available in German, English, and Korean. In summer 2018 I published a new book at Leanpub: "Concurrency with Modern C++". This book is also available in German at Hanser: "Modernes C++: Concurrency meistern".

I'm the author of the two well-known blogs.

www.grimm-jaud.de/index.php/blog in German

www.ModernesCpp.com in English

Bundles that include this book

The C++ Standard Library
Concurrency with Modern C++
"The C++ Standard Library" and "Concurrency with Modern C++"
2 Books
$61.00
Suggested Price
$46.00
Bundle Price
The Legacy Code Programmer's Toolbox
C++17 in Detail
Concurrency with Modern C++
Modern C++ Pack
3 Books
$100.94
Suggested Price
$54.99
Bundle Price

Reader Testimonials

Bart Vandewoestyne
Bart Vandewoestyne

Senior Development Engineer Software at Esterline

'Concurrency with Modern C++' is your practical guide to getting familiar with concurrent programming in Modern C++. Starting with the C++ Memory Model and using many ready-to-run code examples, the book covers a good deal of what you need to improve your C++ multithreading skills. Next to the enlightening case studies that will bring you up to speed, the overview of upcoming concurrency features might even wet your appetite for more!

Ian Reeve
Ian Reeve

Senior Storage Software Engineer for Dell Inc.

Rainer Grimm's Concurrency with Modern C++ is a well written book covering the theory and practice for working with concurrency per the existing C++ standards, as well as addressing the potential changes for the upcoming C++ 20 standard. He provides a conversational discussion of the applications and best practices for concurrency along with example code to reinforce the details of each topic. An informative and worthwhile read!

Robert Badea
Robert Badea

Technical Team Leader

Concurrency with Modern C++ is the easiest way to become an expert in the multithreading environment. This book contains both simple and advanced topics, and it has everything a developer needs, in order to become an expert in this field: Lots of content, a big number of running code examples, along with great explanation, and a whole chapter for pitfalls. I enjoyed reading it, and I highly recommend it for everyone working with C++.

Table of Contents

  •  
    • Reader Testimonials
    • Introduction
      • Conventions
        • Special Fonts
        • Special Symbols
        • Special Boxes
      • Source Code
        • Run the Programs
      • How you should read the book?
      • Personal Notes
        • Acknowledgements
        • About Me
        • My Special Circumstances
  • A Quick Overview
    • Concurrency with Modern C++
      • C++11 and C++14: The Foundation
        • Memory Model
        • Multithreading
      • C++17: Parallel Algorithms of the Standard Template Library
        • Execution Policy
        • New Algorithms
      • The Near Future: C++20
        • std::jthread
        • Atomic Smart Pointers
        • Latches and Barriers
        • Semaphores
        • Coroutines
      • Case Studies
        • Calculating the Sum of a Vector
        • Thread-Safe Initialisation of a Singleton
        • Ongoing Optimisation with CppMem
      • The Future: C++23
        • Executors
        • Extended futures
        • Transactional Memory
        • Task Blocks
        • Data-Parallel Vector Library
      • Patterns and Best Practices
        • Synchronisation
        • Concurrent Architecture
        • Best Practices
      • Data Structures
      • Challenges
      • Time Library
      • CppMem
      • Glossary
  • The Details
    • Memory Model
      • Basics of the Memory Model
        • What is a memory location?
        • What happens if two threads access the same memory location?
      • The Contract
        • The Foundation
        • The Challenges
      • Atomics
        • Strong versus Weak Memory Model
        • The Atomic Flag
        • The Class Template std::atomic
        • All Atomic Operations
        • Free Atomic Functions
        • std::shared_ptr
      • The Class Template std::atomic_ref (C++20)
        • Specialisations of std::atomic_ref
      • The Synchronisation and Ordering Constraints
        • The Six Variants of Memory Orderings in C++
        • Sequential Consistency
        • Acquire-Release Semantic
        • std::memory_order_consume
        • Relaxed Semantic
      • Fences
        • std::atomic_thread_fence
        • std::atomic_signal_fence
    • Multithreading
      • Threads
        • Thread Creation
        • Thread Lifetime
        • Thread Arguments
        • Methods
      • Shared Data
        • Mutexes
        • Locks
        • Thread-safe Initialisation
      • Thread-Local Data
      • Condition Variables
        • The Predicate
        • Lost Wakeup and Spurious Wakeup
        • The Wait Workflow
      • Tasks
        • Tasks versus Threads
        • std::async
        • std::packaged_task
        • std::promise and std::future
        • std::shared_future
        • Exceptions
        • Notifications
    • Parallel Algorithms of the Standard Template Library
      • Execution Policies
        • Parallel and Vectorised Execution
        • Exceptions
        • Hazards of Data Races and Deadlocks
      • Algorithms
      • The New Algorithms
        • More overloads
        • The functional Heritage
      • Performance
    • The Near Future: C++20
      • A Cooperatively Interruptible Joining Thread
        • Automatically Joining
        • Interrupt a std::jthread
        • Stop Tokens
      • Atomic Smart Pointers
        • A thread-safe singly linked list
      • Latches and Barriers
        • std::latch
        • std::barrier
      • Semaphores
      • Coroutines
        • A Generator Function
        • Details
        • The Framework
    • Case Studies
      • Calculating the Sum of a Vector
        • Single Threaded addition of a Vector
        • Multithreaded Summation with a Shared Variable
        • Thread-Local Summation
        • Summation of a Vector: The Conclusion
      • Thread-Safe Initialisation of a Singleton
        • Double-Checked Locking Pattern
        • Performance Measurement
        • Thread-Safe Meyers Singleton
        • std::lock_guard
        • std::call_once with std::once_flag
        • Atomics
        • Performance Numbers of the various Thread-Safe Singleton Implementations
      • Ongoing Optimisation with CppMem
        • CppMem: Non-Atomic Variables
        • CppMem: Locks
        • CppMem: Atomics with Sequential Consistency
        • CppMem: Atomics with Acquire-Release Semantic
        • CppMem: Atomics with Non-atomics
        • CppMem: Atomics with Relaxed Semantic
      • Conclusion
    • The Future: C++23
      • Executors
        • A long Way
        • What is an Executor?
        • First Examples
        • Goals of an Executor Concept
        • Terminology
        • Execution Functions
        • A Prototype Implementation
      • Extended Futures
        • Concurrency TS v1
        • Unified Futures
      • Transactional Memory
        • ACI(D)
        • Synchronized and Atomic Blocks
        • transaction_safe versus transaction_unsafe Code
      • Task Blocks
        • Fork and Join
        • define_task_block versus define_task_block_restore_thread
        • The Interface
        • The Scheduler
      • Data-Parallel Vector Library
        • Data-Parallel Vectors
        • The Interface of the Data-Parallel Vectors
  • Patterns
    • Patterns and Best Practices
      • History
      • Invaluable Value
      • Pattern versus Best Practices
      • Anti-Pattern
    • Synchronisation Patterns
      • Dealing with Sharing
        • Copied Value
        • Thread-Specific Storage
        • Future
      • Dealing with Mutation
        • Scoped Locking
        • Strategized Locking
        • Thread-Safe Interface
        • Guarded Suspension
    • Concurrent Architecture
      • Active Object
        • Components
        • Advantages and Disadvantages
        • Implementation
        • Further Information
      • Monitor Object
        • Requirements
        • Components
        • Runtime behaviour
        • Advantages and Disadvantages
        • Further Information
      • Half-Sync/Half-Async
        • Advantages and Disadvantages
        • Reactor
        • Proactor
        • Further Information
    • Best Practices
      • General
        • Code Reviews
        • Minimise Sharing of Mutable Data
        • Minimise Waiting
        • Prefer Immutable Data
        • Use pure functions
        • Look for the Right Abstraction
        • Use Static Code Analysis Tools
        • Use Dynamic Enforcement Tools
      • Multithreading
        • Threads
        • Data Sharing
        • Condition Variables
        • Promises and Futures
      • Memory Model
        • Don’t use volatile for synchronisation
        • Don’t program Lock Free
        • If you program Lock-Free, use well-established patterns
        • Don’t build your abstraction, use guarantees of the language
        • Don’t reinvent the wheel
  • Data Structures
    • Lock-Based Data Structures
      • General Considerations
        • Locking Strategy
        • Granularity of the Interface
        • Typical Usage Pattern
        • Avoidance of Loopholes
        • Contention
        • Scalability
        • Invariants
        • Exceptions
      • Concurrent Stack
        • A Simplified Implementation
        • A Complete Implementation
      • Concurrent Queue
        • Coarse-Grained Locking
        • Fine-Grained Locking
    • Lock-Free Data Structures
  • Further Information
    • Challenges
      • ABA Problem
      • Blocking Issues
      • Breaking of Program Invariants
      • Data Races
      • Deadlocks
      • False Sharing
      • Lifetime Issues of Variables
      • Moving Threads
      • Race Conditions
    • The Time Library
      • The Interplay of Time Point, Time Duration, and Clock
      • Time Point
        • From Time Point to Calendar Time
        • Cross the valid Time Range
      • Time Duration
        • Calculations
      • Clocks
        • Accuracy and Steadiness
        • Epoch
      • Sleep and Wait
    • CppMem - An Overview
      • The simplified Overview
        • 1. Model
        • 2. Program
        • 3. Display Relations
        • 4. Display Layout
        • 5. Model Predicates
        • The Examples
    • Glossary
      • ACID
      • CAS
      • Callable Unit
      • Complexity
      • Concurrency
      • Critical Section
      • Eager Evaluation
      • Executor
      • Function Objects
      • Lambda Functions
      • Lazy evaluation
      • Lock-free
      • Lost Wakeup
      • Math Laws
      • Memory Location
      • Memory Model
      • Modification Order
      • Monad
      • Non-blocking
      • Parallelism
      • Predicate
      • Pattern
      • RAII
      • Release Sequence
      • Sequential Consistency
      • Sequence Point
      • Spurious Wakeup
      • Thread
      • Total order
      • TriviallyCopyable
      • volatile
      • wait-free
    • Index

Authors have earned$8,396,824writing, publishing and selling on Leanpub,
earning 80% royalties while saving up to 25 million pounds of CO2 and up to 46,000 trees.

Learn more about writing on Leanpub

The Leanpub 45-day 100% Happiness Guarantee

Within 45 days of purchase you can get a 100% refund on any Leanpub purchase, in two clicks.

See full terms

Free Updates. DRM Free.

If you buy a Leanpub book, you get free updates for as long as the author updates the book! Many authors use Leanpub to publish their books in-progress, while they are writing them. All readers get free updates, regardless of when they bought the book or how much they paid (including free).

Most Leanpub books are available in PDF (for computers), EPUB (for phones and tablets) and MOBI (for Kindle). The formats that a book includes are shown at the top right corner of this page.

Finally, Leanpub books don't have any DRM copy-protection nonsense, so you can easily read them on any supported device.

Learn more about Leanpub's ebook formats and where to read them

Write and Publish on Leanpub

You can use Leanpub to easily write, publish and sell in-progress and completed ebooks and online courses! Leanpub is a powerful platform for serious authors, combining a simple, elegant writing and publishing workflow with a store focused on selling in-progress ebooks. Leanpub is a magical typewriter for authors: just write in plain text, and to publish your ebook, just click a button. It really is that easy.

Learn more about writing on Leanpub

Leanpub is copyright © 2010-2020 Ruboss Technology Corp. All rights reserved.