A computing power network task dynamic scheduling method and system
By refining and enhancing the historical scheduling trajectory dataset, it is divided into sub-policy networks with multiple scheduling strategy modes, and a meta-policy network is constructed. This solves the robustness and accuracy problems of computing power network task scheduling in dynamic heterogeneous environments, and realizes efficient and flexible scheduling decisions.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- CHINESE PEOPLES LIBERATION ARMY INFORMATION SUPPORT CORPS ENGINEERING UNIVERSITY
- Filing Date
- 2025-12-31
- Publication Date
- 2026-05-29
AI Technical Summary
Existing computing power network task scheduling strategies lack robustness in dynamic heterogeneous computing power environments, cannot guarantee scheduling accuracy and efficiency in various scenarios, and are susceptible to data pseudo-correlation interference. A single strategy is difficult to cover diverse and effective scheduling styles.
By acquiring historical scheduling trajectory datasets, trajectory purification and counterfactual trajectory data augmentation are performed to form a high-quality causal trajectory set. Based on unsupervised clustering, the set is divided into sub-policy networks of various scheduling strategy modes. A meta-policy network is constructed to dynamically generate scheduling actions, and a model-independent meta-learning framework is used for training and deployment.
It achieves high-precision, robust, and fast-adaptive scheduling in dynamic heterogeneous computing environments, supports continuous iterative optimization of strategies, and avoids strategy bias caused by spurious correlations in historical data.
Smart Images

Figure CN122111640A_ABST