Problems / Caching, easy

Read-heavy without a cache

A product API is 95% reads at 3,000 req/s, all straight to one database.

Free to open. Sign in with Google to start; new accounts get free credits.

Your goals

Success ≥ 99%, p99 ≤ 500 ms.

Test cases

Like a coding problem, a solution has to pass every case, not just the one it was built for. Submit in the lab runs all 5; 1 of them are hidden until then.

  1. As given. The problem’s own traffic, scheduled failures and seed.
  2. Peak hour. 25% more traffic than the problem states, with the same failures.
  3. A slow dependency. The main data store or model answers twice as slowly for part of the run.
  4. A server dies. One replica of the service with the most replicas is killed for part of the run.

The traffic

3,000 requests a second for 30 seconds: 95% reads, 5% writes.

The system

What each component does in this design, and what calls it. The simulator mimics each one from these settings.

ComponentIts job hereSettings
Load balancerLoad balancerTraffic enters here.Calls API.Layer 4 balancers route by IP and port; layer 7 balancers read HTTP and can route by path or header.–
APIApp serviceLoad balancer forwards to it.Calls Postgres.Little's law: throughput ≈ concurrency ÷ latency. 200 slots at 50 ms serve about 4,000 req/s.3 replicas × 200 slots · timeout 1.0 s
PostgresSQL databaseAPI calls it.Postgres runs one process per connection, which is why poolers like PgBouncer sit in front of busy databases.4 vCPU · 60 connections

Hints

Try it first. Open one hint at a time if you get stuck.

Hint 1

The database does the same reads over and over.

Hint 2

Take reads off the database.

One way to solve it

Add read replicas, or put a cache in front of the database (link a cache to it).

More caching problems