System design from first principles to design review · check

Know Operate a busy read path already?

One question for each of the 4 puzzles in this module. A right answer marks that puzzle as passed, so you can jump ahead. A wrong one tells you which puzzle to start with. Nothing is sent anywhere: it's saved in this browser.

Puzzle 15: Why does an idle worker watch a request wait?

At time 10, where does round robin send request three?

Right. The first two assignments were A and B.

Not quite. Taking turns does not look at the queue. Learn it in puzzle 15 →

Puzzle 16: Can two cache misses share one read?

Which two requests share storage work?

Not quite. Different lots need different data. Learn it in puzzle 16 →

Right. Their requested result and the time of their pending lookup coincide.

Puzzle 17: When is it worth calling a failing dependency again?

What happens to the request at time 50?

Right. The quiet interval lasts until time 110.

Not quite. An open breaker stops new dependency calls. Learn it in puzzle 17 →

Puzzle 18: If one driver gives up, whose read should stop?

What expires when Ada's time runs out?

Right. A caller can stop waiting while shared work is pending.

Not quite. Ben has his own deadline and still needs the read. Learn it in puzzle 18 →

Back to the overview →