CN110795234A - Resource scheduling method and device - Google Patents
Resource scheduling method and device Download PDFInfo
- Publication number
- CN110795234A CN110795234A CN201910909838.5A CN201910909838A CN110795234A CN 110795234 A CN110795234 A CN 110795234A CN 201910909838 A CN201910909838 A CN 201910909838A CN 110795234 A CN110795234 A CN 110795234A
- Authority
- CN
- China
- Prior art keywords
- resources
- container
- container group
- operated
- priority
- 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.)
- Withdrawn
Links
- 238000000034 method Methods 0.000 title claims abstract description 49
- 230000002159 abnormal effect Effects 0.000 claims description 6
- 238000004064 recycling Methods 0.000 claims description 5
- 238000011084 recovery Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 238000010586 diagram 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
- 230000007723 transport mechanism 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
Abstract
The application provides a resource scheduling method and a device, wherein the method comprises the following steps: for the to-be-operated container group, if the residual resources of the host machine corresponding to the to-be-operated container group are less than the required resources of the to-be-operated container group, judging whether M operating container groups capable of being preempted exist in the host machine; if M operating container groups capable of being preempted exist, and the sum of the occupied resources of the N operating container groups capable of being preempted and the residual resources of the host machine is greater than or equal to the required resources of the container groups to be operated, recovering the occupied resources of the N operating container groups capable of being preempted; wherein, the priority of the operating container group which can be preempted is lower than that of the container group to be operated; m and N are both positive integers greater than or equal to 1; m is greater than or equal to N. According to the technical scheme, the preemptive resource scheduling can be realized according to the priority of the container group when the resources are insufficient, so that the resource scheduling is more flexible, and various user requirements can be met.
Description
Technical Field
The present invention relates to the field of computers, and in particular, to a resource scheduling method and apparatus.
Background
The container group cloud platform consists of a plurality of data centers, one data center consists of a plurality of clusters, each cluster is provided with a certain number of hosts, the hosts run through Pod, and the Pod is formed by combining one or more containers. Kubernets by Google is a currently popular container group cluster management tool. The Kubernetes scheduler plays an important role in the whole resource scheduling process, and is responsible for receiving the newly created Pod and assigning a target node for the Pod; after the scheduling is successful, the Kublet service process on the target node takes over the subsequent work, is in charge of the management of the Pod, and periodically reports the running state of the Pod to the scheduler.
Kubernetes implements resource scheduling through the difference between the "expected state" of Pod, which is embodied by a resource description file, and the "actual state" of the current environment, however, the current resource description file has the following problems: the user binding strategy is simple, each Pod in Kubernetes does not distinguish priority, and when resources on nodes distributed by the pods are insufficient, the pods cannot normally operate.
Disclosure of Invention
The technology to be solved by the application is to provide a resource scheduling method and device, which can realize preemptive resource scheduling when resources are insufficient.
In order to solve the above technical problem, the present application provides a resource scheduling method, including:
for a to-be-operated container group, if the residual resources of a host machine corresponding to the to-be-operated container group are less than the required resources of the to-be-operated container group, judging whether M operating container groups capable of being preempted exist in the host machine;
if M operating container groups capable of being preempted exist, and the sum of the occupied resources of the N operating container groups capable of being preempted and the residual resources of the host machine is greater than or equal to the required resources of the container group to be operated, recovering the occupied resources of the N operating container groups capable of being preempted;
wherein the priority of the preemptible operated container group is lower than that of the to-be-operated container group;
m and N are both positive integers greater than or equal to 1; m is greater than or equal to N.
Optionally, after recovering the occupied resources of the N preemptible already-operating container groups, the method further includes:
and allocating required resources for the container group to be operated so as to enable the container group to be operated to operate on the host machine.
Optionally, the restart policy includes restarting after any exit, restarting only after an abnormal exit, and restarting in no case;
when the restart strategy of the container group is restart after any exit, the priority of the container group is a first priority; when the restart strategy of the container group is only restart after exception exits, the priority of the container group is a second priority; when the restart strategy of the container group is not restarted under any condition, the priority of the container group is a third priority, the first priority is higher than the second priority, and the second priority is higher than the third priority.
Optionally, if there are M preemptible already-operating container groups and the sum of the occupied resources of the N preemptible already-operating container groups and the remaining resources of the host is greater than or equal to the required resources of the to-be-operated container group, before recycling the occupied resources of the N preemptible already-operating container groups, the method further includes:
and storing the current operation data and the historical operation data corresponding to the N preemptible operated container groups.
Optionally, after recovering the occupied resources of the N preemptible already-operating container groups, the method further includes:
and storing the N operating containers capable of being preempted into a scheduling queue.
The present application further provides a resource scheduling apparatus, the apparatus includes: a memory and a processor;
the memory is used for storing programs for resource scheduling;
the processor is configured to read and execute the program for resource scheduling, and perform the following operations:
for a to-be-operated container group, if the residual resources of a host machine corresponding to the to-be-operated container group are less than the required resources of the to-be-operated container group, judging whether M operating container groups capable of being preempted exist in the host machine;
if M operating container groups capable of being preempted exist, and the sum of the occupied resources of the N operating container groups capable of being preempted and the residual resources of the host machine is greater than or equal to the required resources of the container group to be operated, recovering the occupied resources of the N operating container groups capable of being preempted;
wherein the priority of the preemptible operated container group is lower than that of the to-be-operated container group;
m and N are both positive integers greater than or equal to 1; m is greater than or equal to N.
Optionally, the processor is configured to read and execute the program for resource scheduling, and further perform the following operations:
and after the occupied resources of the N preemptible operated container groups are recovered, distributing required resources for the container group to be operated so as to enable the container group to be operated to operate on the host machine.
Optionally, the restart policy includes restarting after any exit, restarting only after an abnormal exit, and restarting in no case;
when the restart strategy of the container group is restart after any exit, the priority of the container group is a first priority; when the restart strategy of the container group is only restart after exception exits, the priority of the container group is a second priority; when the restart strategy of the container group is not restarted under any condition, the priority of the container group is a third priority, the first priority is higher than the second priority, and the second priority is higher than the third priority.
Optionally, the processor is configured to read and execute the program for resource scheduling, and further perform the following operations:
if M operating container groups capable of being preempted exist, and the sum of the occupied resources of the N operating container groups capable of being preempted and the residual resources of the host machine is larger than or equal to the required resources of the container groups to be operated, current operating data and historical operating data corresponding to the N operating container groups capable of being preempted are saved before the occupied resources of the N operating container groups capable of being preempted are recovered.
Optionally, the processor is configured to read and execute the program for resource scheduling, and further perform the following operations:
and after the resources occupied by the N operating container groups capable of being preempted are recovered, storing the N operating container groups capable of being preempted into a scheduling queue.
The application provides a resource scheduling method and a device, wherein the method comprises the following steps: for a to-be-operated container group, if the residual resources of a host machine corresponding to the to-be-operated container group are less than the required resources of the to-be-operated container group, judging whether M operating container groups capable of being preempted exist in the host machine; if M operating container groups capable of being preempted exist, and the sum of the occupied resources of the N operating container groups capable of being preempted and the residual resources of the host machine is greater than or equal to the required resources of the container group to be operated, recovering the occupied resources of the N operating container groups capable of being preempted; wherein the priority of the preemptible operated container group is lower than that of the to-be-operated container group; m and N are both positive integers greater than or equal to 1; m is greater than or equal to N. According to the technical scheme, the preemptive resource scheduling can be realized according to the priority of the container group when the resources are insufficient, so that the resource scheduling is more flexible, and various user requirements can be met.
Drawings
The accompanying drawings are included to provide an understanding of the present disclosure and are incorporated in and constitute a part of this specification, illustrate embodiments of the disclosure and together with the examples serve to explain the principles of the disclosure and not to limit the disclosure.
Fig. 1 is a flowchart of a resource scheduling method according to a first embodiment of the present invention;
FIG. 2 is another flowchart of a resource scheduling method according to a first embodiment of the present invention
Fig. 3 is a schematic structural diagram of a resource scheduling apparatus according to a first embodiment of the present invention.
Detailed Description
The present application describes embodiments, but the description is illustrative rather than limiting and it will be apparent to those of ordinary skill in the art that many more embodiments and implementations are possible within the scope of the embodiments described herein. Although many possible combinations of features are shown in the drawings and discussed in the detailed description, many other combinations of the disclosed features are possible. Any feature or element of any embodiment may be used in combination with or instead of any other feature or element in any other embodiment, unless expressly limited otherwise.
The present application includes and contemplates combinations of features and elements known to those of ordinary skill in the art. The embodiments, features and elements disclosed in this application may also be combined with any conventional features or elements to form a unique inventive concept as defined by the claims. Any feature or element of any embodiment may also be combined with features or elements from other inventive aspects to form yet another unique inventive aspect, as defined by the claims. Thus, it should be understood that any of the features shown and/or discussed in this application may be implemented alone or in any suitable combination. Accordingly, the embodiments are not limited except as by the appended claims and their equivalents. Furthermore, various modifications and changes may be made within the scope of the appended claims.
Further, in describing representative embodiments, the specification may have presented the method and/or process as a particular sequence of steps. However, to the extent that the method or process does not rely on the particular order of steps set forth herein, the method or process should not be limited to the particular sequence of steps described. Other orders of steps are possible as will be understood by those of ordinary skill in the art. Therefore, the particular order of the steps set forth in the specification should not be construed as limitations on the claims. Further, the claims directed to the method and/or process should not be limited to the performance of their steps in the order written, and one skilled in the art can readily appreciate that the sequences may be varied and still remain within the spirit and scope of the embodiments of the present application.
Example one
As shown in fig. 1, this embodiment provides a resource scheduling method, where the method includes:
step S101, for a container group to be operated, if the residual resources of a host machine corresponding to the container group to be operated are less than the required resources of the container group to be operated, judging whether M operating container groups capable of being preempted exist in the host machine;
step S103, if M operating container groups capable of being preempted exist, and the sum of the occupied resources of the N operating container groups capable of being preempted and the residual resources of the host machine is greater than or equal to the required resources of the container group to be operated, recovering the occupied resources of the N operating container groups capable of being preempted;
wherein the priority of the preemptible operated container group is lower than that of the to-be-operated container group;
m and N are both positive integers greater than or equal to 1; m is greater than or equal to N.
Optionally, as shown in fig. 2, after recycling the occupied resources of the N preemptible already-operating container groups, the method may further include:
and step S104, distributing required resources for the container group to be operated so as to enable the container group to be operated to operate on the host machine.
Optionally, the restart policy includes restarting after any exit, restarting only after an abnormal exit, and restarting in no case;
when the restart strategy of the container group is restart after any exit, the priority of the container group is a first priority; when the restart strategy of the container group is only restart after exception exits, the priority of the container group is a second priority; when the restart strategy of the container group is not restarted under any condition, the priority of the container group is a third priority, the first priority is higher than the second priority, and the second priority is higher than the third priority.
Optionally, if there are M preemptible already-operating container groups and the sum of the occupied resources of the N preemptible already-operating container groups and the remaining resources of the host is greater than or equal to the required resources of the to-be-operated container group, before recycling the occupied resources of the N preemptible already-operating container groups, the method may further include:
and S102, storing the current operation data and the historical operation data corresponding to the N preemptible operated container groups.
Optionally, after recycling occupied resources of the N preemptible already-operating container groups, the method may further include:
and step S105, storing the N operating containers capable of being preempted into a scheduling queue.
In this embodiment, after the N preemptible already-running container groups are stored in the scheduling queue, the next time the host is allocated to the container group in the scheduling queue again is waited for. The container group in the scheduling queue can be operated on the original host again and can be distributed to other hosts to operate.
In addition, the execution order of step S104 and step S105 is not particularly limited.
According to the technical scheme, the priority is set for the container, and the preemptive resource scheduling can be realized according to the priority of the container group when the resources are insufficient, so that the resource scheduling is more flexible, and various user requirements can be met.
As shown in fig. 2, this embodiment further provides a resource scheduling apparatus, where the apparatus includes: a memory 10 and a processor 11;
the memory 10 is used for storing programs for resource scheduling;
the processor 11 is configured to read and execute the program for resource scheduling, and perform the following operations:
for a to-be-operated container group, if the residual resources of a host machine corresponding to the to-be-operated container group are less than the required resources of the to-be-operated container group, judging whether M operating container groups capable of being preempted exist in the host machine;
if M operating container groups capable of being preempted exist, and the sum of the occupied resources of the N operating container groups capable of being preempted and the residual resources of the host machine is greater than or equal to the required resources of the container group to be operated, recovering the occupied resources of the N operating container groups capable of being preempted;
wherein the priority of the preemptible operated container group is lower than that of the to-be-operated container group;
m and N are both positive integers greater than or equal to 1; m is greater than or equal to N.
Optionally, the processor 11 is configured to read and execute the program for resource scheduling, and may further perform the following operations:
and after the occupied resources of the N preemptible operated container groups are recovered, distributing required resources for the container group to be operated so as to enable the container group to be operated to operate on the host machine.
Optionally, the restart policy may include restarting after any exit, restarting only after an abnormal exit, and restarting in no case;
when the restart strategy of the container group is restart after any exit, the priority of the container group is a first priority; when the restart strategy of the container group is only restart after exception exits, the priority of the container group is a second priority; when the restart strategy of the container group is not restarted under any condition, the priority of the container group is a third priority, the first priority is higher than the second priority, and the second priority is higher than the third priority.
Optionally, the processor 11 is configured to read and execute the program for resource scheduling, and may further perform the following operations:
if M operating container groups capable of being preempted exist, and the sum of the occupied resources of the N operating container groups capable of being preempted and the residual resources of the host machine is larger than or equal to the required resources of the container groups to be operated, current operating data and historical operating data corresponding to the N operating container groups capable of being preempted are saved before the occupied resources of the N operating container groups capable of being preempted are recovered.
Optionally, the processor 11 is configured to read and execute the program for resource scheduling, and may further perform the following operations:
and after the resources occupied by the N operating container groups capable of being preempted are recovered, storing the N operating container groups capable of being preempted into a scheduling queue.
According to the technical scheme, the priority is set for the container, and the preemptive resource scheduling can be realized according to the priority of the container group when the resources are insufficient, so that the resource scheduling is more flexible, and various user requirements can be met.
The resource scheduling method of the present application is further explained by examples below.
Example 1
Assume that cluster 1 includes 3 hosts: the host 1, the host 2, and the host 2, if the container group E is to be currently operated, may allocate a most suitable host to the container group E to be operated according to information such as a Central Processing Unit (CPU) resource and a memory resource required by the container group E to be operated, and resource capabilities of the current 3 hosts.
In this example, it is assumed that the target host to which the to-be-operated container group E is allocated is the host 1, the system sends a notification message to the host 1, and after receiving the notification message, the host 1 performs resource scheduling according to the required resources of the to-be-operated container group E, occupied resources of the host and remaining resources.
Suppose that the CPU of the host 1 is 16 cores (including 2 CPUs, each CPU has 8 cores), the memory is 8T, the CPU resource required by the to-be-operated container group E is 6 cores, the memory resource is 4T, and the restart policy is that the restart is performed after any exit (the second priority). The host 1 has already run a container group a, a container group B, a container group C, and a container group D.
As shown in table 1, for the resources occupied by the operated container group a, the operated container group B, the operated container group C, and the operated container group D and the restart policy, if the remaining resources of the host 1 can meet the requirement of the to-be-operated container group E, the to-be-operated container group E can be directly operated on the host 1. Based on table 1, the current resources left by host 1 are: the CPU 4 core, the memory 1T, that is, the current remaining resources cannot meet the requirements of the to-be-operated container group E. At this time, the host 1 determines, according to the resource scheduling policy of the present application, that the already-running container group that can be preempted is: container group B, container group C, and container group D.
TABLE 1
Next, it is necessary to determine a container group that needs to reclaim resources from the preemptible already-operating container groups. In this example, the container group that needs to recover resources may be determined according to three parameters, i.e., priority, CPU resource occupancy, and memory resource occupancy, which are exemplified by 3 ways as follows:
mode 1
In the method, the container with the lowest recovery priority level, namely the resource of the container group D, can be considered firstly, after the resource of the container group D is recovered, the remaining resource of the host 1 is a CPU 6 core and a memory 2T, and the resource requirement of the container group E to be operated can not be met;
and then, considering the container group with more occupied recycled memory resources, and considering the container group with more occupied recycled CPU resources if the memory resources are occupied as much. For the container group B and the container group C, the container group C occupies more memory resources, and thus the resources of the container group C are selected back. After the resources of the container group C are recovered, the remaining resources of the host 1 are the CPU 8 core and the memory 5T, and at this time, the resource requirement of the container group E can be satisfied without recovering the resources of the container group B.
In the method 1, the host 1 has 3 preemptible operated container groups, wherein the sum of the occupied resources of the 2 preemptible operated container groups and the remaining resources of the host 1 is greater than or equal to the required resources of the to-be-operated container group E, and therefore, the resources of the 2 preemptible operated container groups are recovered. That is, by returning the resources of the container group C and the container group D, the remaining resources of the host 1 can meet the resource requirement of the container group E to be operated, so that the container group E to be operated operates by preempting the resources of the container group C and the container group D.
Mode 2
In the method, the container with the lowest recovery priority level, namely the resource of the container group D, can be considered firstly, after the resource of the container group D is recovered, the remaining resource of the host 1 is a CPU 6 core and a memory 2T, and the resource requirement of the container group E still cannot be met;
and then, considering the container group which occupies more CPU resources, and considering the container group which occupies more memory resources if the CPU resources occupy the same amount. For the container group B and the container group C, the container group B occupies more CPU resources, and thus the resources of the container group B are selected back. After the resources of the container group B are recovered, the remaining resources of the host 1 are the CPU 10 core and the memory 4T, and at this time, the resource requirement of the container group E can be satisfied without recovering the resources of the container group C.
In the mode 2, by returning the resources of the container group B and the container group D, the remaining resources of the host 1 can meet the resource requirement of the container group E to be operated, so that the container group E to be operated operates by preempting the resources of the container group B and the container group D.
Mode 3
The method can consider the container with more occupied memory resources, and if the memory resources occupy the same amount, the method considers the container group with more occupied recovered CPU resources; if the CPU resource occupies the same amount, the container group with lower recovery priority is considered; if the priorities are the same, a group of containers can be randomly selected. Therefore, the resources of the container group C can be returned first, and after the resources of the container group C are recovered, the remaining resources of the host 1 are the CPU 6 core and the memory 4T, so that the resource requirements of the container group E can be met, and the resources of the container group B and the container group D do not need to be returned.
In the method 3, by returning the resources of the container group C, the remaining resources of the host 1 can meet the resource requirement of the container group E to be operated, so that the container group E to be operated operates after preempting the resources of the container group C.
In other embodiments, a container group needing resource recovery can be determined according to the sequence of memory resource occupation, priority and CPU resource occupation; the method can also determine the container group needing to recover the resources according to the sequence of the CPU resource occupation amount, the priority and the memory resource occupation amount, or can also determine the container group needing to recover the resources according to the sequence of the CPU resource occupation amount, the memory resource occupation amount and the priority.
According to the technical scheme, the priority is set for the container, and the preemptive resource scheduling can be realized according to the priority of the container group when the resources are insufficient, so that the resource scheduling is more flexible, and various user requirements can be met.
It will be understood by those of ordinary skill in the art that all or some of the steps of the methods, systems, functional modules/units in the devices disclosed above may be implemented as software, firmware, hardware, and suitable combinations thereof. In a hardware implementation, the division between functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may be performed by several physical components in cooperation. Some or all of the components may be implemented as software executed by a processor, such as a digital signal processor or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on computer readable media, which may include computer storage media (or non-transitory media) and communication media (or transitory media). The term computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data, as is well known to those of ordinary skill in the art. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, Digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can accessed by a computer. In addition, communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media as known to those skilled in the art.
Claims (10)
1. A method for scheduling resources, the method comprising:
for a to-be-operated container group, if the residual resources of a host machine corresponding to the to-be-operated container group are less than the required resources of the to-be-operated container group, judging whether M operating container groups capable of being preempted exist in the host machine;
if M operating container groups capable of being preempted exist, and the sum of the occupied resources of the N operating container groups capable of being preempted and the residual resources of the host machine is greater than or equal to the required resources of the container group to be operated, recovering the occupied resources of the N operating container groups capable of being preempted;
wherein the priority of the preemptible operated container group is lower than that of the to-be-operated container group;
m and N are both positive integers greater than or equal to 1; m is greater than or equal to N.
2. The method of claim 1, wherein after reclaiming the occupied resources of the N preemptible set of already-running containers, the method further comprises:
and allocating required resources for the container group to be operated so as to enable the container group to be operated to operate on the host machine.
3. The method of claim 2, wherein:
the restarting strategy comprises restarting after any exit, restarting only after abnormal exit and restarting under any condition;
when the restart strategy of the container group is restart after any exit, the priority of the container group is a first priority; when the restart strategy of the container group is only restart after exception exits, the priority of the container group is a second priority; when the restart strategy of the container group is not restarted under any condition, the priority of the container group is a third priority, the first priority is higher than the second priority, and the second priority is higher than the third priority.
4. The method of claim 3, wherein if there are M preemptible already-running container groups and the sum of the occupied resources of N preemptible already-running container groups and the remaining resources of the host is greater than or equal to the required resources of the container group to be operated, before recycling the occupied resources of the N preemptible already-running container groups, the method further comprises:
and storing the current operation data and the historical operation data corresponding to the N preemptible operated container groups.
5. The method according to any one of claims 1 to 4, wherein after said reclaiming of occupied resources of said N set of preemptible already running containers, the method further comprises:
and storing the N operating containers capable of being preempted into a scheduling queue.
6. An apparatus for scheduling resources, the apparatus comprising: a memory and a processor; the method is characterized in that:
the memory is used for storing programs for resource scheduling;
the processor is configured to read and execute the program for resource scheduling, and perform the following operations:
for a to-be-operated container group, if the residual resources of a host machine corresponding to the to-be-operated container group are less than the required resources of the to-be-operated container group, judging whether M operating container groups capable of being preempted exist in the host machine;
if M operating container groups capable of being preempted exist, and the sum of the occupied resources of the N operating container groups capable of being preempted and the residual resources of the host machine is greater than or equal to the required resources of the container group to be operated, recovering the occupied resources of the N operating container groups capable of being preempted;
wherein the priority of the preemptible operated container group is lower than that of the to-be-operated container group;
m and N are both positive integers greater than or equal to 1; m is greater than or equal to N.
7. The apparatus of claim 6, wherein the processor, configured to read and execute the program for resource scheduling, further performs the following operations:
and after the occupied resources of the N preemptible operated container groups are recovered, distributing required resources for the container group to be operated so as to enable the container group to be operated to operate on the host machine.
8. The apparatus of claim 7, wherein:
the restarting strategy comprises restarting after any exit, restarting only after abnormal exit and restarting under any condition;
when the restart strategy of the container group is restart after any exit, the priority of the container group is a first priority; when the restart strategy of the container group is only restart after exception exits, the priority of the container group is a second priority; when the restart strategy of the container group is not restarted under any condition, the priority of the container group is a third priority, the first priority is higher than the second priority, and the second priority is higher than the third priority.
9. The apparatus of claim 8, wherein the processor, configured to read and execute the program for resource scheduling, further performs the following operations:
if M operating container groups capable of being preempted exist, and the sum of the occupied resources of the N operating container groups capable of being preempted and the residual resources of the host machine is larger than or equal to the required resources of the container groups to be operated, current operating data and historical operating data corresponding to the N operating container groups capable of being preempted are saved before the occupied resources of the N operating container groups capable of being preempted are recovered.
10. The apparatus of any one of claims 6 to 9, wherein the processor, configured to read and execute the program for resource scheduling, further performs the following operations:
and after the resources occupied by the N operating container groups capable of being preempted are recovered, storing the N operating container groups capable of being preempted into a scheduling queue.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910909838.5A CN110795234A (en) | 2019-09-25 | 2019-09-25 | Resource scheduling method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910909838.5A CN110795234A (en) | 2019-09-25 | 2019-09-25 | Resource scheduling method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110795234A true CN110795234A (en) | 2020-02-14 |
Family
ID=69439715
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910909838.5A Withdrawn CN110795234A (en) | 2019-09-25 | 2019-09-25 | Resource scheduling method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110795234A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112256420A (en) * | 2020-10-30 | 2021-01-22 | 重庆紫光华山智安科技有限公司 | Task allocation method and device and electronic equipment |
| WO2021233261A1 (en) * | 2020-05-18 | 2021-11-25 | 鹏城实验室 | Multi-task dynamic resource scheduling method |
| CN116225664A (en) * | 2023-04-25 | 2023-06-06 | 中国人民解放军军事科学院系统工程研究院 | Preemptive scheduling method based on task priority of cloud video system |
-
2019
- 2019-09-25 CN CN201910909838.5A patent/CN110795234A/en not_active Withdrawn
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2021233261A1 (en) * | 2020-05-18 | 2021-11-25 | 鹏城实验室 | Multi-task dynamic resource scheduling method |
| CN112256420A (en) * | 2020-10-30 | 2021-01-22 | 重庆紫光华山智安科技有限公司 | Task allocation method and device and electronic equipment |
| CN116225664A (en) * | 2023-04-25 | 2023-06-06 | 中国人民解放军军事科学院系统工程研究院 | Preemptive scheduling method based on task priority of cloud video system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110647394B (en) | Resource allocation method, device and equipment | |
| US9319281B2 (en) | Resource management method, resource management device, and program product | |
| CN110795234A (en) | Resource scheduling method and device | |
| CN110413412B (en) | GPU (graphics processing Unit) cluster resource allocation method and device | |
| CN110597614B (en) | Resource adjustment method and device | |
| CN107818012B (en) | Data processing method and device and electronic equipment | |
| CN111309644B (en) | Memory allocation method and device and computer readable storage medium | |
| CN113608834A (en) | Resource scheduling method, device and equipment based on super-fusion and readable medium | |
| CN104252386A (en) | Data update locking method and equipment | |
| CN113254223B (en) | Resource allocation method and system after system restart and related components | |
| CN112214288B (en) | Pod scheduling method, device, equipment and medium based on Kubernetes cluster | |
| CN112099728B (en) | Method and device for executing write operation and read operation | |
| CN114546493A (en) | Core sharing method and device, processing core, electronic device and medium | |
| CN111831408A (en) | Asynchronous task processing method and device, electronic equipment and medium | |
| CN116260876A (en) | AI application scheduling method and device based on K8s and electronic equipment | |
| CN115202842A (en) | Task scheduling method and device | |
| CN114077493A (en) | Resource allocation method and related equipment | |
| CN108279982B (en) | Method, system and equipment for managing pbs resources and hadoop resources | |
| CN115878309A (en) | Resource allocation method, device, processing core, equipment and computer readable medium | |
| CN114691309A (en) | Batch business processing system, method and device | |
| CN108255820B (en) | Method and device for data storage in distributed system and electronic equipment | |
| CN112188514B (en) | Service processing method, network equipment and storage medium | |
| CN117519953B (en) | Separated memory management method for server-oriented non-perception calculation | |
| CN113608687A (en) | Space recovery method, device and equipment and readable storage medium | |
| CN115658302A (en) | Resource allocation method, device, equipment and readable storage medium |
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 | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20200214 |
|
| WW01 | Invention patent application withdrawn after publication |