Distributed resource scheduling method, scheduling node and access node

Abstract

The application discloses a resource scheduling method, a scheduling node and an access node. The method is applied to a scheduling node, and includes: receiving a service request message sent by at least one access node, wherein the service request message from an access node indicates at least one service to be processed in the access node; acquiring at least one resource node and, for each access node, perform the following processing: perform resource scheduling according to the service request message and the work queue status information, so as to allocate at least one resource node for each service to be processed in the access node and generating a scheduling result; sending the scheduling result to the access node, so that the access node sends at least one task request to the allocated at least one resource node according to the scheduling result. By using these technical solutions, the efficiency of resource scheduling performed by the scheduling node and the resource utilization rate of the resource node can be improved.

Description

technical field [0001] The present application relates to the field of computer processing, and in particular to a distributed resource scheduling method, a scheduling node and an access node. Background technique [0002] Distributed computing is to decompose a complex task or application into many small parts and assign them to multiple computers for parallel processing. When performing resource scheduling, the scheduling node determines a resource node among multiple resource nodes to process the request according to the received request. [0003] For distributed computing, in the existing resource scheduling method, the scheduling node allocates a corresponding resource node for each request by pre-estimating the processing capability of each resource node. If the prediction of the processing capability of the resource node is not accurate enough, the scheduling of the whole system will be unreasonable, and requests cannot be scheduled according to the real capability o...

AI Technical Summary

Problems solved by technology

If the estimation of the processing capability of resource nodes is not accurate enough, the scheduling of the entire system will be unreasonable, and requests cannot be scheduled according to the real capabilities of resource nodes

In addition, when the processing time required by each request is different and there is no way to predict it in advance, it is easy to cause unbalanced load of resource nodes processing requests

Therefore, the resource allocation of resource nodes is unreasonable, resulting in a decrease in resource utilization

Images