Limitations
Quicx is a fast in-memory broker, not a durable one. No persistence, no redelivery, no retries, no delays, one core per daemon. Part of the latency advantage is work Quicx is not doing, and this page lists it.
What Quicx does not do#
Quicx is a fast in-memory broker, not a durable one. Today it does not do:
- Persistence
A restart loses everything queued.
- RedeliveryIn progress
If a worker dies mid-task, the task is lost and the producer is not notified.
- Retries
No automatic retry, no dead-lettering.
- Delays, named queues
One queue with 16 value levels (a FIFO per level, highest first); no delayed tasks and no named queues.
- Client libraries beyond Java
dev.quicx:quicx-client is the only one. Every other language talks QXP, the Quicx Protocol, directly. It is documented and small.
- Payloads above 1 KB
PROTOCOL_MAX_PAYLOAD is 1,024 bytes by default: a task is one block of a 64 B record plus its payload. A daemon built with make MAX_PAYLOAD=N takes up to 16,320 B, and the capacity formula still holds. Oversized frames get a clean MSG_ERROR.
- Multiple cores
One daemon uses one core. Run one daemon per core: on a two-core Linux machine, two pinned daemons did 1.92 times the work of one, and each part of a device can have its own budget.
Feature for feature#
| Quicx | beanstalkd | Redis Streams | RabbitMQ | |
|---|---|---|---|---|
| memory bound | exact, configured | none | cap + eviction | none |
| binary size | 55 KB | ~ | ~1 MB+ | large |
| dependencies | none | libevent | none | Erlang/OTP |
| delivery | at-most-once | at-least-once | at-least-once | at-least-once |
| survives worker crash | no | yes (TTR) | yes | yes |
| persistence | no | optional | yes | yes |
| multi-core | no | no | partial | yes |
When Quicx is the right call#
Quicx is the task queue you reach for when you need to know, exactly, how much memory the broker will use. A fixed budget declared at startup and never exceeded, every page accounted for, and the memory of a burst given back once it drains. None of the systems in the table above make that guarantee.
If your tasks are cheap, local, replayable from the source of truth, and you would rather have a hard memory ceiling than durable delivery, Quicx fits. If losing a task on a worker crash is unacceptable, it does not, whatever the benchmarks say.