Ambarsthan Bookings: Let the Database Win the Race

Sat, 07 Mar 2026 10:00:00 +0530

In the last chapter I poured the walls between our Celery workloads so a slow transcode could never delay a donor’s payment — isolation by named queue, one worker per latency class. That was about fairness under load: making sure nobody waits behind the wrong thing. This chapter is about the harder cousin of that problem — correctness under load. Not “who goes first,” but “what happens when two people try to take the exact same thing at the exact same instant, and both of them are right to think it’s available.”

Race-Conditions on Kuldeep Pisda

Ambarsthan Bookings: Let the Database Win the Race