an opinionated implementation of resque in node
A Vue 3 Component Library. Fairly Complete, Theme Customizable, Uses TypeScript, Fast
Collision-resistant ids optimized for horizontal scaling and performance. For node and browsers.
Resque Queue for AdonisJS v6
Find adverbs in your writings
A resque administration website for actionhero
just emit 'log' events on the process object
A small fast zlib stream built on [minipass](http://npm.im/minipass) and Node.js's zlib binding.
An incremental implementation of MurmurHash3
The fCoSE layout for Cytoscape.js by Bilkent with fast compound node placement
**Distributed delayed jobs in nodejs**. Resque is a background job system backed by [Redis](http://redis.io) (version 2.6.0 and up required). It includes priority queues, plugins, locking, delayed jobs, and more! This project is a very opinionated but API
an implementation of resquebus in node
Executor plugin for Screwdriver using Resque
Coffeescript/Node.js port of Resque
QR code generator in Javascript
Node resque.
Streaming http in the browser
an opinionated implementation of resque in node
TypeScript library for BARE, a compact and simple binary-serialization format (Rivet fork with ULEB128 fix)
StyleX babel plugin.
A TDS driver, for connecting to MS SQLServer databases.
Spice Javascript client
A Vue 3 Component Library. Fairly Complete, Theme Customizable, Uses TypeScript, Fast
Ummon is a Node.js application for queuing, running, and monitoring tasks
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.
Usually Resque workers work on queues in the given order (if there is something in the first, work it, otherwise if the there is something in the second, work on it, and so on). This plugin randomizes the order of the queues based on weights, so that a given queue will be the first queue to try based on a probability weight. Given queues A, B, C, D and weights 4, 3, 2, 1, repsectively, A will be first 40% of the time, B 30%, C 20%, and D 10%. In addition, when B is first, A will be second 4/7ths of the time (4 / [4+2+1]), and so on. The project is inspired by resque-fairly, which unfortunately mathematically does not give you this control over the weights.