◷

Timer Scheduler

All changes saved Not started

Choose the policy you would defend in a design review. Choices save as you go.

1.What if a new earlier timer is inserted?

Keep sleeping until the old later deadlineWake the dispatcher so it recomputes the next waitRun every timer immediately

2.How do stale heap entries from reschedule behave?

Execute alongside the new timerDelete another timerSkip entries whose generation no longer matches the active record

3.Where should callback invocation occur?

Outside the scheduler mutex with isolated error handlingWhile holding the heap lock throughout user codeInside the clock implementation

Trade-offs, failure cases and tests

Explain a rejected alternative, a failure mode and how you would test the design. At least 80 characters for the completeness check.

0 characters