Resource Scheduling via Direct Node Communication
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing resource scheduling systems face inefficiencies due to the accumulation of task processing requests, leading to increased waiting times and reduced resource scheduling efficiency, particularly in high-volume request scenarios.
Innovation Solution
A resource scheduling system that directly interacts between the scheduler, task processor, and resource processing node, allowing for direct submission of resource acquiring requests and schedulable resource information, thereby reducing request accumulation and enhancing scheduling efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If resource scheduling requests are sequentially sent through an interface program, then the system structure is simple and easy to implement, but the processing speed decreases and waiting time increases when the number of requests is large
Solution Approach 1:
The patent segments the monolithic interface program into separate functional modules: task processor, resource processing node, and scheduler. Each module handles specific tasks independently, allowing parallel processing of multiple resource scheduling requests simultaneously, thereby increasing processing speed and reducing waiting time.
Solution Approach 2:
The patent introduces a new communication dimension by establishing direct communication channels between processing nodes and the scheduler, bypassing the sequential interface program. This dimensional change in the system architecture enables concurrent request handling and significantly improves processing throughput.
2Speed
If an interface program sequentially processes and forwards requests, then the system complexity is low, but the feedback speed to task processors is reduced
Solution Approach 1:
The system is divided into independent functional segments with dedicated communication paths. The task processor, resource processing node, and scheduler operate as separate entities with direct interconnections, enabling fast feedback loops without passing through a sequential interface program, thus improving feedback speed.
Solution Approach 2:
The patent implements direct feedback mechanisms where the scheduler immediately returns scheduling results to the task processor and resource processing node. This direct feedback path eliminates the delay introduced by sequential interface program processing, significantly enhancing feedback speed.
Data Source
AI summary
Embodiments of the present specification provide a resource scheduling system and method, where a task processor receives a task processing request submitted for a task to be processed, and creates, based on the task processing request, a resource acquiring request and send same to a scheduler; a resource processing node receives the task processing request, and creates, based on the task processing request, schedulable resource information and sends same to the scheduler; the scheduler executes, according to the resource acquiring request and the schedulable resource information, resource scheduling on the task to be processed, to obtain a resource scheduling result, and sends the resource scheduling result to the resource processing node and the task processor. The resource acquiring request and the schedulable resource information are respectively sent by the task processor and the resource processing node to the scheduler directly.