Timeline for Scheduling asynchronous jobs with efficient round-robin algorithm using Redis
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 8, 2022 at 15:31 | history | edited | Hans-Martin Mosner | CC BY-SA 4.0 | added 12 characters in body |
| Mar 8, 2022 at 15:01 | history | edited | Hans-Martin Mosner | CC BY-SA 4.0 | added a response to the comment. |
| Mar 8, 2022 at 13:25 | comment | added | Raghu | Thanks for the answer @Hans-Martin. We have segregated the queue already based on service and tenant. The approach laid out by you would be something similar to the shortest job first algorithm but the only difference being we always consider tenants with fewer jobs in the queue. But this might lead to starvation for tenants with a huge number of jobs in their queue if tenants with fewer jobs get added to the list frequently. Am I missing anything here? | |
| Mar 6, 2022 at 8:41 | history | answered | Hans-Martin Mosner | CC BY-SA 4.0 |