summaryrefslogtreecommitdiff
path: root/README.progress-reporting
diff options
context:
space:
mode:
authorDavid Kalnischkies <david@kalnischkies.de>2016-04-06 12:50:26 +0200
committerDavid Kalnischkies <david@kalnischkies.de>2016-04-25 15:35:52 +0200
commit4aa6ebf6d78131416ef173b1ce472f014da25136 (patch)
treea75f193e455d73754c593b9f74c990a126da2e86 /README.progress-reporting
parent4ad57118a8a0225b413de96dedc085e0594726a6 (diff)
make random acquire queues work less random
Queues feeding workers like rred are created in a random pattern to get a few of them to run in parallel – but if we already have an idling queue we don't need to assign it to a (potentially new) random queue as that saves us the (agruably small) overhead of starting up a new queue, avoids adding jobs to an already busy queue while others idle and as a bonus reduces the size of debug logs a bit. We also keep starting new queues now until we reach our limit before we assign work at random to them, which should give us a more effective utilisation overall compared to potentially adding work to busy queues while we haven't reached our queue limit yet.
Diffstat (limited to 'README.progress-reporting')
0 files changed, 0 insertions, 0 deletions