A fair, queue-based rate-limiting library with configurable selection modes, balancing queue size and wait time to prioritize task processing.
An fair queue based using Deficit Round-Robin
Tiny queue data structure
fast, tiny `queueMicrotask` shim for modern engines
A shim for the setImmediate efficient script yielding API
Promise queue with concurrency control
The smallest and simplest JavaScript priority queue
A simple tool to keep requests to be executed in order.
queue-lit is a tiny queue data structure in case you `Array#push()` or `Array#shift()` on large arrays very often
Next tick shim that prefers process.nextTick over queueMicrotask for compat
The Divine Synchronization Library
Simple JS queue with auto run for node and browsers
In memory queue system prioritizing tasks
Promise-based queue
The fastest javascript implementation of a double-ended queue. Used by the official Redis, MongoDB, MariaDB & MySQL libraries for Node.js and many other libraries. Maintains compatability with deque.
LRU Queue
Sequential asynchronous lock-based queue for promises
Simple JS queue with auto run for node and browsers
asynchronous function queue with adjustable concurrency
Fast, in memory work queue
A promise based, dynamic priority queue runner, with concurrency limiting.
Microsoft Azure Storage SDK for JavaScript - Queue
Extremely fast double-ended queue implementation
Compatible version of p-queue
Async Rust client for Mapepire — Db2 for IBM i over secure WebSockets
Wire-compatible Rust implementation of iperf3 — safe, cross-platform network performance testing library
Wire-compatible Rust implementation of iperf3 — network performance testing CLI
Lightweight timerless messaging queue
Normally resque processes queues in a fixed order. This can lead to jobs in queues at the end of the list not getting process for very long periods. resque-fairly provides a mechanism where by workers are distributed across the set of queues with pending jobs fairly. This results in a much more predictable mean time to handling for jobs in queues that are not the first in the list.
A fair way to queue work in multi-user systems.
Organise background tasks so they will not overload the machine(s) running the tasks, while still giving a fair, balanced allocation of running time to members in the queue