<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
    <title>distributed-task-queue</title>
    <link rel="self" type="application/atom+xml" href="https://links.biapy.com/guest/tags/1577/feed"/>
    <updated>2026-06-14T23:43:59+00:00</updated>
    <id>https://links.biapy.com/guest/tags/1577/feed</id>
            <entry>
            <id>https://links.biapy.com/links/2858</id>
            <title type="text"><![CDATA[Asynq]]></title>
            <link rel="alternate" href="https://github.com/hibiken/asynq" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/2858"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[Simple, reliable, and efficient distributed task queue in Go.

Asynq is a Go library for queueing tasks and processing them asynchronously with workers. It&amp;#039;s backed by Redis and is designed to be scalable yet easy to get started.]]>
            </summary>
            <updated>2025-08-28T23:53:30+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/4461</id>
            <title type="text"><![CDATA[Hatchet]]></title>
            <link rel="alternate" href="https://hatchet.run/" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/4461"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[The Distributed Task Queue for More Resilient Web Applications

Hatchet is a distributed, fault-tolerant task queue which replaces traditional message brokers and pub/sub systems - built to solve problems like concurrency, fairness, and durability.

Hatchet replaces difficult to manage legacy queues or pub/sub systems so you can design durable workloads that recover from failure and solve for problems like concurrency, fairness, and rate limiting. Instead of managing your own task queue or pub/sub system, you can use Hatchet to distribute your functions between a set of workers with minimal configuration or infrastructure:

-  [Hatchet @ GitHub](https://github.com/hatchet-dev/hatchet).]]>
            </summary>
            <updated>2025-08-29T04:20:30+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/7476</id>
            <title type="text"><![CDATA[Celery]]></title>
            <link rel="alternate" href="http://www.celeryproject.org/" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/7476"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[Distributed Task Queue

Celery is a simple, flexible, and reliable distributed system to process vast amounts of messages, while providing operations with the tools required to maintain such a system.

The execution units, called tasks, are executed concurrently on a single or more worker servers using multiprocessing, Eventlet, or gevent. Tasks can execute asynchronously (in the background) or synchronously (wait until ready).

- [Celery @ GitHub](https://github.com/celery/celery).]]>
            </summary>
            <updated>2025-08-29T12:43:53+00:00</updated>
        </entry>
    </feed>
