1. A method of balancing computer resources on a network of computers, comprising: (a) providing a plurality of tasks to a High Level Collector, a priority score and a weight score being associated with each of the plurality of tasks; (b) sorting the plurality of tasks into a list, wherein the tasks are sorted first by priority score and then by weight score; (d) assigning each sorted task into one of two queues, alternately assigning tasks with highest and lowest weight scores to each queue, wherein tasks in descending order from highest to lowest weight are assigned to the first queue, and tasks in ascending order from lowest to highest weight are assigned to the second queue, so that the number of tasks in each queue is substantially evenly balanced; and (e) assigning each task to a Low Level Collector by selecting tasks alternatively from each queue, starting from the first task in each queue, and assigning each task as it is selected to the Low Level Collector with the lowest total weight, until all tasks are assigned or the Low Level Collector capacity is reached.