Computing-storage stream joint scheduling optimization method and system based on DDQN and heuristic strategy
Through the joint scheduling optimization method of computing-store streams based on DDQN and heuristic strategies, the dynamic perception and resource separation problems of traditional scheduling systems in large-scale distributed computing environments are solved, and the refinement of task scheduling and multi-objective optimization are achieved, which improves the system's task execution efficiency and resource utilization.
Patent Information
- Application Number
- CN202510863895.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-06-26
- Publication Date
- 2025-07-25
- Estimated Expiration
- 2045-06-26
AI Technical Summary
Traditional task scheduling systems lack dynamic perception capabilities in large-scale distributed computing environments, resulting in low resource utilization, high task latency, and separation of data from computing, making it difficult to adapt to high concurrency and dynamic load scenarios. In addition, the existing scheduling methods generally have weak generalization capabilities in state representations, making it difficult to meet the needs of high performance and high elasticity.
The calculation-store flow joint scheduling optimization method based on DDQN and heuristic strategies is adopted. By decoupling the computing flow and storage flow, the state representation and action space are optimized, the task dependency structure, resource state and historical scheduling records are integrated, and the scheduling decisions are made in combination with Q-value evaluation and heuristic rules to achieve task load balancing and execution time minimization.
It significantly improves task execution efficiency and resource utilization, realizes refinement of task scheduling and multi-objective optimization, and improves the overall performance and resource utilization of the system.