An iterator to iterate an array in random order with controls to requeue or dequeue elements during the iteration
Schedule a single action for idle time
Interval Queue for Async and Promises, with decorator and variable requeue on failure
Real-time dashboard for ReQueue - Queue management and monitoring
Requeue messages with exponential delay
p-queue and p-retry together.
AMQP driver for node
> WAL-based crash recovery for PsyQueue. Automatically requeue orphaned jobs after a process crash.
A modern dashboard for Agenda.js with Pagination and Search capabilities forked from agendash
顺序请求框架
AMQP driver for node
A TypeScript-first RabbitMQ utility for Node.js with cleaner producers, consumers, and reduced AMQP boilerplate.
A modern dashboard for Agenda.js with Pagination and Search capabilities
NestJS microservice transport for NSQ
cuttlecat is a tool for collecting data from GitHub.
A modern dashboard for Agenda.js with Pagination and Search capabilities
Graph executor SDK
A lightweight nodejs/typescript and redis queue manager
Joi validation for pager/minion workers
A wrapper to simplify dealing with multiple RabbitMQ queues and task consumption
A fork of dashboard for Agenda.js with Pagination and Search capabilities
NSQ client actually written in javascript
NSQ client actually written in javascript
Support-desk flow helpers and in-memory adapters for react-actions-chat.
Broker abstraction layer for CeleRS (inspired by Python Kombu)
Compilation of mini-frameworks & utilities for data-streaming applications
An asynchronous Rust NSQ client library with support for concurrent message processing
A framework for building Kubernetes controllers using the Functional Core, Imperative Shell pattern
Experimental Rust implementation of the Millrace runtime.
Flexible parallel test runner with pluggable cloud providers
rust lapin helper
No control is an early version of a distributed work-stealing orchestrator
Shinka (進化) - GitOps-native database migration operator for Kubernetes
AMQP bridge
A modern, ergonomic RabbitMQ (AMQP 0-9-1) client for Rust
Event toolkit for logs, queues, streams, routing, replay, and acknowledgements
A a very simple resque based queue
Gem to use Sidekiq and Rails Models for Requeing
A Sneakers worker handler that will re-queue the message when encountering an error.
Sidekiq middleware to handle requeuing of jobs if the worker gets badly terminated or crashes
requeus gem is a library for proxying requests
Provides extra help cap commands for use with Resque, requeuing jobs, mass deleting jobs
Allows you to requeue jobs to another queue This is useful in my situations : - A large amount of jobs are queued in the critical queue, blocking the main queue for Several hours. Select jobs based on criteria and requeue them to the low queue
SidekiqAlive offers a solution to add liveness probe of a Sidekiq instance. How? A http server is started and on each requests validates that a liveness key is stored in Redis. If it is there means is working. A Sidekiq job is the responsable to storing this key. If Sidekiq stops processing jobs this key gets expired by Redis an consequently the http server will return a 500 error. This Job is responsible to requeue itself for the next liveness probe.
RedisSafeQueue is a transactional queue for ruby/redis. It guarantees at least once semantics. The queue may be used with multiple producers and consumers, each job is removed in a open/commit transaction; even if a worker dies while processing a job, it is automatically requeued.
SidekiqAlive offers a solution to add liveness probe of a Sidekiq instance. How? A http server is started and on each requests validates that a liveness key is stored in Redis. If it is there means is working. A Sidekiq job is the responsable to storing this key. If Sidekiq stops processing jobs this key gets expired by Redis an consequently the http server will return a 500 error. This Job is responsible to requeue itself for the next liveness probe.
|> 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.
No description provided.
No description provided.