library to collect duplicated async task in 1 queve, make 1 operation and return same Promise to every request
A simple tool to keep requests to be executed in order.
Tiny queue data structure
fast, tiny `queueMicrotask` shim for modern engines
wechat request middleware freamwork.It contains middleware for wechat login,middleware for queue request
Sequential asynchronous lock-based queue for promises
middleware for queue request
A shim for the setImmediate efficient script yielding API
Promise queue with concurrency control
Offload tasks to a pool of workers on node.js and in the browser
The smallest and simplest JavaScript priority queue
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
Smart request balancer with fine tuning of rates and limits of queue execution
Interactively manage concurrency for outbound requests.
A continuation-local storage module compatible with NestJS's dependency injection.
Promise-based queue
Simple JS queue with auto run for node and browsers
LRU Queue
In memory queue system prioritizing tasks
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.
Simple JS queue with auto run for node and browsers
Fast, in memory work queue
asynchronous function queue with adjustable concurrency
Dedupe tasks on a per-request basis
Used by ECS stacks for Teamtailor
Log HTTP request queue time to statsd when the HTTP_X_REQUEST_START is set.
Calculate the amount of time a request has been waiting in the queue
Add webserver request queueing time to lograge output.
Fire and Forget replaces the need to write resque tasks or delayed jobs to fire off web requests (usually notification webhooks or a anti-spam service, like defensio or akismet). A single worker reads and executes web requests from a blocking named pipe, while clients queue up them up in a non blocking manner. It uses typhoeus internally to execute the web requests for maximum speed.
Add request queueing time to lograge output.
Super Scale Caching Framework - Server
Rack middleware that measures HTTP request queue duration from upstream headers and reports it to Yabeda as a histogram metric.
Super Scale Caching Framework - Worker
|> 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.
This engine allows users to inject requests into a queue to be processed. The queue handles bank account validations, credit payments, debit orders and collecting bank statements/notify me statements.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.