Fair Queues for Redis/Valkey like in SQS

[hsleewis]

For SQS Fair Queues are supported now: #56763

I've been extending the queue system for redis to do something similar, in Redis I maintain

• [set] q:list
  Contains all queues and groups that have active jobs
• [hash] q:count
  Contains the job count for each queue

Basically I have all queues like this:
<queue>:group:<groupId>
And whenever the worker for a queue with active group jobs needs to get a job from the queue, it randomly picks one of the active groupId's to make sure groups with a lot of jobs don't slow down the other groups.

Is this similar how the Fair queue system in SQS works? And is this something that could be considered to be added to the Laravel Redis queue system as well or is it too niche?

[macropay-solutions]

By the way, the implementation will generate a change in how FIFO queues worked.

If the framework now sends the deduplicationId to SQS and you don't define the deduplicationId function in your jobs, a UUID will be sent making the default logic change.
Until now no deduplicationId was sent, meaning SQS used the body of the message to build an "id". That meant that if you sent the message twice with the same body, it would had been processed only once in that 5 minutes interval.

@crynobone