When developing multi-threaded applications that share state, we need to consider thread safety when sharing state across multiple threads. These techniques require the developer to understand the possible race conditions and select the cheapest synchronisation technique to satisfy thread safety. But, while essential, they can often become tedious and make the simplest of algorithms seemingly overly complicated and hard to maintain. In this session, we’ll explore using built-in concurrent data structures shipped with TPL that will simplify multi-threaded code while maximising concurrency and efficiency.