K&L Gates LLP
Fast and greedy scheduling machine based on a distance matrix
A method for scheduling containers includes receiving attribute values for every node, generating location metrics for each node based on each node's attribute values, generating distance values, including a first distance value corresponding to the distance between a first node and second node. Each distance value represents the distance between respective location metrics for respective nodes. A distance matrix is populated with the distance values. The scheduler initiates an attempt to schedule a container at the first node, compares attribute requirements of the container to the first attribute values, and determines that at least one of the attribute requirements of the container exceeds a respective attribute value of the first attribute values. The second node is selected from the distance matrix based on the first distance value, and the scheduler initiates an attempt to schedule the container at the second node selected from the distance matrix.
RED HAT, INC.
G G G G G
G06F G06F G06F G06F G06F
inventional inventional additional inventional inventional
Huamin Jay
Chen Vyas