Resource scheduling method and device

Abstract

The invention discloses a resource scheduling method and device, and relates to the technical field of computers. One specific embodiment of the method comprises the following steps: acquiring the current available resource quantity of each resource in a resource cluster; determining a recovery priority of the resource according to the current available resource quantity of the resource; and when a new task allocation request is received, allocating a new task to one or more resources according to the recovery priority of the resources and the current available resource quantity of the resources. According to the embodiment, the resources are scheduled based on the current available resource quantity of the resources, the resources can be utilized to the maximum extent when the load of the resource cluster is high, idle resources can be recycled step by step when the load of the resource cluster is low, and therefore resource waste is reduced, and the resource utilization rate is increased.

Description

technical field [0001] The present invention relates to the field of computer technology, in particular to a resource scheduling method and device. Background technique [0002] Today, with the extensive application of cluster technology, in order to make full use of cluster resources, a variety of load balancing algorithms have emerged, including round robin, random, source address hashing, weighted round robin, weighted random, and minimum connection Different load balancing algorithms can meet the requirements of resource load balancing in different application scenarios. [0003] In the process of realizing the present invention, the inventors found that there are at least the following problems in the prior art: the current load balancing algorithms are all based on how to make full use of resources, that is, to share the load among resource clusters, but they do not consider resource recovery and recovery. When the overall load of the resource cluster is small, idle r...

AI Technical Summary

Problems solved by technology

[0003] In the process of realizing the present invention, the inventor found that there are at least the following problems in the prior art: the current load balancing algorithms are all based on how to make full use of resources, that is, to share the load among resource clusters, but they do not consider resource recovery and recovery. When the overall load of the resource cluster is small, idle resources cannot be recycled, resulting in a waste of resources

For example, take the polling method as an example. When there are multiple resources in the resource cluster, the load will be balanced to all the different resources. If some resources are recovered, the objects that are being serviced by the recovered resources will be affected. If If some resources are not recycled, all resources in the resource cluster will always be running at the same time, resulting in a great waste of resources to a certain extent

Images