Tournament scheduling

A non-transitory computer readable medium storing instructions that, when executed by one or more processors, cause the one or more processors to perform a method, the method comprising:

• receiving, by the one or more processors, a request to schedule a task, the task being associated with one or more constraints identifying an amount of computing resources needed to perform the task;
• randomly selecting, independent of the one or more constraints, by the one or more processors, a subset of candidate server computing devices from a plurality of server computing devices to compete in a polling tournament for scheduling the task, the subset comprising at least two candidate server computing devices;
• after randomly selecting the subset of candidate server computing devices, polling, by the one or more processors, the candidate server computing devices of the subset to determine an amount of computing capacity currently available in each candidate server computing device;
• comparing, by one or more computing devices, the amount of computing capacity currently available in each of the candidate server computing devices of the subset;
• determining, by the one or more processors, a winning candidate server computing device of the polling tournament based on the comparison of the amount of computing capacity currently available in each of the polled candidate server computing devices and the constraints;
• and
• allocating, by the one or more processors, the task to the winning candidate server computing device.

A system, comprising:

• a memory;
• and
• one or more processors in communication with the memory, the one or more processors being configured to:
• receive a request to schedule a task, the task being associated with one or more constraints identifying an amount of computing resources needed to perform the task;
• randomly select, independent of the one or more constraints, a subset of candidate server computing devices from a plurality of server computing devices to compete in a polling tournament for scheduling the task, the subset comprising at least two candidate server computing devices;
• after randomly selecting the subset of candidate server computing devices, poll the candidate server computing devices of the subset to determine an amount of computing capacity currently available in each candidate server computing device;
• compare the amount of computing capacity currently available in each of the candidate server computing devices of the subset;
• determine a winning candidate server computing device of the polling tournament based on the comparison of the amount of computing capacity currently available in each of the polled candidate server computing devices and the constraints;
• and
• allocate the task to the winning candidate server computing device.