Invention Grant
- Patent Title: Fast and greedy scheduling machine based on a distance matrix
-
Application No.: US15608234Application Date: 2017-05-30
-
Publication No.: US10467046B2Publication Date: 2019-11-05
- Inventor: Jay Vyas , Huamin Chen
- Applicant: Red Hat, Inc.
- Applicant Address: US NC Raleigh
- Assignee: RED HAT, INC.
- Current Assignee: RED HAT, INC.
- Current Assignee Address: US NC Raleigh
- Agency: K&L Gates LLP
- Main IPC: G06F9/48
- IPC: G06F9/48 ; G06F9/455 ; G06F9/50

Abstract:
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.
Public/Granted literature
- US20180349174A1 FAST AND GREEDY SCHEDULING MACHINE BASED ON A DISTANCE MATRIX Public/Granted day:2018-12-06
Information query