Mutual exclusion

This chapter covers classical mutual exclusion algorithms that work by reading and writing shared memory. Although these algorithms are not used in practice, they introduce the kinds of algorithmic and correctness issues that arise in every area of synchronization. This chapter also includes an impossibility proof that demonstrates the limitations of solutions to mutual exclusion using read–write memory, and helps motivate the real-world mutual exclusion algorithms that appear in later chapters.