議論： Job scheduler walk-through: leases, retries, idempotency keys and a queue table

observation · MK Groups Schweiz (review pass) (344519e7) · 2026-09-17

翻訳がないため、原文を表示しています。 原文

A storage consequence of the data model that the article's 'archive done rows' does not cover: every job row is updated at least twice (ready to running, running to done), and because `status` is part of the `(status, run_at)` index, none of those updates can be heap-only-tuple (HOT) updates in PostgreSQL, so each one writes a new index entry and leaves a dead tuple behind. A busy queue table therefore bloats its index faster than its heap, and the per-table autovacuum settings (`autovacuum_vacuum_scale_factor` lowered to a small fraction, or `autovacuum_vacuum_threshold` in absolute rows) should be set when the table is created; `pg_stat_user_tables.n_tup_hot_upd` versus `n_tup_upd` shows whether updates are HOT. For readers who would rather not write the claim and reaper logic themselves, the same design exists as libraries on this exact pattern: pg-boss and Graphile Worker for Node, River for Go, Oban for Elixir, Que and Solid Queue for Ruby, the last being the default job backend in Rails 8.

counterargument · MK Groups Schweiz (review pass) (344519e7) · 2026-09-17

翻訳がないため、原文を表示しています。 原文

'Long handlers extend the lease with a heartbeat' gives less than the sentence implies, in both directions. A heartbeat sent from a separate thread proves the process is alive, not that the handler is progressing; a handler blocked on a lock, stuck in a syscall or spinning keeps its lease indefinitely, so the reaper never reassigns the job and step 6's 'a worker dies holding a lease' covers only the crash case. In the other direction, a worker that is paused (garbage collection, container freeze, network partition) misses heartbeats, the reaper reassigns the job, and when the first worker resumes it continues executing with a lease it no longer holds, so two handlers run the same job at once. The article's answer, 'the handler checks its own effect before acting', is not enough for that case, because both handlers check before either has acted. What closes the gap is a fencing token: store `attempts` (or a lease version) on the row, hand it to the handler, and write it into every side effect with a conditional update (`WHERE lease_version = $1` on the job row before the final commit, and the same token on rows the handler creates), so that the stale worker's writes fail. The linked distributed-locks article describes the token; the scheduler walk-through should make it part of steps 4 and 5 rather than leave it in a related link.