Parallelism and Thread Safety
Protect shared state, choose synchronization primitives by invariant, use parallel loops only for measured CPU work, and recognize race conditions and deadlocks.
Before this lesson
Identify data races and atomicity requirements
Choose locks and concurrent collections
Separate I/O concurrency from CPU parallelism
The short answer
Concurrency allows work to overlap; parallelism executes work simultaneously. Protect an invariant—not an individual line—with the narrowest understandable synchronization strategy, and prefer immutable data or message passing over shared mutation.
Build the runtime mental model
A race occurs when correctness depends on unpredictable interleaving. Even simple read-modify-write operations are not automatically atomic. Memory visibility also matters: one thread must reliably observe another thread’s writes.
Advanced C# work improves when you separate language syntax, runtime behavior, and application policy. Write down which layer owns the guarantee in this lesson. Then identify the observable evidence—a compiler rejection, test result, generated query, trace, or measurement—that would prove the model correct.
Design the boundary deliberately
lock provides mutual exclusion around a synchronous critical section. Interlocked handles a narrow set of atomic operations. SemaphoreSlim bounds concurrency, while concurrent collections coordinate common data structures. Never await while holding a monitor lock.
The starter isolates one part of the mental model so it can run in the browser. The exercise moves the same rule into a current local .NET project where packages, framework hosting, diagnostics, and multi-file tests are available.
using System;
using System.Threading;
class Program
{
static int counter;
static void Main()
{
for (int i = 0; i < 1000; i++) Interlocked.Increment(ref counter);
Console.WriteLine(counter);
}
}Expected output
1000
Diagnose failure and misuse
Locking different resources in inconsistent order can deadlock. A thread-safe collection does not make a multi-step business invariant atomic. Parallel.ForEach can slow small workloads through scheduling overhead and contention.
Classify each failure as a contract violation, transient operational failure, permanent dependency response, concurrency conflict, or programmer defect. That classification determines whether to reject, retry, compensate, cancel, or fail fast. A generic catch-and-continue policy destroys the information needed to make that decision.
| Question | Evidence to inspect | Decision |
|---|---|---|
| Is the input valid? | Validation result and boundary examples | Reject with a stable contract |
| Is the failure transient? | Typed status, exception, and policy context | Retry only when bounded and safe |
| Is state still consistent? | Invariant and transaction outcome | Commit, compensate, or abort |
| Is performance acceptable? | Representative latency and allocation data | Keep simple or optimize one cause |
Apply the concept in production
Write a sequential correct baseline, measure representative CPU work, and introduce parallelism only where throughput benefits. Load tests should assert results, not merely absence of exceptions, because races often return plausible wrong totals.
Finish by making the result operable. Add structured diagnostics at the boundary, propagate cancellation, avoid sensitive data, and record SDK and dependency versions. Test the public behavior instead of private implementation details. If a framework or provider performs translation, serialization, concurrency, or I/O, include at least one test against the real production technology.
A senior-level review should be able to answer four questions: what contract is promised, who owns lifetime and cleanup, how failures become visible, and what evidence supports the design. If any answer depends on “the framework probably handles it,” inspect the documentation or runtime behavior and turn the assumption into a checked decision.
Quick knowledge check
Answer before you reveal.
01Why is a concurrent dictionary not enough for every invariant?
Its individual operations are safe, but a business rule spanning several operations may still need one atomic coordination boundary.
02What must happen before adding complexity to this design?
State the requirement, preserve a correct baseline, collect evidence, and explain how the proposed mechanism improves a specific quality.
Exercise
Practice challenge
Build a bounded parallel file analyzer, protect aggregate statistics correctly, and compare it with a sequential baseline under measurement.
Requirements
- The implementation states its contract and ownership boundary explicitly
- Automated checks cover the successful path and at least two meaningful failures
- Diagnostics expose failure context without secrets or swallowed exceptions
- The project documents required SDK, packages, setup, run, and test commands
Optional extension: Measure or load-test the critical path and record whether the evidence justifies another optimization or abstraction.
Open in C# compilerLesson checkpoint
One small step locks it in
Mark this lesson complete, then keep the momentum going.
Clear up the details
Frequently asked questions
When should I use parallelism and thread safety?
Use it when its explicit tradeoff solves a measured requirement or clarifies an owned boundary. Keep the simpler design when the additional mechanism does not improve correctness, operability, or changeability.
Does the browser compiler cover the complete production setup?
No. It runs the focused starter program. Framework, package, database, benchmark, and multi-project work requires a current local .NET SDK and the project commands described in the exercise.
What evidence should I keep after the exercise?
Keep the acceptance cases, automated tests, diagnostic or benchmark output where relevant, and a short decision note describing the chosen boundary and rejected alternative.