Simple Promise based multi-channel priority queue using Redis sorted set.
Command lines to interface with dq (Redis priority queue)
The smallest and simplest JavaScript priority queue
fast, tiny `queueMicrotask` shim for modern engines
A heap-based implementation of priority queue in javascript with typescript support.
Generic browser priority queue.
Promise queue with concurrency control
Priority queue data structures
Fast heap-based priority queue in JavaScript
The smallest and simplest JavaScript priority queue
A really simple message queue based on Redis
Tiny queue data structure
Distributed test runner using Redis as a work queue. Push file paths to a Redis list, then multiple CI runners atomically steal batches and execute them via a configurable command.
A promise based, dynamic priority queue runner, with concurrency limiting.
An async iterable interface for redis streams
A priority queue that shuffles elements with the same priority.
High-priority task queue for Node.js and browsers
A simple and efficient queue system for Node.js applications
Redis utilities for redis instrumentations
Light weight job scheduler for Node.js
Bull / BullMQ queue command line REPL
A JS library for finding optimal label position inside a polygon
a simple priority queue data structure
Compatible version of p-queue
Persistent redis based min-priority queue.
Qmore allows one to specify the queues a worker processes by the use of wildcards, negations, or dynamic look up from redis. It also allows one to specify the relative priority between queues (rather than within a single queue). It plugs into the Qless webapp to make it easy to manage the queues.
|> Distributed locks with "prioritized lock acquisition queue" capabilities based on the Redis Database. |> Each lock request is put into the request queue (each lock is hosted by its own queue separately from other queues) and processed in order of their priority (FIFO). |> Each lock request lives some period of time (RTTL) (with requeue capabilities) which guarantees the request queue will never be stacked. |> In addition to the classic `queued` (FIFO) strategy RQL supports `random` (RANDOM) lock obtaining strategy when any acquirer from the lock queue can obtain the lock regardless the position in the queue. |> Provides flexible invocation flow, parametrized limits (lock request ttl, lock ttl, queue ttl, lock attempts limit, fast failing, etc), logging and instrumentation.