CN113360288A - Resource pool resource filling method, device, equipment and readable storage medium - Google Patents
Resource pool resource filling method, device, equipment and readable storage medium Download PDFInfo
- Publication number
- CN113360288A CN113360288A CN202110702135.2A CN202110702135A CN113360288A CN 113360288 A CN113360288 A CN 113360288A CN 202110702135 A CN202110702135 A CN 202110702135A CN 113360288 A CN113360288 A CN 113360288A
- Authority
- CN
- China
- Prior art keywords
- filled
- resource
- resource pool
- resources
- remaining
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 59
- 238000004891 communication Methods 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 6
- 238000003379 elimination reaction Methods 0.000 description 5
- 238000004364 calculation method Methods 0.000 description 4
- 125000004122 cyclic group Chemical group 0.000 description 4
- 238000010586 diagram Methods 0.000 description 4
- GNFTZDOKVXKIBK-UHFFFAOYSA-N 3-(2-methoxyethoxy)benzohydrazide Chemical compound COCCOC1=CC=CC(C(=O)NN)=C1 GNFTZDOKVXKIBK-UHFFFAOYSA-N 0.000 description 1
- FGUUSXIOTUKUDN-IBGZPJMESA-N C1(=CC=CC=C1)N1C2=C(NC([C@H](C1)NC=1OC(=NN=1)C1=CC=CC=C1)=O)C=CC=C2 Chemical compound C1(=CC=CC=C1)N1C2=C(NC([C@H](C1)NC=1OC(=NN=1)C1=CC=CC=C1)=O)C=CC=C2 FGUUSXIOTUKUDN-IBGZPJMESA-N 0.000 description 1
- YTAHJIFKAKIKAV-XNMGPUDCSA-N [(1R)-3-morpholin-4-yl-1-phenylpropyl] N-[(3S)-2-oxo-5-phenyl-1,3-dihydro-1,4-benzodiazepin-3-yl]carbamate Chemical compound O=C1[C@H](N=C(C2=C(N1)C=CC=C2)C1=CC=CC=C1)NC(O[C@H](CCN1CCOCC1)C1=CC=CC=C1)=O YTAHJIFKAKIKAV-XNMGPUDCSA-N 0.000 description 1
- 238000013473 artificial intelligence Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000013468 resource allocation Methods 0.000 description 1
- 230000011664 signaling Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/50—Indexing scheme relating to G06F9/50
- G06F2209/5011—Pool
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Debugging And Monitoring (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The application discloses a resource pool resource filling method, a device, equipment and a readable storage medium, wherein the method comprises the following steps: acquiring a resource pool set to be filled and the total number of the fillable resources; if the resource pool set to be filled contains a resource pool which does not meet the resource filling requirement and does not need to be filled, rejecting the resource pool which does not need to be filled to obtain a first residual resource pool set to be filled; calculating the corresponding filling resource number corresponding to the first remaining resource pool set to be filled and the total filling resource number; and filling the resource pool to be filled corresponding to the first residual resource pool set to be filled based on the number of the resources to be filled. According to the resource filling method and device, the resource which does not need to be filled in the resource pool is prevented from being filled, and the utilization rate of the resource in the resource pool is improved.
Description
Technical Field
The present application relates to the field of financial technology (Fintech), and in particular, to a resource pool resource filling method, apparatus, device, and readable storage medium.
Background
With the continuous development of financial technologies, especially internet technology and finance, more and more technologies (such as distributed technology, artificial intelligence and the like) are applied to the financial field, but the financial industry also puts higher requirements on the technologies, such as higher requirements on the resource distribution of a distributed system of the financial industry.
In the existing scheme, when a distributed system needs to fill resources, resources are evenly allocated to resource pools in the distributed system, however, in the distributed system, there are some resources in a part of resource pools that have not been consumed or the consumption rate is far lower than that of the resources in other resource pools, but for the part of resource pools, the same amount of resources as the other resource pools are still allocated to the part of resource pools in the existing scheme, which results in low utilization rate of the resources in the part of resource pools.
That is, the utilization of resources in the resource pool is low.
Disclosure of Invention
The present application mainly aims to provide a resource pool resource filling method, device, apparatus and readable storage medium, and aims to solve the technical problem of how to improve the utilization rate of resources in a resource pool in the prior art.
In order to achieve the above object, the present application provides a resource pool resource filling method, which includes the steps of:
acquiring a resource pool set to be filled and the total number of the fillable resources;
if the resource pool set to be filled contains a resource pool which does not meet the resource filling requirement and does not need to be filled, rejecting the resource pool which does not need to be filled to obtain a first residual resource pool set to be filled;
calculating the corresponding filling resource number corresponding to the first remaining resource pool set to be filled and the total filling resource number;
and filling the resource pool to be filled corresponding to the first residual resource pool set to be filled based on the number of the resources to be filled.
Optionally, the resource pool not to be filled includes a first resource pool not to be filled, and if the resource pool to be filled includes a resource pool not to be filled that does not satisfy the resource filling requirement, the resource pool not to be filled is rejected to obtain a first remaining resource pool set to be filled, including:
calculating a first residual resource average number of first residual resources of each first resource pool to be filled in the resource pool set to be filled;
calculating the average number of the first resources to be filled based on the total number of the fillable resources and the number of the resource pools corresponding to the resource pool set to be filled;
calculating the sum of the first remaining resource average and the first to-be-filled resource average to obtain a first filled resource average;
and if the first resource pool to be filled contains a first resource pool not requiring filling, the first resource pool not requiring filling is rejected, and a first resource pool set to be filled is obtained.
Optionally, if each first resource pool to be filled contains a first resource pool not to be filled whose first remaining resource number is greater than the first average number of resources after filling, removing the first resource pool not to be filled to obtain a first remaining resource pool set to be filled, including:
if each first resource pool to be filled contains a first resource pool not to be filled, the first resource pool not to be filled is rejected, and a first updated resource pool set to be filled is obtained;
and taking the first updated resource pool set to be filled as the resource pool set to be filled, returning to the step of calculating the first residual resource average number of the first residual resource of each first resource pool to be filled in the resource pool set to be filled until each first resource pool to be filled does not contain a first resource pool which does not need to be filled and the first residual resource number of which is greater than the filled resource average number, and taking the first updated resource pool set to be filled as the first resource pool set to be filled.
Optionally, the calculating the number of resources to be filled corresponding to the first remaining resource pool set to be filled and the total number of resources to be filled includes:
calculating a second remaining resource average number of second remaining resources of each second resource pool to be filled in the first remaining resource pool set to be filled;
calculating a second average number of resources to be filled between the total number of fillable resources and the number of resource pools corresponding to the first remaining resource pool set to be filled;
calculating the sum of the second remaining resource average and the second to-be-filled resource average to obtain a second filled resource average;
and respectively calculating the difference between the average number of the second filled resources and each second residual resource number to obtain the number of the resources to be filled.
Optionally, the resource pool not to be filled includes a second resource pool not to be filled, and if the resource pool to be filled includes a resource pool not to be filled that does not satisfy the resource filling requirement, the resource pool not to be filled is rejected to obtain a first remaining resource pool set to be filled, including:
calculating a first residual resource average number of first residual resources of each first resource pool to be filled in the resource pool set to be filled;
if each first resource pool to be filled contains a second resource pool not required to be filled, the number of first residual resources of which is greater than the average number of the first residual resources, the second resource pool not required to be filled is removed, and a second updated resource pool set to be filled is obtained;
calculating the sum of the third remaining resource number of the second updated resource pool set to be filled and the total number of the fillable resources to obtain the total number of the filled resources;
calculating a first quotient between the total number of the filled resources and the number of the resource pools of the second updated resource pool set to be filled to obtain an average number of the filled total resources;
calculating a third remaining resource average number of a third remaining resource number of the second updated resource pool set to be filled;
and if the total resource average number after filling is smaller than the third remaining resource average number, taking the second updated resource pool set to be filled as the resource pool set to be filled, returning to the step of calculating the first remaining resource average number of each first resource pool to be filled in the resource pool set to be filled until the total resource average number after filling is larger than or equal to the third remaining resource average number, and taking the second updated resource pool set to be filled as the first remaining resource pool set to be filled.
Optionally, the calculating the number of resources to be filled corresponding to the first remaining resource pool set to be filled and the total number of resources to be filled includes:
acquiring a fourth remaining resource average number of the first remaining resource pool set to be filled;
calculating a difference value of the number of resources to be filled between the fourth average number of remaining resources and a fourth number of remaining resources, wherein the fourth number of remaining resources is the number of remaining resources of each third resource pool to be filled in the first set of resource pools to be filled;
after each third resource pool to be filled is filled through the total number of the fillable resources, if the number of the remaining fillable resources is greater than zero, adding the second resource pool which does not need to be filled to the first remaining resource pool set to be filled, and returning to the step of obtaining the fourth remaining resource average number of the first remaining resource pool set to be filled until a preset cycle end condition is met;
and acquiring the difference value of the number of resources to be filled in the circulation process corresponding to the preset circulation ending condition, and respectively calculating the sum of the difference values of the number of resources to be filled corresponding to each fourth resource pool to be filled in the first residual resource pool set to obtain the number of resources to be filled.
Optionally, the calculating a sum of differences of the numbers of resources to be filled corresponding to each fourth resource pool to be filled in the first remaining resource pool set to be filled, respectively, to obtain the number of resources to be filled includes:
after the fourth resource pool to be filled is filled, if the number of the remaining fillable resources is greater than zero, calculating a second quotient between the number of the remaining fillable resources and the number of the resource pools of the fourth resource pool to be filled;
eliminating resource pools, the number of which is greater than the second quotient, in the fourth resource pool to be filled to obtain a second remaining resource pool set to be filled;
calculating a third quotient of the number of the residual fillable resources and the second residual resource pool set to be filled;
and adding the third quotient to the sum of the difference values of the resource numbers to be filled respectively to obtain the number of resources to be filled.
In addition, in order to achieve the above object, the present application further provides a resource pool resource filling device, including:
the acquisition module is used for acquiring a resource pool set to be filled and the total number of the fillable resources;
the removing module is used for removing the resource pool which does not need to be filled if the resource pool set to be filled contains the resource pool which does not need to be filled and does not meet the resource filling requirement, so as to obtain a first residual resource pool set to be filled;
the computing module is used for computing the corresponding filling resource number of the first remaining resource pool set to be filled and the total fillable resource number;
a filling module, configured to fill the to-be-filled resource pool corresponding to the first remaining to-be-filled resource pool set based on the number of resources to be filled
In addition, to achieve the above object, the present application also provides a resource pool resource filling device, which includes a memory, a processor, and a resource pool resource filling program stored in the memory and executable on the processor, and when the resource pool resource filling program is executed by the processor, the resource pool resource filling device implements the steps of the resource pool resource filling method described above.
In addition, to achieve the above object, the present application also provides a computer readable storage medium, which stores a resource pool resource filling program, and when the resource pool resource filling program is executed by a processor, the resource pool resource filling program implements the steps of the resource pool resource filling method as described above.
Compared with the prior art that resources are evenly distributed to the resource pool, so that the resource utilization rate of the resources in the resource pool is low, the method and the device have the advantages that the resource pool set to be filled and the total number of the fillable resources are obtained; if the resource pool set to be filled contains a resource pool which does not meet the resource filling requirement and does not need to be filled, rejecting the resource pool which does not need to be filled to obtain a first residual resource pool set to be filled; calculating the corresponding filling resource number corresponding to the first remaining resource pool set to be filled and the total filling resource number; and filling the resource pool to be filled corresponding to the first residual resource pool set to be filled based on the number of the resources to be filled. According to the resource pool filling method and device, when the resource pool to be filled contains the resource pool not to be filled which does not meet the resource filling requirement, the resource pool not to be filled is removed, the first remaining resource pool set to be filled is obtained, and therefore only the resource pool to be filled in the first remaining resource pool set to be filled is filled with resources, the resources in the resource pool not to be filled are prevented from being filled, and the utilization rate of the resources in the resource pool is improved.
Drawings
FIG. 1 is a schematic flowchart of a resource pool resource filling method according to a first embodiment of the present application;
FIG. 2 is a flowchart illustrating a resource pool resource filling method according to a second embodiment of the present application;
FIG. 3 is a functional block diagram of a resource pool resource filling apparatus according to an embodiment of the present invention;
fig. 4 is a schematic structural diagram of a hardware operating environment according to an embodiment of the present application.
The implementation, functional features and advantages of the objectives of the present application will be further explained with reference to the accompanying drawings.
Detailed Description
It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.
Referring to fig. 1, fig. 1 is a schematic flowchart of a first embodiment of a resource pool resource filling method according to the present application.
Embodiments of the present application provide an embodiment of a resource pool resource filling method, and it should be noted that, although a logical order is shown in the flowchart, in some cases, the steps shown or described may be performed in an order different from that here. The resource pool resource filling method can be applied to a distributed system. For convenience of description, the following omits the execution subject describing various steps of the resource pool resource filling method. The resource pool resource filling method comprises the following steps:
step S10, acquiring a to-be-filled resource pool set and the total number of fillable resources.
In this embodiment, before resource filling is performed on a resource pool of a distributed system, the number of the resource pool needs to be obtained, so as to determine the total number of fillable resources applied according to the number, and perform resource filling on a set of resource pools to be filled (i.e., a set of each resource pool of the distributed system) through the resources of the total number of fillable resources.
Step S20, if the resource pool set to be filled contains a resource pool which does not need to be filled and does not meet the resource filling requirement, the resource pool which does not need to be filled is removed, and a first remaining resource pool set to be filled is obtained.
In this embodiment, when the distributed system is running, resources need to be consumed to complete a corresponding task, such as a transaction task, and accordingly, since the resource pools in the distributed system are distributed, the consumption rates of the resources in the resource pools are not consistent, and the consumption rate is determined by the frequency of task execution, that is, the higher the frequency is, the higher the consumption rate is; the lower the frequency, the lower the consumption rate. The resource residual quantity of each resource pool is inconsistent at the same time due to inconsistent consumption rates, and even when the resources in some resource pools are about to be exhausted, the resources in some resource pools are almost not used.
It should be noted that, when there is a resource pool with depleted resources or to be depleted, a batch of resources needs to be applied for filling, so as to ensure that the resource pool with depleted resources or to be depleted can continue normal processing tasks. Therefore, before filling resources, determining whether a to-be-filled resource pool set contains an un-filled resource pool (namely a resource pool which is almost unused) which does not meet the resource filling requirement, if the to-be-filled resource pool set contains the un-filled resource pool which does not meet the resource filling requirement, rejecting the un-filled resource pool to obtain a first remaining to-be-filled resource pool set, so as to fill the resources for the resource pool in the first remaining to-be-filled resource pool set, but not fill the resources for the un-filled resource pool, and further realize the on-demand allocation of the resources; of course, if the resource pool set to be filled does not contain a resource pool which does not need to be filled and does not meet the resource filling requirement, the resource pool set to be filled is directly used as a first remaining resource pool set to be filled, and resources are filled in the resource pool in the first remaining resource pool set to be filled.
Wherein, the above-mentioned rejection process is accomplished through rejecting the rule, specifically, should reject the rule and be:
the resource pool not to be filled comprises a first resource pool not to be filled, and if the resource pool to be filled comprises the resource pool not to be filled which does not meet the resource filling requirement, the resource pool not to be filled is rejected to obtain a first remaining resource pool set to be filled, including:
step a, calculating a first remaining resource average number of the first remaining resource number of each first resource pool to be filled in the resource pool set to be filled.
In this embodiment, the first remaining resources of each first to-be-filled resource pool in the to-be-filled resource pool set are different, for example, the first remaining resource of the to-be-filled resource pool a is 1, the first remaining resource of the to-be-filled resource pool b is 10, and before determining that the resource pool in the to-be-filled resource pool set does not need to be filled, the first remaining resource average number of the first remaining resources of each first to-be-filled resource pool in the to-be-filled resource pool set needs to be calculated.
It is to be understood that the first average number of remaining resources corresponds to a sum of the first number of remaining resources of the respective first pools of resources to be filled. For example, the number of the first to-be-filled resource pools in the to-be-filled resource pool set is n, each first to-be-filled resource pool is P1, P2, … …, and Pn, and accordingly, the number of the first remaining resources corresponding to each first to-be-filled resource pool is C1, C2, … …, and Cn, that is, the average number of the first remaining resources is (C1+ C2+ … … + Cn)/n.
And b, calculating the average number of the first resources to be filled based on the total number of the fillable resources and the number of the resource pools corresponding to the resource pool set to be filled.
In this embodiment, a quotient between the total number of the fillable resources and the number of the resource pools corresponding to the set of resource pools to be filled is calculated, that is, a number of resources that can be allocated to each first resource pool to be filled, that is, an average number of the first resources to be filled, when the number of the total number of fillable resources is averagely filled in each first resource pool to be filled is calculated. For example, if the total number of fillable resources is T and the number of resource pools is n, the average number of first to-be-filled resources is T/n.
Step c, calculating the sum of the first remaining resource average and the first to-be-filled resource average to obtain a first filled resource average;
and d, if each first resource pool to be filled contains a first resource pool not to be filled, the first resource pool not to be filled is rejected, and a first resource pool set to be filled is obtained, wherein the number of first residual resources is larger than the average number of the first filled resources.
In this embodiment, the sum of the first remaining resource average and the first to-be-filled resource average is calculated to obtain a first filled resource average, i.e., (C1+ C2+ … … + Cn)/n + T/n. For the process of determining the first resource pool not to be filled, it is determined whether each first resource pool to be filled contains a resource pool whose first remaining resource number is greater than the first average number of resources after filling, if yes, the resource pool is taken as the first resource pool not to be filled, and the first resource pool not to be filled is removed, so as to obtain a first remaining resource pool set to be filled, for example, the first resource pool P1 to be filled is removed; if not, the first resource pool not needing to be filled is not found, and all the first resource pools to be filled in the resource pool set to be filled are used as the resource pools in the first remaining resource pool set to be filled.
Further, if each first resource pool to be filled contains a first resource pool not to be filled whose first remaining resource number is greater than the first average number of resources after filling, the first resource pool not to be filled is removed to obtain a first set of resource pools to be filled, including:
step d1, if each first resource pool to be filled contains a first resource pool not requiring filling, in which the number of first remaining resources is greater than the first average number of resources after filling, the first resource pool not requiring filling is removed, and a first updated resource pool set to be filled is obtained.
In this embodiment, the first resource pool not requiring filling may need to undergo multiple culling processes, specifically, if each first resource pool to be filled includes a first resource pool not requiring filling, where the number of first remaining resources is greater than the average number of first resources after filling, the first resource pool not requiring filling is culled to obtain a first updated resource pool set to be filled, and the culling times in the multiple culling processes are determined by the first updated resource pool set to be filled; if the first resource pool to be filled does not contain the first resource pool not to be filled, wherein the first residual resource number of the first resource pool to be filled is larger than the first filled resource average number, any first resource pool to be filled does not need to be removed.
Step d2, the resource pool set to be filled after the first update is taken as the resource pool set to be filled, and the step of calculating the first remaining resource average number of the first remaining resource number of each first resource pool to be filled in the resource pool set to be filled is returned until each first resource pool to be filled does not contain the first resource pool to be filled whose first remaining resource number is greater than the filled resource average number, and the resource pool set to be filled after the first update is taken as the first resource pool set to be filled.
In this embodiment, a loop body with first resource pools not to be filled removed is entered, specifically, a first updated resource pool set to be filled is taken as a resource pool set to be filled, and a step of calculating a first remaining resource average number of a first remaining resource number of each first resource pool to be filled in the resource pool set to be filled is returned, that is, the first remaining resource average number is recalculated according to the first updated resource pool set to be filled, and the first resource pool not to be filled in the first updated resource pool set is determined according to the recalculated first remaining resource average number.
It should be noted that the cycle condition is that each first resource pool to be filled contains a first resource pool not to be filled whose first remaining resource number is greater than the average number of the filled resources, that is, the first resource pool not to be filled can be removed from the first resource pool set to be filled after the first update, when the first resource pool not to be filled can not be removed from the first resource pool set to be filled after the first update, the cycle is ended, and the first resource pool set to be filled after the last cycle is taken as the first resource pool set to be filled after the first update. For example, after the loop is finished, P1 and P2 in each first to-be-filled resource pool are eliminated, and the resource pools in the first remaining to-be-filled resource pool set include P3, P4, … … and Pn.
Step S30, calculating the corresponding filling resource number corresponding to the first remaining resource pool set to be filled and the total filling resource number;
step S40, filling the resource pool to be filled corresponding to the first remaining resource pool set to be filled based on the number of resources to be filled.
In this embodiment, the resource pool in the first remaining resource pool set to be filled is a resource pool of resources to be filled, that is, the resources capable of being filled with the total number of resources are all filled into the resource pool in the first remaining resource pool set to be filled, specifically, when the resources are filled, the corresponding number of resources to be filled is calculated from the first remaining resource pool set to be filled and the total number of the fillable resources; and after the number of resources to be filled is obtained through calculation, correspondingly filling the resource pool to be filled in the first residual resource pool set to be filled according to the number of resources to be filled.
Wherein the calculation process is as follows:
the calculating the number of resources to be filled corresponding to the first remaining resource pool set to be filled and the total number of resources to be filled includes:
step e, calculating a second remaining resource average number of the second remaining resource number of each second resource pool to be filled in the first remaining resource pool set to be filled;
step f, calculating the second average number of the resources to be filled between the total number of the fillable resources and the number of the resource pools corresponding to the first remaining resource pool set to be filled;
step g, calculating the sum of the second remaining resource average and the second to-be-filled resource average to obtain a second filled resource average;
and h, respectively calculating the difference between the average number of the second filled resources and each second residual resource number to obtain the number of the resources to be filled.
In this embodiment, first, a second remaining resource average number of the second remaining resource number of each second resource pool to be filled in the first remaining resource pool set needs to be calculated, that is, an average number of C3, C4, … …, and Cn corresponding to P3, P4, … …, and Pn is calculated, that is, (C3+ C4+ … … + Cn)/(n-2); secondly, calculating a second average number of resources to be filled between the total number of the fillable resources and the number of resource pools corresponding to the first remaining resource pool set to be filled, namely T/(n-2); then calculating the sum of the second remaining resource average and the second average to-be-filled resource to obtain a second filled resource average, namely (C3+ C4+ … … + Cn)/(n-2) + T/(n-2); and finally, respectively calculating the difference between the average number of the resources after the second filling and each second remaining resource number to obtain the number of the resources to be filled, wherein the number of the resources to be filled corresponding to the resource pool P3 is (C3+ C4+ … … + Cn)/(n-2) + T/(n-2) -C3, for example.
It can be understood that, in the resource pool of the distributed system after resource filling, the resource number of the resource is balanced again. After the resource pool in the first remaining resource pool set to be filled is filled with resources in the above manner, there is a case that the resources whose number is the total number of the fillable resources are not used up, and for the resources that are not used up, the resources that are not used up can be allocated to the resource pool whose consumption rate of the resources is the maximum.
Taking the following table as an example, the first to-be-filled resource pools P1, P2, P3, … … and P13 exist in the to-be-filled resource pool set, and the result of allocating resources in the above manner is:
it can be understood that the resource pool P13 is a first resource pool that does not need to be filled, the number of the filled resources is 0, and the number of the resources corresponding to P1, P2, P3, … …, and P11 in the number of the filled resources is the same, wherein since the first remaining number of the resource pool P12 is the minimum, which indicates that the consumption rate of the resources is the maximum, the resources that are not used up are allocated to P12.
In addition, by the above average allocation method, it is obvious that resources which are originally allocated to the resource pool which is not required to be filled are allocated to other resource pools which require more resources, so that the number of resources which are used for filling the resource pool with the minimum number of residual resources at a time is increased, and the frequency of resource replenishment is reduced.
Compared with the prior art that resources are evenly distributed to the resource pool, so that the resource utilization rate of the resources in the resource pool is low, the method and the device for filling the resource pool have the advantages that the resource pool set to be filled and the total number of the fillable resources are obtained; if the resource pool set to be filled contains a resource pool which does not meet the resource filling requirement and does not need to be filled, rejecting the resource pool which does not need to be filled to obtain a first residual resource pool set to be filled; calculating the corresponding filling resource number corresponding to the first remaining resource pool set to be filled and the total filling resource number; and filling the resource pool to be filled corresponding to the first residual resource pool set to be filled based on the number of the resources to be filled. In this embodiment, when the to-be-filled resource pool set contains an not-to-be-filled resource pool which does not meet the resource filling requirement, the not-to-be-filled resource pool is rejected to obtain a first remaining to-be-filled resource pool set, so that only the to-be-filled resource pool in the first remaining to-be-filled resource pool set is filled with resources, thereby avoiding filling resources in the not-to-be-filled resource pool, and further improving the utilization rate of the resources in the resource pool.
Further, referring to fig. 2, on the basis of the first embodiment of the resource pool resource filling method of the present application, a second embodiment is provided, where the resource pool that does not need to be filled includes a second resource pool that does not need to be filled, and if the resource pool set to be filled includes a resource pool that does not need to be filled that does not satisfy the resource filling requirement, the resource pool that does not need to be filled is removed, so as to obtain a first remaining resource pool set to be filled, including:
step a10, calculating a first remaining resource average of the first remaining resource number of each first resource pool to be filled in the resource pool set to be filled.
In this embodiment, the first remaining resources of each first to-be-filled resource pool in the to-be-filled resource pool set are different, for example, the first remaining resource of the to-be-filled resource pool a is 1, the first remaining resource of the to-be-filled resource pool b is 10, and before determining that the resource pool in the to-be-filled resource pool set does not need to be filled, the first remaining resource average number of the first remaining resources of each first to-be-filled resource pool in the to-be-filled resource pool set needs to be calculated.
It is to be understood that the first average number of remaining resources corresponds to a sum of the first number of remaining resources of the respective first pools of resources to be filled. For example, the number of the first to-be-filled resource pools in the to-be-filled resource pool set is n, each first to-be-filled resource pool is P1, P2, … …, and Pn, and accordingly, the number of the first remaining resources corresponding to each first to-be-filled resource pool is C1, C2, … …, and Cn, that is, the average number of the first remaining resources is (C1+ C2+ … … + Cn)/n.
Step A20, if each first resource pool to be filled contains a second resource pool not to be filled, in which the number of first remaining resources is greater than the average number of the first remaining resources, the second resource pool not to be filled is eliminated, and a second updated resource pool set to be filled is obtained.
In this embodiment, if each first resource pool to be filled contains a second resource pool not to be filled, where the number of first remaining resources is greater than the average number of first remaining resources, the second resource pool not to be filled is rejected, for example, C1 is greater than (C1+ C2+ … … + Cn)/n, P1 is rejected, and a second updated resource pool set to be filled is obtained; and if the first resource pool to be filled does not contain a second resource pool which does not need to be filled and has the first remaining resource number larger than the first remaining resource average number, taking the resource pool set to be filled as a second updated resource pool set to be filled.
Step A30, calculating the sum of the third remaining resource number of the second updated resource pool set to be filled and the total number of the fillable resources, to obtain the total number of the filled resources;
step A40, calculating a first quotient between the total number of resources after filling and the number of resource pools of the second updated resource pool set to be filled, to obtain an average number of total resources after filling;
step a50, calculating a third remaining resource average of the third remaining resource number of the second updated resource pool set to be filled.
In this embodiment, first, a sum of a third remaining resource number and a total fillable resource number of the resource pool set to be filled after the second update is calculated to obtain a total filled resource number, for example, the third remaining resource number is C2, C3, … …, and Cn, respectively, and the total filled resource number is C2+ C3+ … … + Cn + T; secondly, calculating a first quotient between the total number of the filled resources and the number of the resource pools of the second updated resource pool set to be filled to obtain the average number of the filled total resources, namely (C2+ C3+ … … + Cn + T)/(n-1); thereafter, a third remaining resource average of a third remaining number of resources of the second updated set of resource pools to be filled, i.e., (C2+ C3+ … … + Cn)/(n-1), is calculated.
Step a60, if the total resource average number after filling is less than the third remaining resource average number, taking the second updated resource pool set to be filled as the resource pool set to be filled, and returning to the step of calculating the first remaining resource average number of each first resource pool to be filled in the resource pool set to be filled until the total resource average number after filling is greater than or equal to the third remaining resource average number, and taking the second updated resource pool set to be filled as the first remaining resource pool set to be filled.
In this embodiment, if the total resource average number after filling is less than the third remaining resource average number, taking the second updated resource pool set to be filled as the resource pool set to be filled, and entering a cycle body, that is, returning to the step of calculating the first remaining resource average number of each first resource pool to be filled in the resource pool set to be filled until the total resource average number after filling is greater than or equal to the third remaining resource average number, and then taking the second updated resource pool set to be filled as the first remaining resource pool set to be filled; and if the average number of the total resources after filling is greater than or equal to the average number of the third residual resources, directly taking the resource pool set to be filled after the second updating as the first resource pool set to be filled without entering a cycle body.
After obtaining the first remaining resource pool set to be filled, the calculating the number of resources to be filled corresponding to the first remaining resource pool set to be filled and the total number of resources to be filled includes:
and i, acquiring the average number of the fourth residual resources of the first residual resource pool set to be filled.
In this embodiment, in the above cyclic elimination process, the second non-filled resource pool is eliminated in the last elimination process before the end of the cycle, and it can be understood that the second non-filled resource pool eliminated in the last elimination process is a part of the resource pool eliminated in the whole cyclic elimination process, but after the second non-filled resource pool is eliminated in the last elimination process, the resource pool in the first remaining resource pool set to be filled is obtained after all the second non-filled resource pools in the cyclic process are eliminated, and the fourth remaining resource average number of the first remaining resource pool set to be filled is obtained.
Step j, calculating the difference value of the number of the resources to be filled between the fourth remaining resource average number and the fourth remaining resource number, wherein the fourth remaining resource number is the remaining resource number of each third resource pool to be filled in the first remaining resource pool set to be filled.
In this embodiment, a difference between the fourth remaining resource average and a fourth remaining resource number is calculated, where the fourth remaining resource number is a remaining resource number of each third resource pool to be filled in the first remaining resource pool set.
And k, after each third resource pool to be filled is filled through the total fillable resource number, if the number of the remaining fillable resources is greater than zero, adding the second resource pool which does not need to be filled to the first resource pool set to be filled, and returning to the step of obtaining the fourth remaining resource average number of the first resource pool set to be filled until a preset cycle end condition is met.
In this embodiment, after each third to-be-filled resource pool is filled with the total number of fillable resources, if the number of remaining fillable resources is greater than zero, the number of the fillable resources is still remained after filling each third to-be-filled resource pool in the first remaining to-be-filled resource pool set, the third resource pool to be filled can be continuously filled through the number of the residual fillable resources, in addition, other resource pools can be added to the first residual resource pool set to be filled, specifically, the other resource pools are second non-filling resource pools which are removed for the last time, namely, when the number of the residual fillable resources is more than zero, adding the second non-fillable resource pool which is removed for the last time, and returning to the step of obtaining the fourth remaining resource average number when the second resource pool needing no filling is removed for the last time to obtain the first remaining resource pool set to be filled until a preset cycle ending condition is met.
The preset cycle end condition includes two conditions, one is that the remaining filling resources are zero, and the other is that all resource pools in the first remaining resource pool set to be filled are filled in the above manner.
It can be understood that after each resource is circularly filled, the number of the filled resources in the resource pool is the fourth remaining resource average number of the last removing process.
And step l, acquiring the difference values of the number of resources to be filled in the circulation process corresponding to the preset circulation ending condition, and respectively calculating the sum of the difference values of the number of resources to be filled corresponding to each fourth resource pool to be filled in the first residual resource pool set to obtain the number of resources to be filled.
In this embodiment, the difference value of the number of resources to be filled in the cycle process corresponding to the preset cycle end condition is obtained, and the sum of the difference values of the number of resources to be filled corresponding to each fourth resource pool to be filled in the first remaining resource pool set to be filled is respectively calculated, so as to obtain the number of resources to be filled. It can be understood that, for different fourth resource pools to be filled, the corresponding number of resources to be filled is different, and therefore, the number of resources to be filled corresponding to each fourth resource pool to be filled needs to be recorded respectively.
Further, respectively calculating a sum of differences of the numbers of resources to be filled corresponding to each fourth resource pool to be filled in the first remaining resource pool set to be filled to obtain the number of resources to be filled, including:
step l1, after filling the fourth resource pool to be filled, if the number of the remaining fillable resources is greater than zero, calculating a second quotient between the number of the remaining fillable resources and the number of the resource pools of the fourth resource pool to be filled;
step l2, eliminating the resource pool with the number of the filled resources being greater than the second quotient in the fourth resource pool to be filled, and obtaining a second remaining resource pool set to be filled;
step l3, calculating a third quotient of the number of the remaining fillable resources and the second remaining to-be-filled resource pool set;
and step l4, adding the third quotient to the sum of the difference values of the resource numbers to be filled respectively to obtain the resource number to be filled.
In this embodiment, for the case that the preset cycle end condition is that all resource pools in the first set of the resource pools to be filled are filled in the above manner, after the fourth resource pool to be filled is filled, if the number of the remaining fillable resources is greater than zero, resource filling may be further performed on the fourth resource pool to be filled by using the number of the remaining fillable resources, specifically, a second quotient between the number of the remaining fillable resources and the number of the resource pools of the fourth resource pool to be filled is calculated; eliminating resource pools, the number of which is greater than the second quotient, in the fourth resource pool to be filled, namely avoiding resource filling for resource pools which do not need to be filled, and obtaining a second residual resource pool set to be filled; then calculating a third quotient of the number of the remaining fillable resources and the second remaining resource pool set to be filled, and taking the third quotient as the number of resources for filling each resource pool in the second remaining resource pool set to be filled; and finally, respectively adding a third quotient to the sum of the difference values of the resource numbers to be filled, namely, respectively adding the resource number corresponding to the third quotient of each resource pool in the second remaining resource pool set to be filled into the resource number after the resources are distributed through the cyclic process, so as to obtain the resource number to be filled.
It will be appreciated that by calculating the third quotient to achieve uniform allocation, the balance of resource allocation can be further ensured.
And after the third surplus resource pool set to be filled is filled by the third quotient, if the resource still has surplus, filling the resource into the resource pool with the maximum resource consumption rate.
In this embodiment, the second resource pool not to be filled, where the number of the first remaining resources is greater than the average number of the first remaining resources, is removed, so that the resource pool not to be filled in the resource pool set to be filled after the second update is not filled with resources, that is, the resources in the resource pool not to be filled are prevented from being filled, and thus the utilization rate of the resources in the resource pool is improved.
In addition, referring to fig. 3, the present application further provides a resource pool resource filling apparatus, including:
an obtaining module 10, configured to obtain a set of resource pools to be filled and a total number of fillable resources;
a removing module 20, configured to remove a non-filling resource pool if the to-be-filled resource pool set contains a non-filling resource pool that does not meet the resource filling requirement, so as to obtain a first remaining to-be-filled resource pool set;
a calculating module 30, configured to calculate a number of resources to be filled corresponding to the first remaining resource pool set to be filled and the total number of resources to be filled;
and a filling module 40, configured to fill the resource pool to be filled corresponding to the first remaining resource pool set to be filled based on the number of resources to be filled.
Optionally, the culling module 20 is configured to:
calculating a first residual resource average number of first residual resources of each first resource pool to be filled in the resource pool set to be filled;
calculating the average number of the first resources to be filled based on the total number of the fillable resources and the number of the resource pools corresponding to the resource pool set to be filled;
calculating the sum of the first remaining resource average and the first to-be-filled resource average to obtain a first filled resource average;
and if the first resource pool to be filled contains a first resource pool not requiring filling, the first resource pool not requiring filling is rejected, and a first resource pool set to be filled is obtained.
Optionally, the culling module 20 is further configured to:
if each first resource pool to be filled contains a first resource pool not to be filled, the first resource pool not to be filled is rejected, and a first updated resource pool set to be filled is obtained;
and taking the first updated resource pool set to be filled as the resource pool set to be filled, returning to the step of calculating the first residual resource average number of the first residual resource of each first resource pool to be filled in the resource pool set to be filled until each first resource pool to be filled does not contain a first resource pool which does not need to be filled and the first residual resource number of which is greater than the filled resource average number, and taking the first updated resource pool set to be filled as the first resource pool set to be filled.
Optionally, the calculation module 30 is configured to:
calculating a second remaining resource average number of second remaining resources of each second resource pool to be filled in the first remaining resource pool set to be filled;
calculating a second average number of resources to be filled between the total number of fillable resources and the number of resource pools corresponding to the first remaining resource pool set to be filled;
calculating the sum of the second remaining resource average and the second to-be-filled resource average to obtain a second filled resource average;
and respectively calculating the difference between the average number of the second filled resources and each second residual resource number to obtain the number of the resources to be filled.
Optionally, the culling module 20 is further configured to:
calculating a first residual resource average number of first residual resources of each first resource pool to be filled in the resource pool set to be filled;
if each first resource pool to be filled contains a second resource pool not required to be filled, the number of first residual resources of which is greater than the average number of the first residual resources, the second resource pool not required to be filled is removed, and a second updated resource pool set to be filled is obtained;
calculating the sum of the third remaining resource number of the second updated resource pool set to be filled and the total number of the fillable resources to obtain the total number of the filled resources;
calculating a first quotient between the total number of the filled resources and the number of the resource pools of the second updated resource pool set to be filled to obtain an average number of the filled total resources;
calculating a third remaining resource average number of a third remaining resource number of the second updated resource pool set to be filled;
and if the total resource average number after filling is smaller than the third remaining resource average number, taking the second updated resource pool set to be filled as the resource pool set to be filled, returning to the step of calculating the first remaining resource average number of each first resource pool to be filled in the resource pool set to be filled until the total resource average number after filling is larger than or equal to the third remaining resource average number, and taking the second updated resource pool set to be filled as the first remaining resource pool set to be filled.
Optionally, the calculation module 30 is further configured to:
acquiring a fourth remaining resource average number of the first remaining resource pool set to be filled;
calculating a difference value of the number of resources to be filled between the fourth average number of remaining resources and a fourth number of remaining resources, wherein the fourth number of remaining resources is the number of remaining resources of each third resource pool to be filled in the first set of resource pools to be filled;
after each third resource pool to be filled is filled through the total number of the fillable resources, if the number of the remaining fillable resources is greater than zero, adding the second resource pool which does not need to be filled to the first remaining resource pool set to be filled, and returning to the step of obtaining the fourth remaining resource average number of the first remaining resource pool set to be filled until a preset cycle end condition is met;
and acquiring the difference value of the number of resources to be filled in the circulation process corresponding to the preset circulation ending condition, and respectively calculating the sum of the difference values of the number of resources to be filled corresponding to each fourth resource pool to be filled in the first residual resource pool set to obtain the number of resources to be filled.
Optionally, the computing module is further configured to:
after the fourth resource pool to be filled is filled, if the number of the remaining fillable resources is greater than zero, calculating a second quotient between the number of the remaining fillable resources and the number of the resource pools of the fourth resource pool to be filled;
eliminating resource pools, the number of which is greater than the second quotient, in the fourth resource pool to be filled to obtain a second remaining resource pool set to be filled;
calculating a third quotient of the number of the residual fillable resources and the second residual resource pool set to be filled;
and adding the third quotient to the sum of the difference values of the resource numbers to be filled respectively to obtain the number of resources to be filled. .
The specific implementation of the resource pool resource filling apparatus of the present application is substantially the same as the embodiments of the resource pool resource filling method, and is not described herein again.
In addition, the application also provides resource pool resource filling equipment. As shown in fig. 4, fig. 4 is a schematic structural diagram of a hardware operating environment according to an embodiment of the present application.
It should be noted that fig. 4 is a schematic structural diagram of a hardware operating environment of a resource pool resource filling device.
As shown in fig. 4, the resource pool resource filling apparatus may include: a processor 1001, such as a CPU, a memory 1005, a user interface 1003, a network interface 1004, a communication bus 1002. Wherein a communication bus 1002 is used to enable connective communication between these components. The user interface 1003 may include a Display screen (Display), an input unit such as a Keyboard (Keyboard), and the optional user interface 1003 may also include a standard wired interface, a wireless interface. The network interface 1004 may optionally include a standard wired interface, a wireless interface (e.g., WI-FI interface). The memory 1005 may be a high-speed RAM memory or a non-volatile memory (e.g., a magnetic disk memory). The memory 1005 may alternatively be a storage device separate from the processor 1001.
Optionally, the resource pool resource filling device may further include RF (Radio Frequency) circuits, sensors, audio circuits, WiFi modules, and the like.
Those skilled in the art will appreciate that the resource pool resource populating device structure shown in FIG. 4 does not constitute a limitation of a resource pool resource populating device and may include more or fewer components than shown, or some components in combination, or a different arrangement of components.
As shown in fig. 4, a memory 1005, which is a kind of computer storage medium, may include therein an operating system, a network communication module, a user interface module, and a resource pool resource filling program. The operating system is a program for managing and controlling the hardware and software resources of the resource pool resource filling device, and supports the running of the resource pool resource filling program and other software or programs.
In the resource pool resource filling apparatus shown in fig. 4, the user interface 1003 is mainly used for connecting a terminal and performing data communication with the terminal, such as receiving user signaling data sent by the terminal; the network interface 1004 is mainly used for the background server and performs data communication with the background server; the processor 1001 may be configured to invoke a resource pool resource filling program stored in the memory 1005 and perform the steps of the resource pool resource filling method described above.
The specific implementation of the resource pool resource filling device in the present application is substantially the same as the embodiments of the resource pool resource filling method, and is not described herein again.
In addition, an embodiment of the present application further provides a computer-readable storage medium, where a resource pool resource filling program is stored on the computer-readable storage medium, and when being executed by a processor, the resource pool resource filling program implements the steps of the resource pool resource filling method described above.
The specific implementation of the computer-readable storage medium of the present application is substantially the same as the embodiments of the resource pool resource filling method, and is not described herein again.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
The above-mentioned serial numbers of the embodiments of the present application are merely for description and do not represent the merits of the embodiments.
Through the above description of the embodiments, those skilled in the art will clearly understand that the method of the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but in many cases, the former is a better implementation manner. Based on such understanding, the technical solutions of the present application may be embodied in the form of a software product, which is stored in a storage medium (e.g., ROM/RAM, magnetic disk, optical disk) and includes instructions for enabling a terminal device (e.g., a mobile phone, a computer, a server, a device, or a network device) to execute the method according to the embodiments of the present application.
The above description is only a preferred embodiment of the present application, and not intended to limit the scope of the present application, and all modifications of equivalent structures and equivalent processes, which are made by the contents of the specification and the drawings of the present application, or which are directly or indirectly applied to other related technical fields, are included in the scope of the present application.
Claims (10)
1. A resource pool resource filling method is characterized by comprising the following steps:
acquiring a resource pool set to be filled and the total number of the fillable resources;
if the resource pool set to be filled contains a resource pool which does not meet the resource filling requirement and does not need to be filled, rejecting the resource pool which does not need to be filled to obtain a first residual resource pool set to be filled;
calculating the corresponding filling resource number corresponding to the first remaining resource pool set to be filled and the total filling resource number;
and filling the resource pool to be filled corresponding to the first residual resource pool set to be filled based on the number of the resources to be filled.
2. The method for filling resource pools according to claim 1, wherein the resource pools that do not need to be filled include a first resource pool that does not need to be filled, and if the resource pool set to be filled includes a resource pool that does not need to be filled and does not meet the resource filling requirement, the resource pool that does not need to be filled is removed to obtain a first remaining resource pool set to be filled, including:
calculating a first residual resource average number of first residual resources of each first resource pool to be filled in the resource pool set to be filled;
calculating the average number of the first resources to be filled based on the total number of the fillable resources and the number of the resource pools corresponding to the resource pool set to be filled;
calculating the sum of the first remaining resource average and the first to-be-filled resource average to obtain a first filled resource average;
and if the first resource pool to be filled contains a first resource pool not requiring filling, the first resource pool not requiring filling is rejected, and a first resource pool set to be filled is obtained.
3. The method for resource pool resource filling according to claim 2, wherein if each of the first to-be-filled resource pools contains a first non-filled resource pool whose first remaining resource number is greater than the first filled average number of resources, then eliminating the first non-filled resource pool to obtain a first remaining to-be-filled resource pool set, the method comprises:
if each first resource pool to be filled contains a first resource pool not to be filled, the first resource pool not to be filled is rejected, and a first updated resource pool set to be filled is obtained;
and taking the first updated resource pool set to be filled as the resource pool set to be filled, returning to the step of calculating the first residual resource average number of the first residual resource of each first resource pool to be filled in the resource pool set to be filled until each first resource pool to be filled does not contain a first resource pool which does not need to be filled and the first residual resource number of which is greater than the filled resource average number, and taking the first updated resource pool set to be filled as the first resource pool set to be filled.
4. The method for filling resource pool resources according to claim 1, wherein the calculating the number of resources to be filled corresponding to the first remaining resource pool set to be filled and the total number of resources to be filled comprises:
calculating a second remaining resource average number of second remaining resources of each second resource pool to be filled in the first remaining resource pool set to be filled;
calculating a second average number of resources to be filled between the total number of fillable resources and the number of resource pools corresponding to the first remaining resource pool set to be filled;
calculating the sum of the second remaining resource average and the second to-be-filled resource average to obtain a second filled resource average;
and respectively calculating the difference between the average number of the second filled resources and each second residual resource number to obtain the number of the resources to be filled.
5. The resource pool resource filling method according to claim 1, wherein the resource pool not to be filled includes a second resource pool not to be filled, and if the resource pool to be filled includes a resource pool not to be filled that does not satisfy the resource filling requirement, the resource pool not to be filled is removed to obtain a first remaining resource pool set to be filled, including:
calculating a first residual resource average number of first residual resources of each first resource pool to be filled in the resource pool set to be filled;
if each first resource pool to be filled contains a second resource pool not required to be filled, the number of first residual resources of which is greater than the average number of the first residual resources, the second resource pool not required to be filled is removed, and a second updated resource pool set to be filled is obtained;
calculating the sum of the third remaining resource number of the second updated resource pool set to be filled and the total number of the fillable resources to obtain the total number of the filled resources;
calculating a first quotient between the total number of the filled resources and the number of the resource pools of the second updated resource pool set to be filled to obtain an average number of the filled total resources;
calculating a third remaining resource average number of a third remaining resource number of the second updated resource pool set to be filled;
and if the total resource average number after filling is smaller than the third remaining resource average number, taking the second updated resource pool set to be filled as the resource pool set to be filled, returning to the step of calculating the first remaining resource average number of each first resource pool to be filled in the resource pool set to be filled until the total resource average number after filling is larger than or equal to the third remaining resource average number, and taking the second updated resource pool set to be filled as the first remaining resource pool set to be filled.
6. The method for filling resource pool resources according to claim 5, wherein the calculating the number of resources to be filled corresponding to the first remaining resource pool set to be filled and the total number of resources to be filled comprises:
acquiring a fourth remaining resource average number of the first remaining resource pool set to be filled;
calculating a difference value of the number of resources to be filled between the fourth average number of remaining resources and a fourth number of remaining resources, wherein the fourth number of remaining resources is the number of remaining resources of each third resource pool to be filled in the first set of resource pools to be filled;
after each third resource pool to be filled is filled through the total number of the fillable resources, if the number of the remaining fillable resources is greater than zero, adding the second resource pool which does not need to be filled to the first remaining resource pool set to be filled, and returning to the step of obtaining the fourth remaining resource average number of the first remaining resource pool set to be filled until a preset cycle end condition is met;
and acquiring the difference value of the number of resources to be filled in the circulation process corresponding to the preset circulation ending condition, and respectively calculating the sum of the difference values of the number of resources to be filled corresponding to each fourth resource pool to be filled in the first residual resource pool set to obtain the number of resources to be filled.
7. The method for filling resource pools according to claim 6, wherein the calculating a sum of differences between numbers of resources to be filled corresponding to fourth resource pools to be filled in the first set of resource pools to be filled to obtain the number of resources to be filled respectively comprises:
after the fourth resource pool to be filled is filled, if the number of the remaining fillable resources is greater than zero, calculating a second quotient between the number of the remaining fillable resources and the number of the resource pools of the fourth resource pool to be filled;
eliminating resource pools, the number of which is greater than the second quotient, in the fourth resource pool to be filled to obtain a second remaining resource pool set to be filled;
calculating a third quotient of the number of the residual fillable resources and the second residual resource pool set to be filled;
and adding the third quotient to the sum of the difference values of the resource numbers to be filled respectively to obtain the number of resources to be filled.
8. A resource pool resource filling apparatus, comprising:
the acquisition module is used for acquiring a resource pool set to be filled and the total number of the fillable resources;
the removing module is used for removing the resource pool which does not need to be filled if the resource pool set to be filled contains the resource pool which does not need to be filled and does not meet the resource filling requirement, so as to obtain a first residual resource pool set to be filled;
the computing module is used for computing the corresponding filling resource number of the first remaining resource pool set to be filled and the total fillable resource number;
and the filling module is used for filling the resource pool to be filled corresponding to the first remaining resource pool set to be filled based on the number of the resources to be filled.
9. A resource pool resource filling apparatus, characterized in that the resource pool resource filling apparatus comprises a memory, a processor and a resource pool resource filling program stored on the memory and executable on the processor, the resource pool resource filling program when executed by the processor implementing the steps of the resource pool resource filling method according to any one of claims 1 to 7.
10. A computer-readable storage medium, having stored thereon a resource pool resource filling program, which when executed by a processor, performs the steps of the resource pool resource filling method according to any one of claims 1 to 7.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110702135.2A CN113360288A (en) | 2021-06-23 | 2021-06-23 | Resource pool resource filling method, device, equipment and readable storage medium |
| PCT/CN2021/134318 WO2022267344A1 (en) | 2021-06-23 | 2021-11-30 | Resource filling method, apparatus, and device for resource pools, and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110702135.2A CN113360288A (en) | 2021-06-23 | 2021-06-23 | Resource pool resource filling method, device, equipment and readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113360288A true CN113360288A (en) | 2021-09-07 |
Family
ID=77536104
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110702135.2A Pending CN113360288A (en) | 2021-06-23 | 2021-06-23 | Resource pool resource filling method, device, equipment and readable storage medium |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN113360288A (en) |
| WO (1) | WO2022267344A1 (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2022267344A1 (en) * | 2021-06-23 | 2022-12-29 | 深圳前海微众银行股份有限公司 | Resource filling method, apparatus, and device for resource pools, and readable storage medium |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070083648A1 (en) * | 2005-10-12 | 2007-04-12 | Addleman Mark J | Resource pool monitor |
| WO2017166654A1 (en) * | 2016-03-31 | 2017-10-05 | 乐视控股（北京）有限公司 | Resource management method and device |
| CN110231992A (en) * | 2019-06-06 | 2019-09-13 | 深圳前海微众银行股份有限公司 | Distributed resource allocation method, device, equipment and readable storage medium storing program for executing |
| CN111858034A (en) * | 2020-06-29 | 2020-10-30 | 苏州浪潮智能科技有限公司 | Resource management method, system, device and medium |
| CN111880914A (en) * | 2020-07-20 | 2020-11-03 | 北京百度网讯科技有限公司 | Resource scheduling method, resource scheduling apparatus, electronic device, and storage medium |
| CN112698943A (en) * | 2020-12-29 | 2021-04-23 | 北京顺达同行科技有限公司 | Resource allocation method, device, computer equipment and storage medium |
| CN112862293A (en) * | 2021-02-01 | 2021-05-28 | 北京三快在线科技有限公司 | Resource allocation method, device, storage medium and electronic equipment |
| CN112905342A (en) * | 2021-02-07 | 2021-06-04 | 广州虎牙科技有限公司 | Resource scheduling method, device, equipment and computer readable storage medium |
| CN112948111A (en) * | 2021-02-26 | 2021-06-11 | 北京奇艺世纪科技有限公司 | Task allocation method, device, equipment and computer readable medium |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9612878B2 (en) * | 2014-03-31 | 2017-04-04 | International Business Machines Corporation | Resource allocation in job scheduling environment |
| CN105404542A (en) * | 2015-08-14 | 2016-03-16 | 国家超级计算深圳中心(深圳云计算中心) | Cloud computing system and method for running high-performance computation in same |
| CN110928649A (en) * | 2018-09-19 | 2020-03-27 | 北京国双科技有限公司 | Resource scheduling method and device |
| CN113360288A (en) * | 2021-06-23 | 2021-09-07 | 深圳前海微众银行股份有限公司 | Resource pool resource filling method, device, equipment and readable storage medium |
-
2021
- 2021-06-23 CN CN202110702135.2A patent/CN113360288A/en active Pending
- 2021-11-30 WO PCT/CN2021/134318 patent/WO2022267344A1/en active Application Filing
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070083648A1 (en) * | 2005-10-12 | 2007-04-12 | Addleman Mark J | Resource pool monitor |
| WO2017166654A1 (en) * | 2016-03-31 | 2017-10-05 | 乐视控股（北京）有限公司 | Resource management method and device |
| CN110231992A (en) * | 2019-06-06 | 2019-09-13 | 深圳前海微众银行股份有限公司 | Distributed resource allocation method, device, equipment and readable storage medium storing program for executing |
| CN111858034A (en) * | 2020-06-29 | 2020-10-30 | 苏州浪潮智能科技有限公司 | Resource management method, system, device and medium |
| CN111880914A (en) * | 2020-07-20 | 2020-11-03 | 北京百度网讯科技有限公司 | Resource scheduling method, resource scheduling apparatus, electronic device, and storage medium |
| CN112698943A (en) * | 2020-12-29 | 2021-04-23 | 北京顺达同行科技有限公司 | Resource allocation method, device, computer equipment and storage medium |
| CN112862293A (en) * | 2021-02-01 | 2021-05-28 | 北京三快在线科技有限公司 | Resource allocation method, device, storage medium and electronic equipment |
| CN112905342A (en) * | 2021-02-07 | 2021-06-04 | 广州虎牙科技有限公司 | Resource scheduling method, device, equipment and computer readable storage medium |
| CN112948111A (en) * | 2021-02-26 | 2021-06-11 | 北京奇艺世纪科技有限公司 | Task allocation method, device, equipment and computer readable medium |
Non-Patent Citations (3)
| Title |
|---|
| LIU JUN; WANG ENZE; QIAO JIANZHONG; LIN SHUKUAN；: "Inframarginal analysis based resource allocation method in distributed computing", COMPUTER ENGINEERING AND APPLICATIONS, 1 June 2010 (2010-06-01), pages 19 - 22 * |
| 余飞;: "私有云资源池管理流程及资源管理办法研究", 电信技术, no. 08, 25 August 2017 (2017-08-25), pages 84 - 88 * |
| 张丹闯: "分布式环境下基于整体最优的资源分配研究", 中国优秀硕士学位论文全文数据库信息科技辑, 15 August 2013 (2013-08-15), pages 138 - 491 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2022267344A1 (en) * | 2021-06-23 | 2022-12-29 | 深圳前海微众银行股份有限公司 | Resource filling method, apparatus, and device for resource pools, and readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2022267344A1 (en) | 2022-12-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107688495B (en) | Method and apparatus for scheduling processors | |
| CN111966500A (en) | Resource scheduling method and device, electronic equipment and storage medium | |
| CN114625536B (en) | Video memory allocation method, device, medium and electronic equipment | |
| CN113765820A (en) | Token bucket-based current limiting method, token bucket-based current limiting device, token bucket-based computing equipment and token bucket-based current limiting medium | |
| CN113360288A (en) | Resource pool resource filling method, device, equipment and readable storage medium | |
| CN116166395A (en) | Task scheduling method, device, medium and electronic equipment | |
| CN115509951A (en) | Memory recovery method and device, electronic equipment and storage medium | |
| CN115617511A (en) | Resource data processing method and device, electronic equipment and storage medium | |
| CN105847319A (en) | Mobile terminal network request method and system | |
| CN111190719A (en) | Method, device, medium and electronic equipment for optimizing cluster resource allocation | |
| CN113535398A (en) | Resource allocation adjusting method and device, electronic equipment and readable storage medium | |
| US9390029B2 (en) | Dynamic management of random access memory | |
| CN111176641A (en) | Flow node execution method, device, medium and electronic equipment | |
| Moens et al. | Allocating resources for customizable multi-tenant applications in clouds using dynamic feature placement | |
| CN113377295B (en) | Data storage and reading method, device and equipment for multi-producer single-consumer | |
| CN111694670B (en) | Resource allocation method, apparatus, device and computer readable medium | |
| CN112256436B (en) | Resource allocation method, device, equipment and computer storage medium | |
| CN114996019A (en) | Task allocation method, device, computer equipment, storage medium and program product | |
| CN108228346A (en) | service system and its control method | |
| CN114036180A (en) | Report generation method, device, equipment and storage medium | |
| CN112905223A (en) | Method, device and equipment for generating upgrade package | |
| CN114385342A (en) | Container cloud overload protection method and device, computer device and storage medium | |
| CN115391042B (en) | Resource allocation method and device, electronic equipment and storage medium | |
| CN113220555B (en) | Method, apparatus, device, medium, and article for processing data | |
| CN115439217A (en) | Method for processing limit data and related device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |