HardDesign: Distributed Task Scheduler (Cron at Scale)
Why should a task scheduler use atomic database operations (UPDATE with WHERE clause) when claiming tasks?
— Tests your understanding of this concept.
Answer Options
AFor better performance
BTo prevent two scheduler instances from claiming the same task simultaneously (race condition)
CDatabase requires it
DTo support rollback on failure
Want to see the correct answer?
Get the answer with a detailed explanation, plus practice 22+ more Design: Distributed Task Scheduler (Cron at Scale) questions with adaptive quizzes and timed interviews.
See the Answer on Guru Sishya →This question is from the Design: Distributed Task Scheduler (Cron at Scale) topic (System Design Cases).
More Design: Distributed Task Scheduler (Cron at Scale) Questions
Why is a single-server cron scheduler not suitable for production at scale?
HardWhat is the purpose of leader election in a distributed task scheduler?
HardA worker picks up a task and starts executing. The worker crashes mid-execution. What happens?
HardWhat is the 'thundering herd' problem in a task scheduler?
HardHow do you calculate the next_run_at for a cron expression after a successful execution?
Hard