Now assigns user to worker with the smallest accumulated user weight so far, like in a textbook greedy scheduling algorithm. Before, because of implementation issues, scheduling based on weight was done, but had to select the same number of users per process.
Now assigns user to worker with the smallest accumulated user weight so far, like in a textbook greedy scheduling algorithm. Before, because of implementation issues, scheduling based on weight was done, but had to select the same number of users per process.