Priority function queue with hrtime considerations
A priority worker queue that allows you to work with more than just integers and allows you to configure concurrency.
Fast, in memory work 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.
A shim for the setImmediate efficient script yielding API
A minimal and tiny Node.js Worker Thread Pool implementation, a fork of piscina, but with fewer features
Priority queue data structures
Fast heap-based priority queue in JavaScript
an opinionated implementation of resque in node
The smallest and simplest JavaScript priority queue
Tiny queue data structure
Offload tasks to a pool of workers on node.js and in the browser
A priority queue that shuffles elements with the same priority.
A promise based, dynamic priority queue runner, with concurrency limiting.
High-priority task queue for Node.js and browsers
Multi-strategy job queue with local and BullMQ support
Utility to create worker pools
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.
Database-specific job handling and queue management
No description provided.
A JS library for finding optimal label position inside a polygon
A resque plugin for specifying the priority between queues that workers use to determine what to work on next
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.
An AMQP-based background worker system for Ruby designed to make managing heterogenous tasks relatively easy. The use case for Woodhouse is for reliable and sane performance in situations where jobs on a single queue may vary significantly in length. The goal is to permit large numbers of quick jobs to be serviced even when many slow jobs are in the queue. A secondary goal is to provide a sane way for jobs on a given queue to be given special priority or dispatched to a server more suited to them. Clients (i.e., your application) may be using either Ruby 1.9 in any VM.