Re: Design of a reliable task processing queue

On Saturday, 18 January 2025 12:44:07 EET Alex Burkhart wrote:
> Hey team,
> 
> I'm looking for help to organize locks and transaction for a reliable task
> queue.
> 
> REQUIREMENTS
> 
> 1. Pending actions are persisted to a database. There's a trace once they
> are done.
> 2. Application workers pick actions one by one. At any given time, each
> action can be assigned to at most one worker (transaction).
> 3. If multiple actions have same "lock_id", only one of them is processed
> at the time. That has to be action with smallest id.

Why reinvent the wheel and not use production-ready code from projects such as que (Ruby), pgqueuer (Python)?
-- 
Regards,
Peter