Resource-scheduling method for resource manager

Abstract

The invention provides a resource-scheduling method for a resource manager. The resource-scheduling method comprises the following steps: A. accessing a resource pool to request resources: acquiring the resources if the resources exist in the resource pool; entering into the next step if the resources do not exist in the resource pool; B. accessing a cache resource pool to request the resources; acquiring the resources if the resources exist in the cache resource pool; entering into the next step if the resources do not existe in the cache resource pool; C. judging whether the resource quantity of the resource pool is smaller than a set quantity or not; setting up and acquiring the new resources if the resource quantity of the resource pool is smaller than the set quantity; otherwise, adding the request into a buffer queue if the resource quantity of the resource pool is not smaller than the set quantity; D. judging whether the buffer queue reaches a maximum or not; rejecting the request if the buffer queue reaches the maximum; entering into the next step if the buffer queue does not reach the maximum; E. accessing the cache resource pool through the buffer queue to request the resources; acquiring the resources if the resources exist in the cache resource pool; entering into the next step if the resources do not exist in the cache resource pool; F. judging whether the resource quantity of the cache buffer resource pool is smaller than the set quantity or not; setting up and acquiring the new resources if the resource quantity of the cache buffer resource pool is smaller than the set quantity; otherwise, increasing or decreasing the set quantity of the cache resource pool correspondingly according to the size of the buffer queue and returning to the step E. The method solves the problem existing in the resource-scheduling method of the conventional resource manager.

Description

technical field [0001] The invention relates to a resource scheduling method of a resource manager. Background technique [0002] In the prior art, the resource manager obtains resources from a resource pool with fixed boundary values ​​through an unlocked resource queue or by creating resources. When there are too many resource requests, the resource manager waits for free resources by blocking threads or queuing requests. [0003] There are following problems in above-mentioned prior art: [0004] 1. Since the resource pool with a fixed boundary value is set, the monitored idle resources will be removed from the resource pool after being idle for a certain period of time. At this time, when requests for resources exceed free resources, resources need to be created again, thereby consuming more time. [0005] 2. Thread blocking or request queuing is used, and the waiting time is unpredictable. When resources are occupied for a long time, it will result in no correspondi...

AI Technical Summary

Problems solved by technology

At this time, when the request for the resource exceeds the free resource, the resource needs to be created again, which takes more time

[0005] 2. The thread blocking or request queuing method is used, and the waiting time is unpredictable

When resources are occupied for a long time, any request will not get corresponding feedback, that is, the system will not respond

[0006] 3. When there is a peak in the request for resources, due to the settings of the resource pool boundary size, boundary survival time, boundary timeout time, etc., the utilization efficiency of the equipment is not high, and the performance cannot be fully utilized

However, the cache object thus created is still in the current resource pool, and depends on the limitations of the current resource pool, so it is less flexible to use

Images