requeus gem is a library for proxying requests
Sidekiq middleware to handle requeuing of jobs if the worker gets badly terminated or crashes
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.