A Thread’s Journey: From Birth to Deadlock – Lessons on Concurrency

Concept Clarification

Processes and threads are fundamental OS concepts. The CPU is likened to a factory that can only power one workshop (process) at a time. A process is a workshop, and threads are the workers inside it, sharing the workshop’s memory space. Mutual exclusion (mutex) is described as a lock on a door, while a semaphore is a set of keys allowing up to n workers to enter simultaneously.

Thread State Overview

New : a thread object is created.

Runnable : the thread is ready and waiting for CPU time.

Running : the thread has acquired the CPU and executes code.

Blocked : the thread is paused because it is waiting for a lock, a wait/notify, or I/O/sleep.

Dead : the thread has finished execution or terminated due to an exception.

A thread’s autobiography: birth, death, and rebirth (fictional).

Chapter 1: Birth

A newly created thread (ID 0x3704) receives a package (an HTTP request) containing a username and password. It moves through the Ready queue, then to the Running state where it performs login by handing credentials to a database worker, waits for the database response, and finally builds an HTML page before returning to the thread pool.

Chapter 2: Getting Better

The thread describes a busy e‑commerce day (Nov 11) where massive login, browsing, and order‑processing requests flood the system. It learns the value of caching (memcached) to avoid repeated database hits and observes how a connection pool works similarly to its own thread pool.

Chapter 3: Narrow Escape

The story illustrates the danger of missing locks with a bank account example. Without locking, a deposit and a withdrawal interleave, causing lost money. With proper locking, the operations serialize correctly.

It then presents a classic deadlock scenario: two threads transfer money between a famous actor’s and a famous director’s accounts, each acquiring locks in opposite order, leading to a circular wait. The operating system (the “big boss”) forces one thread to be killed, breaking the deadlock. The lesson: always acquire multiple locks in a consistent global order, typically from the larger resource to the smaller.

Thread 0x3704 (Actor → Director)

Thread 0x7954 (Director → Actor)

Lock Actor: success

Thread paused

Lock Director: success

Thread paused

Lock Director: fail, wait

Lock Actor: fail, wait

After the deadlock is resolved, the system enforces a lock‑ordering rule based on resource size, ensuring future transfers acquire the larger account’s lock first.

Chapter 4: Farewell

Eventually, the system’s workload simplifies to returning a static maintenance page, indicating an upcoming system reboot. As the reboot occurs, all threads, including the narrator, disappear, hinting at the cyclical nature of thread pools and the birth of a new generation.