34. Delay Queue Scheduler
Millions of future actions — reminders, retries, expiries — must fire near their due time. Scanning everything every minute does not scale, and an in-process timer dies with the process.
Pick a system. Work through the problem. Compare your approach.
Company tags are community-reported. Counts on cards show how many people reported that design.
Millions of future actions — reminders, retries, expiries — must fire near their due time. Scanning everything every minute does not scale, and an in-process timer dies with the process.
Run 10,000 jobs a second within two seconds of their time, at least once, with retries, fairness between tenants and exactly-once effects.
Every goal on 25 million open apps within two seconds: SSE or WebSockets, pub/sub to the right server, resume by seq, hot topics, reconnect storms and push.
Accept in milliseconds, work in the background: leases and heartbeats, retries and dead letters, progress by SSE and webhooks, fairness across tenants.
Build a queue around visibility leases and explicit acknowledgement, then add replicated partitions, FIFO groups, tenant fairness and bounded redrive: three self-contained interview boards.
Turn 10 pushes a second into job graphs on ephemeral runners, with fair queues per pool, leases fenced by attempt and live logs.