Container Scheduling with Version-Matched Candidate Nodes

Solution Overview

Problem

Existing container scheduling methods face challenges in efficiently scheduling a large number of pod containers in a short period of time without affecting the quality of cluster scheduling or requiring users to change their usage patterns.

Innovation Solution

A container scheduling method utilizing optimistic concurrency control to determine candidate nodes by matching version numbers, allowing multi-threaded concurrency pod scheduling.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If traditional container scheduling methods are used, then scheduling quality is maintained, but scheduling speed is slow when handling large numbers of pod containers

Engineering Contradiction:

Improvescheduling speedVSAvoidscheduling quality

Core Design Contradiction:

ProductivityVSReliability

Solution Approach 1:

The patent applies preliminary action by pre-calculating and storing candidate nodes for each pod container before the actual scheduling decision. Version numbers are recorded in advance to enable fast verification during scheduling, avoiding the need to re-evaluate all nodes from scratch and thus improving scheduling speed while maintaining quality through pre-validated candidate selection

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

The patent implements feedback through version number verification mechanisms. After selecting candidate nodes, the system verifies their current status against recorded version numbers to ensure scheduling decisions remain valid. This feedback loop allows the system to maintain scheduling quality while using cached candidate information to accelerate the scheduling process

Inventive Principle:

Principle #23Feedback

2Productivity

If multi-threaded concurrency scheduling is implemented, then scheduling speed improves, but scheduling quality may be affected

Engineering Contradiction:

Improvescheduling speedVSAvoidscheduling quality

Core Design Contradiction:

ProductivityVSReliability

Solution Approach 1:

The patent applies preliminary action by pre-calculating and storing candidate nodes for each pod container before the actual scheduling decision. Version numbers are recorded in advance to enable fast verification during scheduling, avoiding the need to re-evaluate all nodes from scratch and thus improving scheduling speed while maintaining quality through pre-validated candidate selection

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

The patent implements feedback through version number verification mechanisms. After selecting candidate nodes, the system verifies their current status against recorded version numbers to ensure scheduling decisions remain valid. This feedback loop allows the system to maintain scheduling quality while using cached candidate information to accelerate the scheduling process

Inventive Principle:

Principle #23Feedback

Data Source

PatentUS20260037321A1Container scheduling method, and computer device

Publication Date: 2026.02.05 JD DIGITS HAIYI INFORMATION TECHNOLOGY CO LTD

AI summary

A container scheduling method, includes: from a queue to be scheduled, obtaining N pods to be scheduled; recording a first version number of each schedulable node in a cluster; traversing second attribute information of each node on the basis of first attribute information of each pod to be scheduled, so as to determine a candidate node corresponding to each pod to be scheduled, and a second version number corresponding to the candidate node; and for any pod among the pods to be scheduled, if a second version number of a candidate node corresponding to the pod matches with the recorded first version number, using the candidate node to schedule the pod.