Concurrency patterns

An order service with more orders than workers and a price list read by everyone: why a shared list and a polling loop fail, how a bounded queue says no by waiting, dropping or refusing, how a thread pool reuses workers and survives a failing task, how a writer-preferring read-write lock lets readers in together, and how compare-and-set or a single writer avoids the lock.