Operating systems notes

Classic Synchronization Problems

Three puzzles that teach the patterns hiding inside every queue, cache, and lock you will ever write. Every section is a drawn page beside a clear written explanation, about 17 minutes in all.

  • Chapter 16 of 37
  • About 17 minutes
  • 7 sections

Sign in with Google or GitHub and you land straight on this page. DSA comes with the all labs plan and every ChaiCode batch.

The first drawn page of Classic Synchronization Problems: Why we study three ancient puzzles
The chapter's first page: Why we study three ancient puzzles

In this chapter

  • Why we study three ancient puzzles
  • Producer-Consumer and the bounded buffer
  • Producer-Consumer in the systems you build
  • Readers-Writers: sharing reads, isolating writes
  • Readers-Writers in the systems you run
  • Dining Philosophers: the deadlock trap
  • What these problems really teach

Next chapters

Read the whole chapter

Sign in and the chapter opens with every drawn page, and all 38 operating systems chapters beside it.

DSA comes with the all labs plan and every ChaiCode batch.