zlacker

[return to "Show HN: Hatchet – Open-source distributed task queue"]
1. fcsp+t41[view] [source] 2024-03-08 22:26:28
>>abelan+(OP)
> Hatchet is built on a low-latency queue (25ms average start)

That seems pretty long - am I misunderstanding something? By my understanding this means the time from enqueue to job processing, maybe someone can enlighten me.

◧◩
2. abelan+571[view] [source] 2024-03-08 22:45:56
>>fcsp+t41
To clarify - you're right, this is a long time in a message/event queue.

It's not an eternity in a task queue which supports DAG-style workflows with concurrency limits and fairness strategies. The reason for this is you need to check all of the subscribed workers and assign a task in a transactional way.

The limit on the Postgres level is probably on the order of 5-10ms on a managed PG provider. Have a look at: >>39593384 .

Also, these are not my benchmarks, but have a look at [1] for Temporal timings.

[1] https://www.windmill.dev/blog/launch-week-1/fastest-workflow...

[go to top]