CN108881495B - Resource allocation method, device, computer equipment and storage medium - Google Patents

Resource allocation method, device, computer equipment and storage medium Download PDF

Info

Publication number
CN108881495B
CN108881495B CN201810918371.6A CN201810918371A CN108881495B CN 108881495 B CN108881495 B CN 108881495B CN 201810918371 A CN201810918371 A CN 201810918371A CN 108881495 B CN108881495 B CN 108881495B
Authority
CN
China
Prior art keywords
current task
resources
resource
utilization rate
task
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.)
Active
Application number
CN201810918371.6A
Other languages
Chinese (zh)
Other versions
CN108881495A (en
Inventor
韩丙卫
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Ping An Property and Casualty Insurance Company of China Ltd
Original Assignee
Ping An Property and Casualty Insurance Company of China Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Ping An Property and Casualty Insurance Company of China Ltd filed Critical Ping An Property and Casualty Insurance Company of China Ltd
Priority to CN201810918371.6A priority Critical patent/CN108881495B/en
Publication of CN108881495A publication Critical patent/CN108881495A/en
Application granted granted Critical
Publication of CN108881495B publication Critical patent/CN108881495B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/104Peer-to-peer [P2P] networks
    • H04L67/1074Peer-to-peer [P2P] networks for supporting data block transmission mechanisms
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00Arrangements for monitoring or testing data switching networks
    • H04L43/08Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0876Network utilisation, e.g. volume of load or congestion level
    • H04L43/0882Utilisation of link capacity
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00Arrangements for monitoring or testing data switching networks
    • H04L43/16Threshold monitoring
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • H04L47/80Actions related to the user profile or the type of traffic
    • H04L47/805QOS or priority aware
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/104Peer-to-peer [P2P] networks
    • H04L67/1044Group management mechanisms 

Abstract

The embodiment of the invention provides a resource allocation method, a resource allocation device, computer equipment and a storage medium. Wherein the method comprises the following steps: if a task created by a user is received, taking the task as a current task, and acquiring resources from a server cluster according to a preset resource configuration strategy to distribute the resources to the current task; acquiring the utilization rate of the current task on resources; if the resource utilization rate of the current task exceeds a preset first utilization rate threshold value, determining a corresponding resource increment as a target resource increment according to the priority level of the current task; and increasing the resources allocated to the current task in quantity which is the target resource increase amount. According to the embodiment of the invention, the utilization rate data of the tasks on the resources is monitored in real time, and when the utilization rate of the tasks on the resources exceeds the preset first utilization rate threshold, the resources distributed to the tasks are allocated in a coordinated manner, so that the tasks can be ensured to run normally, and the reasonable distribution of the server resources is realized.

Description

Resource allocation method, device, computer equipment and storage medium
Technical Field
The present invention relates to the field of resource allocation technologies, and in particular, to a resource allocation method and apparatus, a computer device, and a storage medium.
Background
At present, most business or research and development departments of an enterprise deploy their own servers, and resources of the servers are required to execute tasks in the operation or research and development processes. The task may be embodied as a model created by the user, the model requiring resources of the server to be used for its operation.
For some departments, when the resources of the server are insufficient, a new machine needs to be purchased again, the process is complex, the time consumption is long, and the efficiency is low. For some departments, the computing resources of the server are sufficient, but are difficult to share for other departments, so that the resources are vacant and wasted.
Disclosure of Invention
The embodiment of the invention provides a resource allocation method, a resource allocation device, computer equipment and a storage medium, and aims to solve the problem that server resources are unreasonably allocated in an enterprise at present.
In a first aspect, an embodiment of the present invention provides a resource allocation method, which includes:
if a task created by a user is received, taking the task as a current task, and acquiring resources from a server cluster according to a preset resource configuration strategy to distribute the resources to the current task;
acquiring the utilization rate of the current task on resources;
if the utilization rate of the current task to the resources exceeds a preset first utilization rate threshold value, determining a corresponding resource increment as a target resource increment according to the priority level of the current task; and
and increasing the resources with the allocation quantity being the target resource increasing quantity to the current task.
In a second aspect, an embodiment of the present invention further provides a resource allocation apparatus, which includes a unit configured to perform the foregoing method.
In a third aspect, an embodiment of the present invention further provides a computer device, which includes a memory and a processor, where the memory stores a computer program, and the processor implements the above method when executing the computer program.
In a fourth aspect, an embodiment of the present invention further provides a computer-readable storage medium, where a computer program is stored, and the computer program may implement the method when executed by a processor.
The embodiment of the invention provides a resource allocation method, a resource allocation device, computer equipment and a storage medium. Wherein the method comprises the following steps: if a task created by a user is received, taking the task as a current task, and acquiring resources from a server cluster according to a preset resource configuration strategy to distribute the resources to the current task; acquiring the utilization rate of the current task to resources; if the resource utilization rate of the current task exceeds a preset first utilization rate threshold value, determining a corresponding resource increment as a target resource increment according to the priority level of the current task; and increasing the resources which are allocated to the current task and the number of which is the target resource increase amount. According to the embodiment of the invention, the plurality of servers are established into the server cluster, so that more reasonable management and resource distribution can be realized. By monitoring the utilization rate of the tasks on the resources in real time, when the utilization rate of the tasks on the resources exceeds a preset first utilization rate threshold value, the resources allocated to the tasks are increased, so that the tasks can normally run, and the reasonable allocation of the server resources is realized.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the description below are some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on the drawings without creative efforts.
Fig. 1 is a schematic view of an application scenario of a resource allocation method according to an embodiment of the present invention;
fig. 2 is a flowchart illustrating a resource allocation method according to an embodiment of the present invention;
fig. 3 is a sub-flow diagram of a resource allocation method according to an embodiment of the present invention;
fig. 4 is a sub-flow diagram of a resource allocation method according to an embodiment of the present invention;
fig. 5 is a sub-flow diagram of a resource allocation method according to an embodiment of the present invention;
fig. 6 is a flowchart illustrating a resource allocation method according to another embodiment of the present invention;
fig. 7 is a sub-flow diagram of a resource allocation method according to an embodiment of the present invention;
fig. 8 is a schematic block diagram of a resource allocation apparatus according to an embodiment of the present invention;
fig. 9 is a schematic block diagram of an adding unit of a resource allocation apparatus according to an embodiment of the present invention;
fig. 10 is a schematic block diagram of a third allocation unit of a resource allocation apparatus according to an embodiment of the present invention;
fig. 11 is a schematic block diagram of a fourth allocation unit of a resource allocation apparatus according to an embodiment of the present invention;
fig. 12 is a schematic block diagram of a first determining unit of a resource allocation apparatus according to an embodiment of the present invention;
fig. 13 is a schematic block diagram of a resource allocation apparatus according to another embodiment of the present invention;
fig. 14 is a schematic block diagram of a first recovery unit of a resource allocation apparatus according to an embodiment of the present invention; and
FIG. 15 is a schematic block diagram of a computer apparatus provided by an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, not all, embodiments of the present invention. All other embodiments, which can be obtained by a person skilled in the art without making any creative effort based on the embodiments in the present invention, belong to the protection scope of the present invention.
It will be understood that the terms "comprises" and/or "comprising," when used in this specification and the appended claims, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
It is also to be understood that the terminology used in the description of the invention herein is for the purpose of describing particular embodiments only and is not intended to be limiting. As used in this specification and the appended claims, the singular forms "a", "an", and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.
It should be further understood that the term "and/or" as used in this specification and the appended claims refers to any and all possible combinations of one or more of the associated listed items and includes such combinations.
Referring to fig. 1 and fig. 2, fig. 1 is a schematic view of an application scenario of a resource allocation method according to an embodiment of the present invention. Fig. 2 is a schematic flowchart of a resource allocation method according to an embodiment of the present invention.
The resource allocation method is applied to the management server 1, and by applying the resource allocation method, the management server 1 allocates the resources in the server cluster 20 to each client 3 to execute the task. The server cluster 20 is constructed by a plurality of servers 2, and the creation of the server cluster 20 can facilitate reasonable management and resource allocation.
Fig. 2 is a flowchart illustrating a resource allocation method according to an embodiment of the present invention. As shown, the method includes the following steps S1-S4.
And S1, if the task created by the user is received, taking the task as the current task, and acquiring resources from the server cluster according to a preset resource configuration strategy to allocate the resources to the current task.
In specific implementation, a task created by a user is received and the task is taken as a current task. The current task execution needs to use certain resources, so the resources are applied from the server cluster and allocated to the current task.
In the embodiment of the present invention, the preset resource allocation policy is: judging whether a resource application of a user to the current task is received, if the resource application of the user to the current task is not received, the resource allocated to the current task is a preset default value; and if a resource application of the current task by a user is received, determining resources allocated to the current task according to the resource application so as to meet the requirement of the current task.
It should be noted that the server cluster is constructed by a plurality of servers (servers of each service department in the integrated enterprise), and the creation of the server cluster can facilitate reasonable management and resource allocation.
A server cluster refers to a collection of servers that together perform the same service, and appears to a client as if there is only one server. Once the cluster service is installed and running on a server, the server can join the cluster. Clustering operations can reduce the number of single points of failure and achieve high availability of clustered resources.
And S2, acquiring the utilization rate of the current task to the resources.
In specific implementation, the running condition of the current task is monitored in real time, and the utilization rate of the current task to resources is obtained. The resource utilization rate of the current task refers to the percentage of the resources currently used by the current task in the total resources allocated to the current task. If the resource utilization rate of the current task is too high, the operation load of the current task is high, and the possibility of operation errors exists.
And S3, if the resource utilization rate of the current task exceeds a preset first utilization rate threshold, determining a corresponding resource increment as a target resource increment according to the priority level of the current task.
In the embodiment of the invention, the tasks are divided into different priority levels according to the application of the user, and if the high-priority application of the user to the tasks is received, the priority level of the tasks is high priority; if a user application for a task with a medium priority is received, the priority level of the task is the medium priority; and if the user does not apply, the priority level of the task is low.
In specific implementation, if it is detected that the resource utilization rate of the current task exceeds a preset first utilization rate threshold, it indicates that the current task has insufficient resources in the running process, and at this time, the current task may run erroneously or even fail to run. Therefore, in the embodiment of the invention, the corresponding resource increment is determined as the target resource increment according to the priority level of the current task and is correspondingly distributed to the current task, so that the utilization rate of the current task on the resource is lower than the first utilization rate threshold, and the normal operation of the current task is ensured.
It should be noted that the first usage threshold may be set by a person skilled in the art according to practical situations, and the present invention is not limited to this. For example, in one embodiment of the present invention, the first usage threshold is set to 80%.
In the embodiment of the invention, the running of the task with high priority needs to be ensured preferentially, so that when the utilization rate of the task on the resources exceeds the preset first utilization rate threshold value, the higher the priority of the task is, more resources need to be additionally allocated to the task, so as to avoid the situation that the resources are insufficient again in the task.
In one embodiment, according to a formula
Figure BDA0001763622700000051
Determining a target resource increment Q1, wherein R1 is the utilization rate of the current task on the resources, R3 is a first utilization rate threshold value, Q is the total resource amount of the current task, and Y is a priority coefficient; if the priority level of the current task is high, Y is Y1; if the priority level of the current task is the medium priority, the value of Y is Y2; if the priority level of the current task is low, taking the value of Y as Y3; y1 > Y2 > Y3 > 1.
The values of K1, K2 and K3 may be set by those skilled in the art according to actual conditions, and for example, K1 may be 2, K2 may be 1.5, and K3 may be 1.2.
And S4, adding the resources with the allocation quantity being the target resource increment amount to the current task.
In a specific implementation, after the target resource increment is obtained in step S3, the resources whose allocation number is the target resource increment are added to the current task.
In one embodiment, as shown in FIG. 3, the step S4 may include steps S31-S33.
And S31, judging whether the resource residual rate of the server cluster is greater than a preset resource residual rate threshold value.
In specific implementation, the resource surplus rate of the server cluster is monitored in real time, and whether the resource surplus rate of the server cluster is larger than a preset resource surplus rate threshold value or not is judged.
The resource remaining rate of the server cluster refers to the percentage of the resources currently remaining by the server to the total resources of the server. The large resource residual rate of the server cluster indicates that the current residual resources of the server are more abundant, and the load of the server cluster is low. The fact that the resource residual rate of the server cluster is small means that the current residual resources of the server cluster are fewer, and the load of the server cluster is higher.
It should be noted that the resource remaining rate threshold may be set by a person skilled in the art according to actual situations, and the present invention is not limited to this. For example, in one embodiment of the present invention, the resource remaining rate threshold is set to 30%.
And S32, if the judgment result is that the resource surplus rate of the server cluster is greater than the preset resource surplus rate threshold, directly acquiring the number of resources with the target resource increment from the server cluster and distributing the resources to the current task.
In a specific implementation, if the resource remaining rate of the server cluster is greater than the preset resource remaining rate threshold, it is indicated that the current remaining resources of the server cluster are still abundant, and the load of the server cluster is low, so that resources with the quantity equal to the target resource increasing amount can be directly acquired from the server cluster and allocated to the current task, so as to ensure that the current task can normally run.
And S33, if the judgment result is that the resource residual rate of the server cluster is not greater than the preset resource residual rate threshold, recovering resources from other tasks and acquiring resources with the quantity of the target resource increment from the recovered resources to allocate to the current task.
In specific implementation, if the resource remaining rate of the server cluster is not greater than the preset resource remaining rate threshold, it indicates that the current remaining resources of the server cluster are less, and the load of the server cluster is higher, so that resources need to be recovered from other tasks and resources with the quantity as the target resource increment are acquired from the recovered resources and allocated to the current task, so as to ensure that the current task can normally run.
In one embodiment, as shown in FIG. 4, the step S33 may include steps S331-S332.
And S331, acquiring other tasks with the resource utilization rate lower than a preset third utilization rate threshold value as target tasks, wherein the third utilization rate threshold value is smaller than the first utilization rate threshold value.
In the invention, the precondition for recovering resources from other tasks is to ensure that other tasks can normally run. Therefore, the resource utilization rates of other tasks are firstly obtained respectively, and then the tasks with the resource utilization rate lower than a preset third utilization rate threshold value are selected from the other tasks as target tasks. Wherein the third usage threshold is less than the first usage threshold. And if the utilization rate of the task to the resources is lower than the third utilization rate threshold value, indicating that the task has resource surplus in the running process.
It should be noted that, the third usage threshold may be set by a person skilled in the art according to practical situations, and the present invention is not limited to this. For example, in one embodiment, the third usage threshold is set to 60%.
S332, recovering the resources from the target task and acquiring the resources with the quantity being the target resource increment from the recovered resources to distribute to the current task.
In specific implementation, resources are recovered from a target task, and the resources with the quantity of the target resource increment are acquired from the recovered resources and distributed to the current task, so that the task can run normally.
It should be noted that, if there is only one target task, only the resources are recovered from the target task; if there are multiple target tasks, then resources are reclaimed from at least one target task.
It should be noted that, after the resources are recovered from the target task, it is required to ensure that the utilization rate of the resources by the target task is lower than the first utilization rate threshold, so as to ensure that the target task can normally operate.
In one embodiment, as shown in FIG. 5, the step S332 may include steps S3321-S3322.
S3321, the second reference recovery value H2 is determined according to the formula H2 ═ R3-R2.
Wherein, R3 is a first usage threshold, and R2 is the usage of the resource by the target task.
For example, in one embodiment, the first utilization threshold R3 is 80%, the utilization of the resource by the target task R2 is 50%, and the second reference reclamation value H2 is equal to 30%.
S3322, the proportion of resources recovered from the target task a2 is determined according to the formula a2 ═ K2 × H2. Where K2 is the second recovery factor. The proportion of resources reclaimed from the target task A2 is equal to the amount of resources reclaimed from the target task divided by the total amount of resources of the target task.
After the resources are recovered from the target task, it is necessary to ensure that the target task can normally operate, that is, after the resources are recovered from the target task, the resource usage rate of the target task is less than the first usage rate threshold R3, and therefore, the second recovery coefficient K2 needs to satisfy the following formula:
Figure BDA0001763622700000071
is calculated to obtain
Figure BDA0001763622700000072
For example, in one embodiment, the second reference recovery value H2 is 30%, the second recovery factor K2 is 0.7, and the percentage of resources recovered from the target task a2 is 21%.
By applying the technical scheme of the embodiment, a plurality of servers are established into a server cluster, so that resources can be managed and distributed more reasonably. And monitoring the utilization rate of the tasks on the resources in real time, and increasing the resources allocated to the tasks when the utilization rate of the tasks on the resources exceeds a preset first utilization rate threshold value, so that the tasks can normally run.
Fig. 6 is a flowchart illustrating a resource allocation method according to another embodiment of the present invention. As shown in FIG. 4, the resource allocation method of the present embodiment includes steps S61-S68.
And S61, if the task created by the user is received, taking the task as the current task, and acquiring resources from the server cluster according to a preset resource configuration strategy to allocate the resources to the current task.
In specific implementation, a task created by a user is received and the task is taken as a current task. The current task execution needs to use certain resources, so the resources are applied from the server cluster and allocated to the current task.
In the embodiment of the present invention, the preset resource allocation policy is: judging whether a resource application of a user to the current task is received, if the resource application of the user to the current task is not received, the resource allocated to the current task is a preset default value; and if a resource application of the current task by the user is received, determining the resources allocated to the current task according to the resource application so as to meet the requirement of the current task.
It should be noted that, the server cluster is constructed by a plurality of servers (servers of each service department in the integrated enterprise), and the creation of the server cluster can facilitate reasonable management and resource distribution.
Server clustering refers to the process of collecting many servers together to perform the same service, and appearing to a client as if there is only one server. Once the cluster service is installed and running on a server, the server can join the cluster. Clustering operations can reduce the number of single points of failure and achieve high availability of clustered resources.
And S62, acquiring the running state of the current task.
The running state comprises a working state, a pause state and a completion state.
In specific implementation, the running condition of the current task is monitored in real time, and the running state of the current task is obtained. The running state of the current task comprises the following steps: an active state, a suspended state, and a completed state.
The working state refers to that the current task is currently running normally. The suspended state refers to the current task not running. The completion status refers to that the current task has run to completion.
And S63, if the running state of the current task is the working state, acquiring the utilization rate of the current task to the resources.
In specific implementation, the running condition of the current task is monitored in real time, and the utilization rate of the current task to resources is obtained. The resource utilization rate of the current task refers to the percentage of the resources currently used by the current task in the total resources allocated to the current task. If the resource utilization rate of the current task is too high, the operation load of the current task is high, and the possibility of operation errors exists.
And S64, if the utilization rate of the current task to the resources exceeds a preset first utilization rate threshold, determining a corresponding resource increment as a target resource increment according to the priority level of the current task.
In the embodiment of the invention, tasks are divided into different priority levels according to the application of a user, and if a high-priority application of the user to the tasks is received, the priority level of the tasks is high priority; if a user application for a task with a medium priority is received, the priority level of the task is the medium priority; and if the user does not apply, the priority level of the task is low.
In specific implementation, if it is detected that the resource utilization rate of the current task exceeds a preset first utilization rate threshold, it indicates that the current task has insufficient resources in the running process, and at this time, the current task may run erroneously or even fail to run. Therefore, in the embodiment of the invention, the corresponding resource increment is determined as the target resource increment according to the priority level of the current task and is correspondingly distributed to the current task, so that the utilization rate of the current task on the resource is lower than the first utilization rate threshold, and the normal operation of the current task is ensured.
It should be noted that the first usage threshold may be set by a person skilled in the art according to practical situations, and the present invention is not limited to this. For example, in one embodiment of the present invention, the first usage threshold is set to 80%.
In the embodiment of the invention, the running of the task with high priority needs to be ensured preferentially, so that when the utilization rate of the task on the resources exceeds the preset first utilization rate threshold value, the higher the priority of the task is, more resources need to be additionally allocated to the task, so as to avoid the situation that the resources are insufficient again in the task.
And S65, adding the resources with the allocation quantity being the target resource increment amount to the current task.
In a specific implementation, after the target resource increment is obtained in step S3, the resources whose allocation number is the target resource increment are added to the current task.
And S66, if the resource utilization rate of the current task is lower than the preset second utilization rate threshold, recycling part of the resources allocated to the current task, so that the resource utilization rate of the current task is not lower than the preset second utilization rate threshold.
In specific implementation, if it is detected that the resource utilization rate of the current task is lower than the preset second utilization rate threshold, it indicates that the current task has a resource surplus in the running process, and at this time, part of the resources allocated to the current task need to be recovered, so that the resource utilization rate of the current task is not lower than the preset second utilization rate threshold, and waste of resources is avoided.
After resources are recovered from the current task, the utilization rate of the resources by the current task is required to be lower than a first utilization rate threshold value so as to ensure that the current task can normally run.
It should be noted that the second usage threshold may be set by those skilled in the art according to actual situations. For example, it may be set to 40%.
Generally, the resource usage of the current task is between the second usage threshold and the first usage threshold. The resource utilization rate of the current task is too high, and the running load of the current task is large, so that the normal running of the current task is not facilitated. If the resource utilization rate of the current task is too low, the resource is wasted. According to the scheme, the resource utilization rate of the current task can be ensured to be between the second utilization rate threshold and the first utilization rate threshold through the steps, so that the current task can normally run, and the waste of resources is avoided.
Referring to FIG. 7, in one embodiment, the above step S64 includes the following steps S641-S642.
S641, the first reference recovery value H1 is determined according to the formula H1 — R0-R1.
Wherein R0 is the second usage threshold, and R1 is the usage of resources by the current task.
For example, in one embodiment, the second utilization threshold R0 is 40%, the utilization of the resource by the current task R1 is 30%, and the first reference reclamation value H1 is equal to 10%.
S642, the proportion of resources recovered from the current task, a1, is determined according to the formula a1 ═ K1 × H1.
Where K1 is the first recovery factor. The proportion of resources reclaimed from the current task, a1, is equal to the amount of resources reclaimed from the current task divided by the total amount of resources for the current task.
And after the resources are recovered from the current task, the utilization rate of the resources by the current task is not lower than a preset second utilization rate threshold value. That is, after the resources are reclaimed from the current task, the resource utilization rate of the current task is greater than the second utilization rate threshold R0, and therefore, the first reclamation coefficient K1 needs to satisfy the following formula:
Figure BDA0001763622700000101
is calculated to obtain
Figure BDA0001763622700000102
For example, in one embodiment, the first reference reclamation value H1 is 10%, the first reclamation factor K1 is 3, and the percentage of resources reclaimed from the current task a1 is 30%.
S67, if the running state of the current task is a pause state, recovering the resources allocated to the current task;
in specific implementation, if it is detected that the running state of the current task is the suspended state, it is indicated that the current task is not running. At this time, in order to avoid wasting resources, the resources allocated to the current task are reclaimed. And when the current task needs to be restarted, the resources are reallocated to the current task. The vacant resources can be recovered in time through the steps, and the waste of the resources is avoided.
And S68, if the running state of the current task is the completion state, recycling the resources allocated to the current task.
In specific implementation, if the running state of the current task is detected to be the completion state, it indicates that the current task has been run and completed. At this time, in order to avoid wasting resources, the resources allocated to the current task are reclaimed.
Referring to fig. 8, fig. 8 is a schematic block diagram of a resource allocation apparatus according to an embodiment of the present invention. As shown in fig. 8, the present invention further provides a resource allocation apparatus 80 corresponding to the resource allocation method proposed in the above embodiment. The resource allocation apparatus 80 includes a unit for executing the resource allocation method, and the resource allocation apparatus 80 may be configured in a desktop computer, a tablet computer, a portable computer, or other terminals. Specifically, referring to fig. 8, the resource allocation apparatus 80 includes a first allocation unit 81, a first obtaining unit 82, a first determining unit 84, and an increasing unit 83.
And the first allocation unit 81 is configured to, if a task created by a user is received, take the task as a current task, and acquire resources from the server cluster according to a preset resource allocation policy to allocate the resources to the current task.
A first obtaining unit 82, configured to obtain a utilization rate of a resource by the current task.
A first determining unit 84, configured to determine, according to the priority level of the current task, a corresponding resource increment as a target resource increment if the usage rate of the current task for the resource exceeds a preset first usage rate threshold;
and an increasing unit 83, configured to increase, to the current task, resources whose allocation amount is the target resource increase amount.
In an embodiment, as shown in fig. 9, the adding unit 83 includes a determining unit 831, a second allocating unit 832 and a third allocating unit 833.
A determining unit 831, configured to determine whether a resource remaining rate of the server cluster is greater than a preset resource remaining rate threshold.
A second allocating unit 832, configured to, if the determination result is that the resource surplus rate of the server cluster is greater than a preset resource surplus rate threshold, acquire, from the server cluster, the number of resources that is the target resource increase amount, and allocate the resources to the current task.
A third allocating unit 833, configured to, if the determination result is that the resource remaining rate of the server cluster is not greater than the preset resource remaining rate threshold, recover resources from other tasks and acquire, from the recovered resources, resources whose number is the target resource increment to allocate to the current task.
In one embodiment, as shown in fig. 10, the third allocating unit 833 includes a second obtaining unit 8331 and a fourth allocating unit 8332.
A second obtaining unit 8331 is configured to obtain other tasks with the usage rate of the resource lower than a preset third usage rate threshold as target tasks.
A fourth allocating unit 8332, configured to recycle resources from the target task and obtain, from the recycled resources, a number of resources that is equal to the target resource increment to allocate to the current task.
In one embodiment, as shown in fig. 11, the fourth distribution unit 8332 includes a second determination unit 101 and a third determination unit 102.
A second determining unit 101, configured to determine a second reference recycling value H2 according to a formula H2 — R3-R2, where R3 is the first utilization threshold, and R2 is a utilization of the resource by the target task;
a third determining unit 102, configured to determine a ratio a2 of resources recovered from the target task according to a formula a2 ═ K2 × H2, where K2 is a second recovery coefficient,
Figure BDA0001763622700000111
in one embodiment, as shown in fig. 12, the first determination unit 84 includes a fourth determination unit 841.
A fourth determining unit 841 for determining according to the formula
Figure BDA0001763622700000112
Determining the target resource increment Q1, wherein R1 is the utilization rate of the current task on resources, R3 is the first utilization rate threshold, Q is the total resource amount of the current task, and Y is a priority coefficient; if the priority level of the current task is high priority, taking the value of Y as Y1; if the priority level of the current task is the medium priority, taking the value of Y as Y2; if the priority level of the current task is low priority, taking the value of Y as Y3; y1 > Y2 > Y3 > 1.
Referring to fig. 13, fig. 13 is a schematic block diagram of a resource allocation apparatus according to another embodiment of the present invention. As shown in fig. 13, the resource allocation apparatus 80 of the present embodiment is obtained by adding a first recovery unit 85, a third obtaining unit 86, a second recovery unit 87, and a fourth recovery unit 88 to the above embodiment.
A first recovery unit 85, configured to, if the usage rate of the resource by the current task is lower than a preset second usage rate threshold, recover a part of the resource allocated to the current task, so that the usage rate of the resource by the current task is not lower than the preset second usage rate threshold.
A third obtaining unit 86, configured to obtain an operation state of the current task, where the operation state includes a working state, a suspension state, and a completion state.
A first obtaining unit 82, configured to execute the step of obtaining the utilization rate of the resource by the current task if the running state of the current task is a working state.
A second recycling unit 87, configured to recycle the resource allocated to the current task if the running state of the current task is a suspended state.
A third recycling unit 88, configured to recycle the resource allocated to the current task if the running state of the current task is a completion state.
Referring to fig. 14, in an embodiment, the first recovery unit 85 includes a fifth determination unit 851 and a sixth determination unit 852.
A fifth determining unit 841, configured to determine the first reference recovery value H1 according to a formula H1-R0-R1, where R0 is the second usage threshold, and R1 is the usage of resources by the current task.
A sixth determining unit 842 for determining a ratio a1 of the resources recovered from the current task according to the formula a1 ═ K1 × H1, wherein K1 is a first recovery coefficient,
Figure BDA0001763622700000121
it should be noted that, as can be clearly understood by those skilled in the art, the specific implementation processes of the resource allocation apparatus and each unit may refer to the corresponding descriptions in the foregoing method embodiments, and for convenience and brevity of description, no further description is provided herein.
The resource allocation apparatus described above may be implemented in the form of a computer program that is executable on a computer device as shown in fig. 15.
Referring to fig. 15, fig. 15 is a schematic block diagram of a computer device according to an embodiment of the present application. The computer device 500 may be a terminal or a server, where the terminal may be an electronic device with a communication function, such as a smart phone, a tablet computer, a notebook computer, a desktop computer, a personal digital assistant, and a wearable device. The server may be an independent server or a server cluster composed of a plurality of servers.
Referring to fig. 15, the computer device 500 includes a processor 502, memory, and a network interface 505 connected by a system bus 501, where the memory may include a non-volatile storage medium 503 and an internal memory 504.
The non-volatile storage medium 503 may store an operating system 5031 and a computer program 5032. The computer programs 5032, when executed, cause the processor 502 to perform a resource allocation method.
The processor 502 is used to provide computing and control capabilities to support the operation of the overall computer device 500.
The internal memory 504 provides an environment for the operation of the computer program 5032 in the non-volatile storage medium 503, and when the computer program 5032 is executed by the processor 502, the processor 502 can be caused to perform a resource allocation method.
The network interface 505 is used for network communication with other devices. Those skilled in the art will appreciate that the architecture shown in fig. 15 is merely a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing device 500 to which the disclosed aspects apply, as a particular computing device 500 may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
Wherein the processor 502 is configured to run the computer program 5032 stored in the memory to perform the steps of:
if a task created by a user is received, taking the task as a current task, and acquiring resources from a server cluster according to a preset resource configuration strategy to distribute the resources to the current task;
acquiring the utilization rate of the current task on resources; and
if the resource utilization rate of the current task exceeds a preset first utilization rate threshold, determining a corresponding resource increment as a target resource increment according to the priority level of the current task;
and increasing the resources with the allocation quantity being the target resource increasing quantity to the current task.
In one embodiment, the processor 502, in executing the computer program 5032 stored in the memory, further performs the steps of:
and if the resource utilization rate of the current task is lower than a preset second utilization rate threshold value, recycling part of the resources distributed to the current task so that the resource utilization rate of the current task is not lower than the preset second utilization rate threshold value.
In an embodiment, when implementing the step of recovering the resource allocated to the current task by the part, so that the usage rate of the resource by the current task is not lower than the preset second usage rate threshold, the processor 502 specifically implements the following steps:
determining a first reference reclamation value H1 according to the formula H1 — R0-R1, wherein R0 is the second usage threshold and R1 is the usage of resources by the current task;
determining a ratio of resources recovered from said current task, a1, according to the formula a1 ═ K1 × H1, wherein K1 is a first recovery coefficient,
Figure BDA0001763622700000131
in an embodiment, when the processor 502 implements the step of determining the corresponding resource increment as the target resource increment according to the priority level of the current task, the following steps are specifically implemented:
according to the formula
Figure BDA0001763622700000141
Determining the target resource increment Q1, wherein R1 is the utilization rate of the current task on resources, R3 is the first utilization rate threshold, Q is the total resource amount of the current task, and Y is a priority coefficient; if the priority level of the current task is high priority, Y is Y1; if the priority level of the current task is the medium priority, taking the value of Y as Y2; if the priority level of the current task is low priority, taking the value of Y as Y3; y1 > Y2 > Y3 > 1.
In an embodiment, when the step of increasing the resource allocated to the current task by the allocation amount that is the target resource increase amount is implemented, the processor 502 specifically implements the following steps:
judging whether the resource surplus rate of the server cluster is larger than a preset resource surplus rate threshold value or not;
if the judgment result is that the resource surplus rate of the server cluster is larger than a preset resource surplus rate threshold, acquiring the number of resources with the target resource increment from the server cluster and distributing the resources to the current task;
and if the judgment result is that the resource residual rate of the server cluster is not greater than a preset resource residual rate threshold, recovering resources from other tasks, and acquiring the number of the resources with the target resource increment from the recovered resources to allocate to the current task.
In an embodiment, when the processor 502 implements the step of recovering resources from other tasks and acquiring resources with the quantity equal to the target resource increment from the recovered resources and allocating the resources to the current task, the following steps are specifically implemented:
acquiring other tasks with the resource utilization rate lower than a preset third utilization rate threshold value as target tasks;
and recovering resources from the target task and acquiring the number of the resources with the target resource increment from the recovered resources to distribute the resources to the current task.
In one embodiment, the processor 502, in executing the computer program 5032 stored in the memory, further performs the steps of:
acquiring the running state of the current task;
if the running state of the current task is a working state, executing the step of acquiring the utilization rate of the current task to resources;
if the running state of the current task is a pause state, recovering resources allocated to the current task;
and if the running state of the current task is the completion state, recovering the resources distributed to the current task.
It should be understood that in the embodiment of the present Application, the Processor 502 may be a Central Processing Unit (CPU), and the Processor 502 may also be other general purpose processors, Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other Programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. Wherein a general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
It will be understood by those skilled in the art that all or part of the flow of the method implementing the above embodiments may be implemented by a computer program instructing relevant hardware. The computer program may be stored in a storage medium, which is a computer-readable storage medium. The computer program is executed by at least one processor in the computer system to implement the flow steps of the embodiments of the method described above.
Accordingly, the present invention also provides a storage medium. The storage medium may be a computer-readable storage medium. The storage medium stores a computer program. The computer program, when executed by a processor, causes the processor to perform the steps of:
if a task created by a user is received, taking the task as a current task, and acquiring resources from a server cluster according to a preset resource configuration strategy to distribute the resources to the current task;
acquiring the utilization rate of the current task to resources; and
if the utilization rate of the current task to the resources exceeds a preset first utilization rate threshold value, determining a corresponding resource increment as a target resource increment according to the priority level of the current task;
and adding the resources with the allocation quantity being the target resource increment to the current task.
In an embodiment, the processor, when executing the computer program, further performs the steps of:
and if the resource utilization rate of the current task is lower than a preset second utilization rate threshold value, recycling part of the resources distributed to the current task so that the resource utilization rate of the current task is not lower than the preset second utilization rate threshold value.
In an embodiment, when the processor executes the computer program to implement the step of recovering the resource allocated to the current task by the part so that the usage rate of the resource by the current task is not lower than a preset second usage rate threshold, the following steps are specifically implemented:
determining a first reference reclamation value H1 according to the formula H1-R0-R1, wherein R0 is the second usage threshold and R1 is the usage of resources by the current task;
determining a ratio of resources recovered from said current task, a1, according to the formula a1 ═ K1 × H1, wherein K1 is a first recovery coefficient,
Figure BDA0001763622700000151
in an embodiment, when the processor executes the computer program to implement the step of determining the corresponding resource increment as the target resource increment according to the priority level of the current task, the following steps are specifically implemented:
according to the formula
Figure BDA0001763622700000161
Determining the target resource increment amount Q1, wherein R1 is the utilization rate of the current task to resources, R3 is the first utilization threshold, Q is the total resource amount of the current task, and Y is a priority coefficient; if the priority level of the current task is high priority, Y is Y1; if the priority level of the current task is the middle priority level, the value of Y is Y2; if the priority level of the current task is low priority, taking the value of Y as Y3; y1 > Y2 > Y3 > 1.
In an embodiment, when the processor executes the computer program to implement the step of increasing the resource allocated to the current task by the allocation amount as the target resource increase amount, the following steps are specifically implemented:
judging whether the resource surplus rate of the server cluster is larger than a preset resource surplus rate threshold value or not;
if the judgment result is that the resource surplus rate of the server cluster is larger than a preset resource surplus rate threshold value, acquiring resources with the quantity being the target resource increment from the server cluster and distributing the resources to the current task;
and if the judgment result is that the resource residual rate of the server cluster is not greater than a preset resource residual rate threshold, recovering resources from other tasks, and acquiring the number of the resources with the target resource increment from the recovered resources to allocate to the current task.
In an embodiment, when the processor executes the computer program to realize the steps of recovering resources from other tasks and acquiring resources with the quantity equal to the target resource increment from the recovered resources to allocate to the current task, the following steps are specifically realized:
acquiring other tasks with the resource utilization rate lower than a preset third utilization rate threshold value as target tasks;
and recovering resources from the target task and acquiring the resources with the quantity of the target resource increment from the recovered resources to distribute to the current task.
In an embodiment, the processor, when executing the computer program, further performs the steps of:
acquiring the running state of the current task;
if the running state of the current task is a working state, executing the step of acquiring the utilization rate of the current task to resources;
if the running state of the current task is a pause state, recovering resources allocated to the current task;
and if the running state of the current task is the completion state, recovering the resources distributed to the current task.
The storage medium may be a usb disk, a removable hard disk, a Read-Only Memory (ROM), a magnetic disk, or an optical disk, which can store various computer readable storage media.
Those of ordinary skill in the art will appreciate that the various illustrative components and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both, and that the components and steps of the various examples have been described above generally in terms of their functionality in order to clearly illustrate this interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the technical solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
In the embodiments provided in the present invention, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative. For example, the division of each unit is only one logic function division, and there may be another division manner in actual implementation. For example, various elements or components may be combined or may be integrated into another system, or some features may be omitted, or not implemented.
The steps in the method of the embodiment of the invention can be sequentially adjusted, combined and deleted according to actual needs. The units in the device of the embodiment of the invention can be merged, divided and deleted according to actual needs. In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a separate product, may be stored in a storage medium. Based on such understanding, the technical solution of the present invention essentially or partly contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a terminal, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention.
While the invention has been described with reference to specific embodiments, the invention is not limited thereto, and various equivalent modifications and substitutions can be easily made by those skilled in the art within the technical scope of the invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims (9)

1. A method for resource allocation, comprising:
if a task created by a user is received, taking the task as a current task, and acquiring resources from a server cluster according to a preset resource configuration strategy to distribute the resources to the current task;
acquiring the utilization rate of the current task on resources, wherein the utilization rate is the percentage of the resources currently used by the current task in the total resources allocated to the current task;
if the resource utilization rate of the current task exceeds a preset first utilization rate threshold, determining a corresponding resource increment as a target resource increment according to the priority level of the current task; and
adding resources with the allocation quantity being the target resource increment to the current task;
wherein, the determining the corresponding resource increment as the target resource increment according to the priority level of the current task comprises:
according to the formula
Figure 336080DEST_PATH_IMAGE001
Determining the target resource increment Q1, wherein R1 is the utilization rate of the current task on resources, R3 is the first utilization rate threshold, Q is the total resource amount of the current task, and K is a priority coefficient; if the priority level of the current task is high priority, K takes the value of K1; if the priority level of the current task is the medium priority level, the value of K is K2; if the priority level of the current task is low priority, K is K3; k1 > K2 > K3 > 1.
2. The method for allocating resources according to claim 1, further comprising:
and if the resource utilization rate of the current task is lower than a preset second utilization rate threshold value, recycling part of the resources distributed to the current task so that the resource utilization rate of the current task is not lower than the preset second utilization rate threshold value.
3. The method according to claim 2, wherein the recovering part of the resources allocated to the current task so that the resource usage rate of the current task is not lower than a preset second usage rate threshold comprises:
determining a first reference reclamation value H1 according to the formula H1= R0-R1, wherein R0 is the second usage threshold value and R1 is the usage of the resource by the current task;
determining a proportion of resources recovered from the current task A1 according to the formula A1= K1H 1, wherein K1 is a first recovery coefficient,
Figure 528027DEST_PATH_IMAGE002
4. the method according to claim 1, wherein the increasing allocation of the number of resources to the current task to the target resource increase amount comprises:
judging whether the resource surplus rate of the server cluster is larger than a preset resource surplus rate threshold value or not;
if the judgment result is that the resource surplus rate of the server cluster is larger than a preset resource surplus rate threshold, acquiring the number of resources with the target resource increment from the server cluster and distributing the resources to the current task;
and if the judgment result is that the resource residual rate of the server cluster is not greater than a preset resource residual rate threshold, recovering resources from other tasks, and acquiring the number of the resources with the target resource increment from the recovered resources to allocate to the current task.
5. The method according to claim 4, wherein the recovering resources from other tasks and obtaining the resources with the amount of the target resource increment from the recovered resources to allocate to the current task comprises:
acquiring other tasks of which the resource utilization rate is lower than a preset third utilization rate threshold value as target tasks;
and recovering resources from the target task and acquiring the resources with the quantity of the target resource increment from the recovered resources to distribute to the current task.
6. The method according to claim 1, wherein before said obtaining the resource usage rate of the current task, the method further comprises:
acquiring the running state of the current task;
if the running state of the current task is a working state, executing the step of acquiring the utilization rate of the current task to resources;
if the running state of the current task is a pause state, recovering resources allocated to the current task;
and if the running state of the current task is the completion state, recovering the resources distributed to the current task.
7. A resource allocation apparatus, comprising means for performing the method of any one of claims 1-6.
8. A computer arrangement, characterized in that the computer arrangement comprises a memory, on which a computer program is stored, and a processor, which when executing the computer program, carries out the method according to any one of claims 1-6.
9. A storage medium, characterized in that the storage medium stores a computer program which, when executed by a processor, may implement the method according to any one of claims 1-6.
CN201810918371.6A 2018-08-13 2018-08-13 Resource allocation method, device, computer equipment and storage medium Active CN108881495B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810918371.6A CN108881495B (en) 2018-08-13 2018-08-13 Resource allocation method, device, computer equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810918371.6A CN108881495B (en) 2018-08-13 2018-08-13 Resource allocation method, device, computer equipment and storage medium

Publications (2)

Publication Number Publication Date
CN108881495A CN108881495A (en) 2018-11-23
CN108881495B true CN108881495B (en) 2022-07-22

Family

ID=64317723

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810918371.6A Active CN108881495B (en) 2018-08-13 2018-08-13 Resource allocation method, device, computer equipment and storage medium

Country Status (1)

Country Link
CN (1) CN108881495B (en)

Families Citing this family (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109634747A (en) * 2018-12-12 2019-04-16 平安科技(深圳)有限公司 Resource capacity expansion method, apparatus, computer equipment and storage medium based on Saltstack
CN109767073A (en) * 2018-12-15 2019-05-17 深圳壹账通智能科技有限公司 Calculation method, device, computer equipment and the storage medium of the project budget
CN110442449A (en) * 2019-07-09 2019-11-12 北京云和时空科技有限公司 A kind of resource regulating method and device
CN110795334B (en) * 2019-09-09 2023-12-29 连连银通电子支付有限公司 Testing device and method
CN111078404B (en) * 2019-12-09 2023-07-11 腾讯科技(深圳)有限公司 Computing resource determining method and device, electronic equipment and medium
CN113742052B (en) * 2020-05-29 2023-09-01 北京京东振世信息技术有限公司 Batch task processing method and device
CN111694652B (en) * 2020-06-24 2023-07-21 中国平安人寿保险股份有限公司 Task dynamic scheduling method, device, computer equipment and storage medium
CN112130995B (en) * 2020-09-18 2023-01-06 苏州浪潮智能科技有限公司 Real-time data processing method and device
CN112596503B (en) * 2020-12-18 2022-04-22 浙江中控技术股份有限公司 Configuration method for scanning period of control system and related equipment
CN112596906A (en) * 2020-12-26 2021-04-02 中国农业银行股份有限公司 Resource allocation method and device for processing unit
CN113220452A (en) * 2021-05-10 2021-08-06 北京百度网讯科技有限公司 Resource allocation method, model training method, device and electronic equipment
US20230075482A1 (en) * 2021-08-26 2023-03-09 International Business Machines Corporation Conditionally deploying a reusable group of containers for a job based on available system resources
CN114296918B (en) * 2021-12-24 2023-11-14 苏州浪潮智能科技有限公司 Resource allocation system and method
CN115102913B (en) * 2022-06-06 2024-01-09 深圳一粒云科技有限公司 Cloud desktop resource configuration method, system and storage medium based on user behaviors

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102651729A (en) * 2011-02-23 2012-08-29 中国移动通信集团公司 Resource configuration method and device
CN105376111A (en) * 2015-11-13 2016-03-02 百度在线网络技术(北京)有限公司 Resource allocation method and device
CN107291545A (en) * 2017-08-07 2017-10-24 星环信息科技(上海)有限公司 The method for scheduling task and equipment of multi-user in computing cluster
CN107463433A (en) * 2017-08-18 2017-12-12 郑州云海信息技术有限公司 The method and apparatus for managing the resource of virtual machine
CN107864211A (en) * 2017-11-17 2018-03-30 中国联合网络通信集团有限公司 Cluster resource dispatching method and system
CN107968810A (en) * 2016-10-20 2018-04-27 阿里巴巴集团控股有限公司 A kind of resource regulating method of server cluster, device and system

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8959367B2 (en) * 2011-08-17 2015-02-17 International Business Machines Corporation Energy based resource allocation across virtualized machines and data centers

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102651729A (en) * 2011-02-23 2012-08-29 中国移动通信集团公司 Resource configuration method and device
CN105376111A (en) * 2015-11-13 2016-03-02 百度在线网络技术(北京)有限公司 Resource allocation method and device
CN107968810A (en) * 2016-10-20 2018-04-27 阿里巴巴集团控股有限公司 A kind of resource regulating method of server cluster, device and system
CN107291545A (en) * 2017-08-07 2017-10-24 星环信息科技(上海)有限公司 The method for scheduling task and equipment of multi-user in computing cluster
CN107463433A (en) * 2017-08-18 2017-12-12 郑州云海信息技术有限公司 The method and apparatus for managing the resource of virtual machine
CN107864211A (en) * 2017-11-17 2018-03-30 中国联合网络通信集团有限公司 Cluster resource dispatching method and system

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
云计算环境下虚拟机动态整合关键技术研究进展;汤莉等;《陕西师范大学学报(自然科学版)》;20180110(第01期);全文 *

Also Published As

Publication number Publication date
CN108881495A (en) 2018-11-23

Similar Documents

Publication Publication Date Title
CN108881495B (en) Resource allocation method, device, computer equipment and storage medium
US10361928B2 (en) Cluster instance management system
CN106326002B (en) Resource scheduling method, device and equipment
CN108337109B (en) Resource allocation method and device and resource allocation system
US10333859B2 (en) Multi-tenant resource coordination method
CN112272203B (en) Cluster service node selection method, system, terminal and storage medium
CN107301093B (en) Method and device for managing resources
CN111209110B (en) Task scheduling management method, system and storage medium for realizing load balancing
CN105447097A (en) Data acquisition method and system
JP2012094030A (en) Computer system and processing control method
CN111966500A (en) Resource scheduling method and device, electronic equipment and storage medium
CN112269641A (en) Scheduling method, scheduling device, electronic equipment and storage medium
CN112486642B (en) Resource scheduling method, device, electronic equipment and computer readable storage medium
CN111414241A (en) Batch data processing method, device and system, computer equipment and computer readable storage medium
CN112231108A (en) Task processing method and device, computer readable storage medium and server
CN111538585B (en) Js-based server process scheduling method, system and device
US20210406053A1 (en) Rightsizing virtual machine deployments in a cloud computing environment
CN113821340A (en) Dynamic balancing method, system, terminal and storage medium of distributed system
CN110471769B (en) Resource management method and device for virtual machine
CN114625533A (en) Distributed task scheduling method and device, electronic equipment and storage medium
CN114116173A (en) Method, device and system for dynamically adjusting task allocation
US10754697B2 (en) System for allocating resources for use in data processing operations
US20190086986A1 (en) Achieving a consistent computing device battery drain rate
CN112073532B (en) Resource allocation method and device
CN113626145B (en) Dynamic capacity expansion method and system for number of business virtual machines

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
GR01 Patent grant
GR01 Patent grant