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.

Required Ruby Version

>= 0

Authors

D Cameron Mauch, Peter Williams

Versions

  1. 1.4.1

    1. source

      1. 1.4.1 source January 19, 2015 (9 KB)
  2. 1.1.0

    1. source

      1. 1.1.0 source March 04, 2011 (6.5 KB)
  3. 1.0.1

    1. source

      1. 1.0.1 source August 23, 2010 (6 KB)
  4. 1.0.0

    1. source

      1. 1.0.0 source August 23, 2010 (6 KB)

SHA 256 checksum

← Previous version