Distributed resource allocation

A computer-implemented method comprising:

• providing, by a first resource allocator of a plurality of resource allocators in a distributed system, a first request to compute a first score to each computing node of a plurality of computing nodes, the first score representing a measure of an ability of the computing node to take a particular task;
• receiving, by the first resource allocator from each of the plurality of computing nodes, a respective first score that represents an ability of the computing node to take the particular task;
• generating a ranking of the plurality of computing nodes according to the first scores;
• selecting, from the ranking of the plurality of computing nodes according to the first scores, a highest-ranked computing node of the plurality of computing nodes with a first score that is higher than the first scores for the other computing nodes in the plurality of computing nodes:
• in response to selecting, from the ranking of the plurality of computing nodes according to the first scores, the highest-ranked computing node of the plurality of computing nodes with a first score that is higher than the first scores for the other computing nodes in the plurality of computing nodes, providing, by the first resource allocator to the highest-ranked computing node of the plurality of computing nodes, a second request to make a reservation for the particular task and to compute a second score that represents an ability of the highest-ranked computing node to take the particular task;
• receiving, by the first resource allocator from the highest-ranked computing node, a computed second score that represents an ability of the highest-ranked computing node to take the particular task;
• determining that a difference between the first score and received from the highest-ranked computing node the second score received from the highest-ranked computing node satisfies a threshold;
• and
• assigning the particular task to the highest-ranked computing node if and only if the difference between the first score received from the highest-ranked computing node and the second score received from the highest-ranked computing node satisfies the threshold.

A computer program product, encoded on one or more non-transitory computer storage media, comprising instructions that when executed by one or more computers cause the one or more computers to perform operations comprising:

• providing, by a first resource allocator of a plurality of resource allocators in a distributed system, a first request to compute a first score to each computing node of a plurality of computing nodes, the first score representing a measure of an ability of the computing node to take a particular task;
• receiving, by the first resource allocator from each of the plurality of computing nodes, a respective first score that represents an ability of the computing node to take the particular task;
• generating a ranking of the plurality of computing nodes according to the first scores;
• selecting, from the ranking of the plurality of computing nodes according to the first scores, a highest-ranked computing node of the plurality of computing nodes with a first score that is higher than the first scores for the other computing nodes in the plurality of computing nodes:
• in response to selecting, from the ranking of the plurality of computing nodes according to the first scores, the highest-ranked computing node of the plurality of computing nodes with a first score that is higher than the first scores for the other computing nodes in the plurality of computing nodes, providing, by the first resource allocator to the highest-ranked computing node of the plurality of computing nodes, a second request to make a reservation for the particular task and to compute a second score that represents an ability of the highest-ranked computing node to take the particular task;
• receiving, by the first resource allocator from the highest-ranked computing node, a computed second score that represents an ability of the highest-ranked computing node to take the particular task;
• determining that a difference between the first score received from the highest-ranked computing node and the second score received from the highest-ranked computing node satisfies a threshold;
• and
• assigning the particular task to the highest-ranked computing node if and only if the difference between the first score received from the highest-ranked computing node and the second score received from the highest-ranked computing node satisfies the threshold.