CN109358961B - Resource scheduling method and device with storage function - Google Patents
Resource scheduling method and device with storage function Download PDFInfo
- Publication number
- CN109358961B CN109358961B CN201810925055.1A CN201810925055A CN109358961B CN 109358961 B CN109358961 B CN 109358961B CN 201810925055 A CN201810925055 A CN 201810925055A CN 109358961 B CN109358961 B CN 109358961B
- Authority
- CN
- China
- Prior art keywords
- cpu
- occupancy rate
- processing unit
- central processing
- resource
- 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
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- 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/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/50—Indexing scheme relating to G06F9/50
- G06F2209/5021—Priority
Abstract
The invention discloses a resource scheduling method and a device thereof and a device with a storage function, wherein the resource scheduling method comprises the following steps: acquiring the total current resource occupancy rate of a central processing unit in the system, and judging whether the total current resource occupancy rate is greater than or equal to a preset central processing unit resource alarm activation threshold or not; if yes, limiting the occupancy rate of the processes in the system to the central processing unit step by step according to the sequence of the priorities of the processes from low to high. By the mode, the system can be ensured to run smoothly, and user experience is improved.
Description
Technical Field
The present invention relates to the field of operating systems, and in particular, to a resource scheduling method and apparatus, and an apparatus having a storage function.
Background
In the Linux system, it is very common phenomenon to run a plurality of processes simultaneously. However, for a specific Linux device, the CPU resources are limited, and if a plurality of even infinite possible processes are to be run, the problem of scheduling the CPU resources is inevitably encountered, and if the processes are not processed, important processes cannot obtain the corresponding CPU resource guarantee, thereby causing extremely poor user experience.
Disclosure of Invention
The invention mainly solves the technical problem of providing a resource scheduling method and a device thereof and a device with a storage function, which can ensure the smooth operation of a system and improve the user experience.
In order to solve the technical problems, the invention adopts a technical scheme that: a resource scheduling method is provided, which comprises the following steps: acquiring the total current resource occupancy rate of a central processing unit in the system, and judging whether the total current resource occupancy rate is greater than or equal to a preset central processing unit resource alarm activation threshold or not; if so, gradually limiting the occupancy rate of the process in the system to the central processing unit according to the sequence of the process priority from low to high.
In order to solve the technical problem, the invention adopts another technical scheme that: provided is a resource scheduling apparatus including: a processor coupled to each other, a memory for storing program data, the processor being configured to execute the program data to implement the method as described above.
In order to solve the technical problem, the invention adopts another technical scheme that: there is provided an apparatus having a storage function, storing program data executable to implement the steps in the method as described above.
The invention has the beneficial effects that: different from the situation in the prior art, when the total occupancy rate of the current resources of the CPU is detected to exceed the standard, the occupancy rate of the processes in the system to the CPU is gradually limited according to the sequence of the priorities of the processes from low to high, partial resources of the CPU are released by limiting the occupancy rate of the processes with low priorities to the CPU, and then sufficient CPU resource guarantee is provided for the operation of the processes with high priorities, the normal operation of the system can be ensured, and the user experience is improved.
Drawings
Fig. 1 is a flowchart illustrating a resource scheduling method according to a first embodiment of the present invention;
FIG. 2 is a flowchart illustrating an embodiment of a method for limiting CPU occupancy by processes in a system according to the present invention;
FIG. 3 is a flowchart illustrating a resource scheduling method according to a second embodiment of the present invention;
FIG. 4 is a flowchart illustrating a resource scheduling method according to a third embodiment of the present invention;
FIG. 5 is a flowchart illustrating a resource scheduling method according to a fourth embodiment of the present invention;
FIG. 6 is a flowchart illustrating an embodiment of a method for releasing a CPU occupancy restriction of a process in a system according to the present invention;
fig. 7 is a flowchart illustrating a resource scheduling method according to a fifth embodiment of the present invention;
fig. 8 is a flowchart illustrating a resource scheduling method according to a sixth embodiment of the present invention;
fig. 9 is a schematic structural diagram of a resource scheduling apparatus according to an embodiment of the present invention;
fig. 10 is a schematic structural diagram of an embodiment of the apparatus with a storage function according to 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 only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be obtained by a person skilled in the art without any inventive step based on the embodiments of the present invention, are within the scope of the present invention.
Referring to fig. 1, fig. 1 is a flowchart illustrating a resource scheduling method according to a first embodiment of the present invention. The resource scheduling method provided by the invention comprises the following steps:
s101: and periodically acquiring the total current resource occupancy rate of a central processing unit in the system.
In a specific implementation scenario, a total current resource occupancy rate of a Central Processing Unit (CPU) in the system is obtained. In this implementation scenario, the method is periodically executed, and in other implementation scenarios, the method may also be executed under a condition, for example, a manual departure by a user is detected, or a CPU temperature is higher than a preset threshold.
S102: and judging whether the total occupancy rate of the current resources is greater than or equal to a preset central processing unit resource alarm activation threshold or not.
In a specific implementation scenario, the total current resource occupancy rate is compared with a preset CPU resource alarm activation threshold, and whether the total current resource occupancy rate of the CPU is greater than or equal to the preset CPU resource alarm activation threshold is determined, where the CPU resource alarm activation threshold is a maximum value that the CPU resource can be occupied, and if the occupied resource of the CPU exceeds the maximum value, a resource alarm is issued to notify a user that the current CPU resource is excessively occupied, which may affect the operation of an important process.
S103: if so, gradually limiting the occupancy rate of the process in the system to the central processing unit according to the sequence of the process priority from low to high.
In a specific implementation scenario, if the total resource occupancy rate is greater than or equal to the preset central processing unit resource alarm activation threshold, it indicates that the resource occupancy rate of the current central processing unit is too high, which may affect some important processes to obtain the required resources, thereby causing the system to operate in a stuck state. Therefore, the CPU resource is released by adopting the method of limiting the CPU occupancy rate of the process in the system, and in the implementation scene, the CPU occupancy rate of the process in the system is gradually limited according to the sequence of the process priority from low to high. Therefore, under the condition of extremely limited resources, the processes with low priority and low importance are firstly limited to the occupancy rate of the CPU, and the processes with high priority and high importance can keep the original occupancy rate of the CPU as much as possible.
Specifically, please refer to fig. 2 in combination, fig. 2 is a flowchart illustrating an embodiment of a method for limiting CPU occupancy by a process in a system according to the present invention. The method for limiting the occupancy rate of the process in the system to the CPU comprises the following steps:
s201: and judging whether the priority of the currently scheduled process is lower than the highest priority of all processes in the system.
In a specific implementation scenario, the priorities of all processes are obtained, and the highest priority among all the processes is determined. And judging whether the priority of the currently scheduled process is lower than the highest priority. In other implementation scenarios, one priority may be pre-assigned as the highest priority.
S202: if the current occupancy rate of the process to the central processing unit exceeds the guaranteed central processing unit occupancy rate of the process, judging whether the current occupancy rate of the process to the central processing unit exceeds the guaranteed central processing unit occupancy rate of the process.
In a specific implementation scenario, if the priority of the currently scheduled process is lower than the highest priority, it indicates that the currently scheduled process is of low importance and may limit its CPU occupancy, but when the CPU occupancy of the process is too low, the normal operation of the process may be affected. Therefore, whether the CPU occupancy rate of the currently scheduled process exceeds the guaranteed CPU occupancy rate of the process is judged, wherein the guaranteed CPU occupancy rate refers to the lowest CPU occupancy rate required by the process to run.
In other implementation scenarios, a priority is pre-assigned as the highest priority, and if the priority of the currently scheduled process is higher than the assigned highest priority, the occupancy of the CPU by the process is not limited.
S203: and if so, limiting the occupancy rate of the process to the central processing unit.
After executing S202 or S203, according to the sequence of the process priorities from low to high, taking the process behind the currently scheduled process as a new currently scheduled process, and repeating the above S201-S203 until the priority of the currently scheduled process is not lower than the highest priority of all processes in the system, or the total resource occupancy rate of the CPU is smaller than the preset central processor resource alarm activation threshold.
In a specific implementation scenario, if the CPU occupancy rate of the currently scheduled process exceeds the guaranteed CPU occupancy rate of the process, the CPU occupancy rate of the currently scheduled process is limited to the guaranteed CPU occupancy rate of the process.
In another implementation scenario, the executable step number of the currently scheduled process may be obtained, and the occupancy rate of the currently scheduled process to the CPU is limited according to the step number, for example, if the executable step number of the currently scheduled process is 3, the occupancy rate of the currently scheduled process to the CPU is limited to the guaranteed CPU occupancy rate of the process by 3 steps.
In another implementation scenario, in the process of gradually limiting the CPU occupancy rate of the currently scheduled process, each time the process of limiting the CPU occupancy rate of the currently scheduled process is executed, it is checked whether the current CPU occupancy rate exceeds the CPU resource alarm activation threshold, and if the current CPU occupancy rate does not exceed the CPU resource alarm activation threshold, the limitation of the CPU occupancy rate by the process is stopped.
In other implementation scenarios, if the CPU occupancy of the currently scheduled process does not exceed the guaranteed CPU occupancy of the process, the CPU occupancy of the process is not limited.
In this implementation scenario, the limitation may be performed starting from the process with the lowest priority, and the CPU occupancy rate of each process may be gradually limited in the order from the lowest priority to the highest priority. In other implementation scenarios, the restriction may be performed starting from any one process.
In this implementation scenario, after the CPU occupancy rate of a process in the system is completed, no other operations are performed. But waits for the next cycle, and after acquiring the total occupancy rate of the current CPU, the steps S102 to S103 are executed again.
In this implementation scenario, the system is a Linux system, and in other implementation scenarios, the system may also be other operating systems, such as a Windows system.
According to the description, when the total occupancy rate of the current resources of the CPU is detected to exceed the standard, the occupancy rate of the processes in the system to the CPU is gradually limited according to the sequence from low to high of the priority of the processes, so that the resources of the CPU can be effectively released under the condition of not influencing the running of the processes, sufficient resource guarantee is provided for the running of the processes with high priority, the smooth running of the system can be ensured, and the user experience is improved.
Referring to fig. 3, fig. 3 is a flowchart illustrating a resource scheduling method according to a second embodiment of the present invention. The resource scheduling method provided by the invention comprises the following steps:
s301: the total resource occupancy rate of CPU S _ CpuUsageRate > is CPU resource alarm activation threshold G _ CpuAlarmThreshold.
In a specific implementation scenario, in a period, after acquiring the total resource occupancy rate S _ CpuUsageRate of the current CPU, it is determined that S _ CpuUsageRate > -CPU resource alarm activation threshold G _ CpuAlarmThreshold, where G _ CpuAlarmThreshold is a preset CPU resource alarm activation threshold. Indicating the highest value allowed by the total occupancy rate of the CPU resource under the condition of not influencing the operation of all current processes.
S302: it is determined whether the current scheduling state SM _ Status of the system is equal to 1.
In a specific implementation scenario, it is detected that S _ CpuUsageRate > is G _ CpuAlarmThreshold, which indicates that the total resource occupancy of the current CPU is too high, which may affect smooth operation of the processes with high priority and high importance, and therefore, the occupancy of the CPU by each running process needs to be limited. In the implementation scenario, when it is determined that the occupancy rate of the CPU needs to be limited by each process, the value of SM _ Status is read, and the current scheduling state of the system is obtained.
In this implementation scenario, when SM _ Status is 0, it indicates that the system is currently in scheduling; when SM _ Status is 1, the occupancy rate of all processes to be scheduled to the CPU is limited to the lowest, namely the occupancy rate of each process to the CPU is guaranteed; when SM _ Status is 2, it means that the CPU occupancy has been released by all processes to be scheduled. When detecting that S _ cpuusagate > is G _ cpuaalarmthreshold, determining whether SM _ Status is equal to 1, that is, determining whether the CPU occupancy of all processes to be scheduled is limited to the minimum, if SM _ Status is 1, it indicates that the CPU occupancy is the minimum required to maintain the current system operation, and cannot further release the CPU resource, so step S313 is executed to end the resource scheduling. If SM _ Status ≠ 1, it indicates that the CPU occupancy of the processes is not limited to the lowest, and the CPU resources can be released by limiting the CPU occupancy of the processes, and step S303 is executed.
S303: and judging whether the priority sequence number SM _ ProcDispatchNum of the currently scheduled process is equal to null or not.
In a specific implementation scenario, if SM _ ProcDispatchNum ≠ null, it indicates that no process is currently scheduled, step S304 is executed, if SM _ ProcDispatchNum ≠ null, it indicates that the system is currently in a scheduling state, and the value of SM _ ProcDispatchNum is the priority number of the currently scheduled process, and step S305 is executed.
S304: making the priority sequence number SM _ ProcDispatchNum of the currently scheduled process equal to the lowest priority sequence number G _ ProcPrioritylwestNum;
let the real value SM _ proclimitcurrate to which the current CPU occupancy is limited null.
In a specific implementation scenario, SM _ proc dispatchnum is null, which indicates that no process is currently scheduled, and SM _ proc dispatchnum is G _ proc prioritylwestnum, that is, if scheduling has not started, scheduling is started from a process with the lowest priority, and SM _ proc limit cpurrate is null, that is, if scheduling has not started, the true value to which the current CPU occupancy is limited is null, so that a suitable value is filled in when performing the subsequent execution. Step S308 is performed. In this implementation scenario, the system first obtains the priority sequence numbers of all processes to be scheduled, and finds out the lowest priority sequence number G _ ProcPriority lowestNum. In other implementation scenarios, one priority number may be pre-assigned as the lowest priority number.
S305: it is determined whether the priority order number SM _ ProcDispatchNum of the currently scheduled process is greater than or equal to the highest priority order number G _ ProcPriorityHighestNum.
In a specific implementation scenario, the system first obtains the priority sequence numbers of all processes to be scheduled, and finds out the highest priority sequence number G _ ProcPriorityHighestNum. In other implementation scenarios, one priority order number may be pre-designated as the highest priority order number. In this implementation scenario, SM _ ProcDispatchNum ≠ null, that is, the system is currently in the resource scheduling state, and the value of SM _ ProcDispatchNum is the priority sequence number of the currently scheduled process. The SM _ proc dispatch num is compared with the G _ proc priority highestnum in size, and in this implementation scenario, the higher the priority number of a process is, the lower the priority of the process is, for example, the priority of the process with the priority number of 99 is lower than the priority of the process with the priority number of 1. If SM _ ProcDispatchNum > -G _ ProcPriorityHighestNum, indicating that the priority of the currently scheduled process is lower than or equal to the highest priority, the process may be restricted from the occupancy of the CPU, and step S307 is performed. If SM _ ProcDispatchNum < G _ ProcPriorityHighestNum, indicating that the priority of the currently scheduled process is higher than the highest priority, it means that the CPU occupancy of all schedulable processes has been limited, step S306 is performed.
S306: the current scheduling state SM _ Status of the system is 1;
the priority sequence number SM _ ProcDispatchNum of the currently scheduled process is null;
the real value SM _ proclimitcurrate to which the current CPU occupancy is limited to null.
In one particular implementation scenario, SM _ procdispatch num < G _ ProcPriorityHighestNum. Therefore, the value of SM _ Status is set to 1, which indicates that all the processes to be scheduled have the minimum CPU occupancy, and the SM _ ProcDispatchNum and SM _ proclimit CPU Rate are made null, which indicates that this resource scheduling is finished, and no other process is currently scheduled, and step S313 is executed to finish this resource scheduling.
S307: it is determined whether the true value SM _ proclimitcurrate to which the current CPU occupancy is limited is equal to null.
In a specific implementation scenario, SM _ proc dispatch num > is G _ proc priority highestnum, and needs to limit the CPU occupancy rate of the currently scheduled process, and SM _ proc limit cpurrate ═ null, which indicates that the CPU occupancy rate of the currently scheduled process is not limited yet, step S308 is executed. If SM _ proclimitcurrate ≠ null, it indicates that the occupancy rate of the currently scheduled process to the CPU has been limited, the value of SM _ proclimitcurrate is the real value to which the occupancy rate of the currently scheduled process to the CPU is limited, and step S309 may be executed to further limit.
S308: the real value SM _ proclimitcuprate to which the current CPU occupancy is limited is the maximum occupancy L _ procmaxcuprate [ SM _ ProcDispatc hNum ] to the CPU for the process with the priority index SM _ ProcDispatchNum.
In a specific implementation scenario, if SM _ proclimitcuprate is null, let SM _ proclimitcuprate be L _ procmaxcuprate [ SM _ ProcDispatchNum ], that is, the maximum CPU utilization rate of the process whose current CPU utilization rate is limited to the real value whose priority sequence number is SM _ ProcDispatchNum.
S309: whether the true value SM _ ProcLimitCpuRate to which the current CPU occupancy is limited is greater than or equal to the guaranteed occupancy L _ ProcDisCpuRate [ SM _ ProcDispatchNum ] of the process with the priority index SM _ ProcDispatcNum to the CPU is judged.
In a specific implementation scenario, L _ procmlncpru rate [ SM _ procdisctchnum ] is the minimum CPU utilization rate required for running a process with a priority sequence number of SM _ procdisctchnum. If SM _ proclimit cpurate > -L _ procmlncpu Rate [ SM _ proc dispatchnum ], then the CPU occupancy Rate of the process is higher than the minimum occupancy Rate, step S310 is executed to limit the CPU occupancy Rate of the process, if SM _ proclimit cpurate < L _ procmlncpu Rate [ SM _ proc dispatchnum ], then the CPU occupancy Rate of the process is lower than the minimum occupancy Rate, and the CPU occupancy Rate cannot be limited any more, step S312 is executed.
S310: and limiting the CPU occupancy rate of the process with the priority sequence number of SM _ ProcDispatchNum to a real value SM _ ProcLimitCpuRate to which the current CPU occupancy rate is limited.
In a specific implementation scenario, SM _ proclimitcurrate > -L _ procmlnccpurrate [ SM _ ProcDispatchNum ], the CPU utilization of the process is higher than the minimum utilization, and therefore the CPU utilization of the process with the priority number SM _ ProcDispatchNum is limited.
S311：SM_ProcLimitCpuRate＝SM_ProcLimitCpuRate-L_CpuDispatchStep[SM_ProcDispatchNum]；
The current scheduling state SM _ Status of the system is 0.
In a specific implementation scenario, L _ cptdischstepp indicates the number of steps of the process during resource scheduling, and SM _ proclimitcuprate-L _ cptdischstepp [ SM _ ProcDispatchNum ] indicates that the process with the priority number SM _ ProcDispatchNum gradually limits the CPU occupancy rate according to the number of steps. For example, if the L _ cpudispatch step of a process with the priority number SM _ ProcDispatchNum is 3, the CPU utilization rate of the process is limited to its L _ procmincpurrate in 3 steps.
After the process is finished to limit the occupancy rate of the CPU, the value of SM _ Status is set to 0, which indicates that the system is currently in scheduling, and then step S313 is executed to end the resource scheduling for the process this time.
S312: the priority sequence number SM _ ProcDispatchNum-1 of the currently scheduled process;
the true value SM _ proclimitcuprate to which the current CPU occupancy is limited is null;
the current scheduling state SM _ Status of the system is 0.
In a specific implementation scenario, SM _ proclimitcppurrate < L _ procmincpurrate [ SM _ ProcDispatchNum ], where the process cannot further limit the CPU occupancy, the process decrements SM _ ProcDispatchNum by 1, and in the next cycle, the process with the priority level higher than 1 will be executed to limit the CPU occupancy. Let SM _ proclimitcuprate be null, which indicates that the limitation of the CPU occupancy of the process in the current resource scheduling is completed, set the value of SM _ Status to 0, which indicates that the system is currently in scheduling, then execute step S313, and end the current resource scheduling.
S313：Exit。
And ending the resource scheduling.
In this implementation scenario, the resource scheduling method is executed according to a fixed period, and in other implementation scenarios, the resource scheduling method may be triggered by an event, for example, when a process with a priority higher than a preset threshold is detected to be started, or when an occupancy rate of a central processing unit is detected to be higher than the preset threshold, the resource scheduling method is executed.
In this implementation scenario, the system is a Linux system, and in other implementation scenarios, the system may also be other operating systems, such as a Windows system.
As can be seen from the above description, in this embodiment, when it is detected that the total CPU resource occupancy rate S _ CpuUsageRate exceeds the CPU resource alarm activation threshold G _ CpuAlarmThreshold, the occupancy rates of the processes in the system to the CPU are gradually limited according to the sequence from the low priority to the high priority, so that the CPU resources can be effectively released without affecting the process operation, an adequate resource guarantee is provided for the important process with the high priority, the system operation can be ensured to be smooth, and the user experience can be improved.
Referring to fig. 4, fig. 4 is a flowchart illustrating a resource scheduling method according to a third embodiment of the present invention. The resource scheduling method provided by the invention comprises the following steps:
s401: and periodically acquiring the total current resource occupancy rate of a central processing unit in the system.
S402: and judging whether the total occupancy rate of the current resources is greater than or equal to a preset central processing unit resource alarm activation threshold or not.
Steps S401 to S402 in this embodiment are substantially the same as steps S101 to S102 in the first embodiment of the resource scheduling method provided by the present invention, and are not described herein again.
S403: if the total occupancy rate of the current resources is less than the alarm activation threshold of the central processing unit resources, whether the total occupancy rate of the current resources is greater than or equal to a preset safety threshold of the central processing unit resources is judged.
In a specific implementation scenario, in addition to the CPU resource alarm activation threshold, a CPU resource security threshold is also preset, and the CPU resource security threshold is lower than the CPU resource alarm activation threshold. And when the total CPU resource occupancy rate is judged to be less than the CPU resource alarm activation threshold, further judging the total CPU resource occupancy rate and the CPU resource safety threshold.
S404: and if the total occupancy rate of the current resources is greater than or equal to the safety threshold of the resources of the central processing unit, maintaining the current resource scheduling condition.
In a specific implementation scenario, if the total occupancy rate of the current resources of the CPU is greater than or equal to the security threshold of the resources of the CPU and is less than the alarm activation threshold of the resources of the CPU, it indicates that the current resources of the CPU are abundant, and there is no surplus resources required for the operation of the important process. Therefore, the current resource scheduling condition is maintained without the step of resource scheduling.
In this implementation scenario, the resource scheduling method is executed according to a fixed period, and in other implementation scenarios, the resource scheduling method may be triggered by an event, for example, it is detected that a user manually starts the resource scheduling method, or it is detected that a CPU temperature exceeds a preset threshold. In the implementation scenario, the total current resource occupancy rate in the period is greater than or equal to the central processing unit resource security threshold, the current resource scheduling condition is maintained, in the next period, the total current resource occupancy rate of the central processing unit is continuously obtained, and the steps S401 to S404 are repeated.
In this implementation scenario, the system is a Linux system, and in other implementation scenarios, the system may also be other operating systems, such as a Windows system.
As can be seen from the above description, when it is detected that the total CPU resource occupancy is equal to or greater than the CPU resource security threshold and is less than the CPU resource alarm activation threshold, the present embodiment maintains the current resource scheduling condition, so as to ensure that the CPU resource is not excessive and causes resource waste, and also effectively releases the CPU resource under the condition that the CPU resource is insufficient, so as to provide sufficient resource guarantee for the important process operation, ensure that the system operation is smooth, and improve the user experience.
Referring to fig. 5, fig. 5 is a flowchart illustrating a resource scheduling method according to a fourth embodiment of the present invention. The resource scheduling method provided by the invention comprises the following steps:
s501: and periodically acquiring the total current resource occupancy rate of a central processing unit in the system.
S502: and judging whether the total occupancy rate of the current resources is greater than or equal to a preset central processing unit resource alarm activation threshold or not.
S503: if the total occupancy rate of the current resources is less than the alarm activation threshold of the central processing unit resources, whether the total occupancy rate of the current resources is greater than or equal to a preset safety threshold of the central processing unit resources is judged.
Steps S501 to S503 in this embodiment are substantially the same as steps S401 to S403 in the third embodiment of the resource scheduling method provided by the present invention, and are not described herein again.
S504: if the total occupancy rate of the current resources is less than the safety threshold of the resources of the central processing unit, judging whether the total occupancy rate of the current resources is greater than or equal to a preset alarm cancellation threshold of the resources of the central processing unit.
In a specific implementation scenario, a CPU resource alarm cancellation threshold is preset, and the CPU resource alarm cancellation threshold is smaller than a CPU resource security threshold. If the total occupancy rate of the current resources of the CPU is less than the safety threshold of the resources of the CPU, the current resources of the CPU are sufficient, and the limitation of some processes on the occupancy rate of the CPU can be removed.
S505: and if the total occupancy rate of the current resources is greater than or equal to the alarm cancellation threshold of the central processing unit resources, gradually releasing the limitation of the occupancy rate of the central processing unit by the process in the system from high to low according to the priority.
In a specific implementation scenario, if the total CPU resource occupancy is less than the CPU resource security threshold but greater than or equal to the CPU resource alarm cancellation threshold, it indicates that the current CPU resource is excessive, and the CPU occupancy may be released by some processes. In the implementation scenario, the occupancy rate of the process in the system to the CPU is gradually limited according to the sequence of the priority from high to low, so that the process with high priority and high importance can preferentially enjoy sufficient CPU resources, which is beneficial to the smooth operation of the important process.
Specifically, please refer to fig. 6 in combination, fig. 6 is a flowchart illustrating an embodiment of a method for releasing the limit on the CPU occupancy of the process in the system according to the present invention. The method for releasing the limit of the process in the system on the occupancy rate of the CPU comprises the following steps:
s601: and judging whether the priority of the currently scheduled process is higher than the lowest priority.
In a specific implementation scenario, the priorities of all processes are obtained, and the lowest priority among all the processes is determined. In other implementation scenarios, a priority may be pre-assigned as the lowest priority. And comparing the priority of the currently scheduled process with the lowest priority, and judging whether the priority of the currently scheduled process is higher than the lowest priority.
S602: and if so, releasing the occupancy limit of the currently scheduled process to the central processing unit.
In a specific implementation scenario, if the priority of the currently scheduled process is higher than the lowest priority, the CPU occupancy of the process is released, for example, the CPU occupancy of the process may be restored to the maximum CPU occupancy. In other implementation scenarios, if the priority of the previously scheduled process is higher than the lowest priority, then the limit on the occupancy of the CPU by that process is preserved.
In this implementation scenario, the resource scheduling method is executed according to a fixed period, and in other implementation scenarios, the resource scheduling method may be triggered by an event, for example, it is detected that a user manually starts the resource scheduling method, or it is detected that a CPU temperature exceeds a preset threshold. In the implementation scenario, after the limitation of a process on the CPU occupancy rate is removed in this cycle, no other operation is performed, and in the next cycle, the total CPU resource occupancy rate is continuously obtained, and steps S501 to S505 are repeated.
In this implementation scenario, the system is a Linux system, and in other implementation scenarios, the system may also be other operating systems, such as a Windows system.
As can be seen from the above description, in this embodiment, when it is detected that the total resource occupancy is less than the CPU resource security threshold and is greater than or equal to the preset CPU resource alarm cancellation threshold, the occupancy of the processes in the system to the CPU is gradually limited according to the sequence from high priority to low priority, and when the CPU resource is excessive, the processes with high priority and high importance preferentially occupy more CPU resources, so that the operating efficiency of the important processes can be improved, resource waste is avoided, and user experience is improved.
Referring to fig. 7, fig. 7 is a flowchart illustrating a resource scheduling method according to a fifth embodiment of the present invention. The resource scheduling method provided by the invention comprises the following steps:
s701: CPU current resource total occupancy S _ CpuUsageRate > -CPU resource alarm activation threshold G _ cpunonalarmthreshold and CPU current resource total occupancy S _ CpuUsageRate < CPU resource security threshold G _ cpusafeffhreshold.
In a specific implementation scenario, when G _ cpuunatmthreshold < ═ S _ CpuUs agenrate < G _ cpuafethrreshold is detected, it indicates that the total resource occupancy of the current CPU is low, which may cause resource waste, and therefore, it is necessary to release the limit of at least part of the processes on the CPU occupancy to fully utilize the resources of the CPU.
S702: it is determined whether the current scheduling state SM _ Status of the system is equal to 2.
In the implementation scenario, when it is determined that the CPU occupancy needs to be released by each process, the current scheduling state SM _ Status value of the system is read.
In this implementation scenario, when SM _ Status is 0, it indicates that the system is currently in scheduling; when SM _ Status is 1, the occupancy rate of all processes to be scheduled to the CPU is limited to the lowest, namely the occupancy rate of each process to the CPU is guaranteed; when SM _ Status is 2, it means that the CPU occupancy has been released by all processes to be scheduled. When SM _ Status is 2, no process to be scheduled needs to release its limitation on CPU occupation, execute step S709, and end this resource scheduling. When SM _ Status ≠ 2, there may be a case that the process to be scheduled can release its limitation on the CPU occupancy, and step S703 is executed.
S703: and judging whether the priority sequence number SM _ ProcDispatchNum of the process scheduled before is null or not.
In a specific implementation scenario, if SM _ ProcDispatchNum ≠ null, it indicates that no process is currently scheduled, step S704 is executed, if SM _ ProcDispatchNum ≠ null, it indicates that the system is currently in a scheduling state, and the value of SM _ ProcDispatchNum is the priority number of the currently scheduled process, and step S705 is executed.
S704: the priority sequence number SM _ ProcDispatchNum of the currently scheduled process is made to be the highest priority sequence number G _ ProcPrioritylhexestNum;
the current scheduling state SM _ proclimitcurrate of the system is null.
In a specific implementation scenario, SM _ proc dispatchnum is null, which indicates that no process is currently scheduled, and M _ proc dispatchnum is G _ proc priorityhesthestnum, that is, if the scheduling has not started, the scheduling is started from the process with the highest priority, and step S707 is executed. In this implementation scenario, the system first obtains the priority sequence numbers of all processes to be scheduled, and finds out the highest priority sequence number G _ procprioritythiteghestnum. In other implementation scenarios, one priority order number may be pre-designated as the highest priority order number. When SM _ Status is 0, it indicates that the system is currently in scheduling.
S705: it is determined whether the priority order number SM _ ProcDispatchNum of the currently scheduled process is less than or equal to the lowest priority order number G _ procpriorityllowestnum.
In a specific implementation scenario, the system first obtains priority sequence numbers of all processes to be scheduled, and finds out the lowest priority sequence number G _ ProcPriorityLowestNum. In other implementation scenarios, one priority order number may be pre-designated as the highest priority order number. In this implementation scenario, SM _ ProcDispatchNum ≠ null, that is, the system is currently in the resource scheduling state, and the value of SM _ ProcDispatchNum is the priority sequence number of the currently scheduled process. The SM _ proc dispatch num is compared with the G _ proc priority lowestnum in size, and in this implementation scenario, the higher the priority number of a process is, the lower the priority of the process is, for example, the priority of the process with the priority number of 99 is lower than the priority of the process with the priority number of 1. If SM _ ProcDispatchNum < ═ G _ ProcPriorityLowestNum indicates that the priority of the currently scheduled process is higher than or equal to the lowest priority, the process can be de-limited in its occupancy to the CPU. If SM _ ProcDispatchNum > G _ ProcPriorityHighestNum, indicating that the priority of the currently scheduled process is lower than the lowest priority, it means that the limit of all schedulable processes on the occupancy of the CPU has been released, step S706 is performed.
S706: the current scheduling state SM _ Status of the system is made to be 2;
the priority sequence number SM _ ProcDispatchNum of the currently scheduled process is null;
the real value SM _ proclimitcurrate to which the current CPU occupancy is limited to null.
In a specific implementation scenario, SM _ proc dispatch num ═ G _ procpriorityllowestnum. Therefore, the value of SM _ Status is set to 2, which indicates that all processes to be scheduled have released the limitation on the CPU occupancy, SM _ ProcDispatchNum is null, and SM _ ProcLimitCpu Rate is null, which indicates that this resource scheduling is finished, step 709 is executed, and this resource scheduling is finished.
S707: and releasing the occupancy limit of the process with the number of SM _ ProcDispatchNum to the CPU.
In a specific implementation scenario, SM _ proclimitcurrate < ═ G _ procpriorityllowestnum releases the CPU occupancy limit of the process, and further, the CPU occupancy may be set to be the maximum CPU occupancy L _ ProcMaxCpuRate [ SM _ ProcDispatc hNum ].
S708: the priority sequence number SM _ ProcDispatchNum +1 of the currently scheduled process;
the true value SM _ proclimitcuprate to which the current CPU occupancy is limited is null;
the current scheduling state SM _ Status of the system is 0.
In a specific implementation scenario, if the limit of the CPU occupancy rate by the process has been released, the SM _ ProcDispatchNum is added by 1, and in the subsequent step, the limit of the CPU occupancy rate is performed on the process with the priority lower than 1. Let SM _ proclimitcuprate be null, which indicates that the limitation of the resource scheduling to the CPU occupancy of the process has been completed, set the value of SM _ Status to 0, which indicates that the system is currently in scheduling, then execute step S709, and end the resource scheduling.
S709：Exit.
And finishing the scheduling.
In this implementation scenario, the resource scheduling method is executed according to a fixed period, and in other implementation scenarios, the resource scheduling method may be triggered by an event, for example, when a process with a priority higher than a preset threshold is detected to be started, or when an occupancy rate of a central processing unit is detected to be higher than the preset threshold, the resource scheduling method is executed.
In this implementation scenario, the system is a Linux system, and in other implementation scenarios, the system may also be other operating systems, such as a Windows system.
As can be seen from the above description, in this embodiment, when it is detected that the CPU resource alarm activation threshold G _ cpuunatththreshold is less than the CPU current resource total occupancy rate S _ CpuUs agenrate and less than the CPU resource safety threshold G _ cpuafethresholded, the CPU is sequentially released from the process with the highest priority according to the priority from top to bottom, so that the process with the high priority and the high importance occupies more CPU resources, the operating efficiency of the important process can be improved, resource waste is avoided, and user experience is improved.
Referring to fig. 8, fig. 8 is a flowchart illustrating a resource scheduling method according to a sixth embodiment of the present invention. The resource scheduling method provided by the invention comprises the following steps:
s801: and periodically acquiring the total current resource occupancy rate of a central processing unit in the system.
S802: and judging whether the total occupancy rate of the current resources is greater than or equal to a preset central processing unit resource alarm activation threshold or not.
S803: if the total occupancy rate of the current resources is less than the alarm activation threshold of the central processing unit resources, whether the total occupancy rate of the current resources is greater than or equal to a preset safety threshold of the central processing unit resources is judged.
S804: if the total occupancy rate of the current resources is less than the safety threshold of the resources of the central processing unit, judging whether the total occupancy rate of the current resources is greater than or equal to a preset alarm cancellation threshold of the resources of the central processing unit.
Steps S801 to S804 in this embodiment are substantially the same as steps S501 to S504 in the fourth embodiment of the resource scheduling method provided by the present invention, and are not described here again.
S805: and if the total occupancy rate of the system central processing unit resource is less than the alarm cancellation threshold of the system central processing unit resource, releasing the occupancy rate limitation of all the processes in the system to the central processing unit.
In a specific implementation scenario, the CPU resource alarm cancellation threshold is smaller than the CPU resource security threshold, and when the total CPU resource occupancy is smaller than the CPU resource security threshold, the total CPU resource occupancy is compared with the CPU resource alarm cancellation threshold. If the total occupancy rate of the CPU resource is less than the alarm cancellation threshold of the CPU resource, the CPU resource is seriously excessive, and the limitation of all processes in the system on the occupancy rate of the CPU is removed, so that the waste of the CPU resource is avoided.
In this implementation scenario, the resource scheduling method is executed according to a fixed period, and in other implementation scenarios, the resource scheduling method may be triggered by an event, for example, it is detected that a user manually starts the resource scheduling method, or it is detected that a CPU temperature exceeds a preset threshold. In the implementation scenario, after the limitation of all processes on the CPU occupancy is removed in this cycle, no other operation is performed, and in the next cycle, the total CPU resource occupancy is continuously obtained, and steps S801 to S805 are repeated.
In this implementation scenario, the system is a Linux system, and in other implementation scenarios, the system may also be other operating systems, such as a Windows system.
As can be seen from the above description, in this embodiment, when it is detected that the total occupancy rate of the CPU resource is less than the CPU resource alarm cancellation threshold, the limit of all processes in the system on the occupancy rate of the CPU is removed, and the CPU resource waste is avoided.
Referring to fig. 9, fig. 9 is a schematic structural diagram of a resource scheduling apparatus provided in the present invention. The resource scheduling device 10 includes: a processor 11, a memory 12 and a communication circuit 13, the memory 12 being used for storing program data, the processor 11 being used for operating the program data in the memory 12 to control the communication circuit 13 to communicate and to execute the following method:
in a specific implementation scenario, in a preset period, the total current resource occupancy rate of a Central Processing Unit (CPU) in the system is obtained, and the total current resource occupancy rate is compared with a preset CPU resource alarm activation threshold, to determine whether the total current resource occupancy rate of the CPU is greater than or equal to the preset CPU resource alarm activation threshold, where the CPU resource alarm activation threshold is the maximum value that the CPU resource can be occupied.
In this implementation scenario, the total resource occupancy rate of the CPU in this cycle is greater than or equal to the preset CPU resource alarm activation threshold, which indicates that the resource occupancy rate of the current CPU is too high, and may affect some important processes to obtain the required resources, thereby causing the system to operate in a stuck state. Therefore, the CPU occupancy rate of the process in the system is gradually limited according to the sequence of the process priority from low to high.
In another implementation scenario, in addition to the CPU resource alarm activation threshold, a CPU resource security threshold is also preset, where the CPU resource security threshold is lower than the CPU resource alarm activation threshold. And when the total CPU resource occupancy rate in the period is judged to be smaller than the CPU resource alarm activation threshold limit, further judging the total CPU resource occupancy rate in the period and the CPU resource safety threshold. And if the total occupancy rate of the current resources of the CPU is greater than or equal to the safety threshold of the resources of the CPU, the current resources of the CPU are fully utilized and the resources are not tense, and the current resource scheduling condition is maintained.
In another implementation scenario, a CPU resource alarm cancellation threshold is also preset, where the CPU resource alarm cancellation threshold is smaller than the CPU resource security threshold. If the total CPU resource occupancy rate in the period is less than the CPU resource safety threshold, the total CPU resource occupancy rate in the period is compared with the CPU resource alarm cancellation threshold, and if the total CPU resource occupancy rate is greater than or equal to the CPU resource alarm cancellation threshold, the CPU resource is indicated to be excessive, so that the limitation of some processes on the CPU occupancy rate can be relieved. In the implementation scenario, the occupancy rate of the processes in the system to the CPU is gradually limited according to the sequence of the priority from high to low, so that the processes with high priority and high importance can have sufficient CPU resources, and the smooth operation of the important processes is facilitated.
In another implementation scenario, the total occupancy rate of the current resources of the CPU in the period is less than the warning cancellation threshold of the resources of the CPU, which indicates that the resources of the CPU are seriously excessive, and the limitation of all processes in the system on the occupancy rate of the CPU is removed, so as to avoid the waste of the resources of the CPU.
As can be seen from the above description, in a preset period, the present embodiment compares the total CPU resource occupancy rate with the preset CPU resource alarm activation threshold, CPU resource security threshold and CPU resource alarm cancellation threshold, determines whether the current CPU resource is in use shortage or surplus according to the comparison result, and takes corresponding measures, so as to ensure that when the CPU resource is in shortage, the important process with high priority can have sufficient CPU resource, and when the CPU resource is surplus, the important process with high priority can preferentially release the limitation on the CPU occupancy rate, thereby occupying more CPU resources, so as to ensure smooth operation of the system, and avoid the CPU resource being wasted, thereby effectively improving the system working efficiency and improving the user experience.
Referring to fig. 10, fig. 10 is a schematic structural diagram of an embodiment of a device with a storage function according to the present invention. The device 20 with storage function has stored therein at least one program data 21, the program data 21 being used for performing the method of resource scheduling as shown in fig. 1-8. In one embodiment, the apparatus with storage function may be a storage chip in a terminal, a hard disk, or a removable hard disk or other readable and writable storage tool such as a flash disk, an optical disk, or the like, and may also be a server or the like.
It can be known from the above description that the program stored in the embodiment of the apparatus with storage function of the present invention can make the important process with high priority have sufficient CPU resources when the CPU resources are in short supply, and when the CPU resources are excessive, the important process with high priority can preferentially release the limitation on the CPU occupancy rate, thereby occupying more CPU resources, so as to ensure the smooth operation of the system, and avoid the CPU resources from being wasted, thereby effectively improving the system working efficiency and improving the user experience.
Different from the prior art, when the total CPU resource occupancy rate is greater than or equal to the preset CPU resource alarm activation threshold time, the invention gradually limits the CPU occupancy rate of the process in the system according to the sequence of the process priority from low to high; and when the CPU resource safety threshold is smaller than the CPU resource alarm activation threshold and is larger than or equal to the CPU resource safety threshold, maintaining the current resource scheduling condition. When the total occupancy rate of the current resources of the CPU is less than the safety threshold of the resources of the CPU and is more than or equal to the alarm cancellation threshold of the resources of the CPU, gradually limiting the occupancy rate of the processes in the system to the CPU according to the sequence of the priority from high to low; and when the total CPU resource occupancy rate is less than the CPU resource alarm cancellation threshold, the limit of all processes in the system on the CPU occupancy rate is removed. Therefore, when the CPU resource is in shortage, the important process with high priority can have sufficient CPU resource, and when the CPU resource is excessive, the important process with high priority can preferentially remove the limitation on the CPU occupancy rate, so that more CPU resources are occupied, the smooth operation of the system can be ensured, the CPU resource is prevented from being wasted, the working efficiency of the system can be effectively improved, and the user experience is improved.
The above description is only an embodiment of the present invention, and not intended to limit the scope of the present invention, and all modifications of equivalent structures and equivalent processes performed by the present specification and drawings, or directly or indirectly applied to other related technical fields, are included in the scope of the present invention.
Claims (8)
1. A method for scheduling resources, comprising:
periodically acquiring the total current resource occupancy rate of a central processing unit in the system;
judging whether the total occupancy rate of the current resources is greater than or equal to a preset central processing unit resource alarm activation threshold or not;
if so, gradually limiting the occupancy rate of the processes in the system to the central processing unit according to the sequence of the priority of the processes from low to high,
the step-by-step limitation of the occupancy rate of the process in the system to the central processing unit according to the sequence of the process priorities from low to high comprises the following steps:
judging whether the priority of the currently scheduled process is lower than the highest priority of all processes in the system;
if the current occupancy rate of the process to the central processing unit exceeds the guaranteed central processing unit occupancy rate of the process, judging whether the current occupancy rate of the process to the central processing unit exceeds the guaranteed central processing unit occupancy rate of the process;
if so, limiting the occupancy rate of the process to the central processing unit,
the limiting the central processor occupancy rate of the process comprises:
and gradually limiting the occupancy rate of the central processing unit of the process according to the step number of the currently scheduled process.
2. The method of claim 1, further comprising:
if the total occupancy rate of the current resources is less than the alarm activation threshold of the central processing unit resources, judging whether the total occupancy rate of the current resources is greater than or equal to a preset safety threshold of the central processing unit resources;
and if the total occupancy rate of the current resources is greater than or equal to the safety threshold of the resources of the central processing unit, maintaining the current resource scheduling condition.
3. The method of claim 2, further comprising:
if the total occupancy rate of the current resources is less than the safety threshold of the central processing unit resources, judging whether the total occupancy rate of the current resources is greater than or equal to a preset central processing unit resource alarm cancellation threshold;
and if the total occupancy rate of the current resources is greater than or equal to the alarm cancellation threshold of the central processing unit resources, gradually releasing the limitation of the occupancy rate of the central processing unit by the process in the system from high to low according to the priority.
4. The method of claim 3, wherein limiting the central processor occupancy of processes in the system step by step in order of priority from high to low comprises:
judging whether the priority of the currently scheduled process is higher than the lowest priority;
and if so, releasing the occupancy limit of the currently scheduled process to the central processing unit.
5. The method of claim 3, further comprising:
and if the total occupancy rate of the system central processing unit resource is less than the alarm cancellation threshold of the system central processing unit resource, releasing the occupancy rate limitation of all the processes in the system to the central processing unit.
6. The method according to any one of claims 1 to 5, wherein the system is a Linux system.
7. A resource scheduling apparatus, comprising: a processor coupled to each other, a memory for storing program data, the processor being configured to execute the program data to implement the method of any of claims 1-6.
8. An apparatus having memory means, wherein program data is stored, said program data being executable to implement the steps of the method according to any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810925055.1A CN109358961B (en) | 2018-08-14 | 2018-08-14 | Resource scheduling method and device with storage function |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810925055.1A CN109358961B (en) | 2018-08-14 | 2018-08-14 | Resource scheduling method and device with storage function |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109358961A CN109358961A (en) | 2019-02-19 |
| CN109358961B true CN109358961B (en) | 2021-12-21 |
Family
ID=65349979
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810925055.1A Active CN109358961B (en) | 2018-08-14 | 2018-08-14 | Resource scheduling method and device with storage function |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109358961B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112291205B (en) * | 2020-10-13 | 2023-04-07 | 杭州迪普科技股份有限公司 | Control method and device for deep packet inspection service and computer equipment |
| CN112328386A (en) * | 2021-01-05 | 2021-02-05 | 北京国科环宇科技股份有限公司 | Operating system process scheduling method, device, medium and electronic equipment |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1571538A (en) * | 2004-05-10 | 2005-01-26 | 中兴通讯股份有限公司 | A method for performing system load control on mobile switch center |
| US9063795B2 (en) * | 2012-12-19 | 2015-06-23 | International Business Machines Corporation | Adaptive resource usage limits for workload management |
| CN106095556A (en) * | 2016-06-20 | 2016-11-09 | 惠州Tcl移动通信有限公司 | A kind of method and system controlling terminal processes |
| CN106250216A (en) * | 2016-07-21 | 2016-12-21 | 宇龙计算机通信科技(深圳)有限公司 | A kind of method clearing up internal memory and terminal |
| CN107391259A (en) * | 2017-07-25 | 2017-11-24 | 广东欧珀移动通信有限公司 | Method for processing resource and device, computer-readable recording medium, mobile terminal |
| CN107402808A (en) * | 2017-07-31 | 2017-11-28 | 广东欧珀移动通信有限公司 | process management method, device, storage medium and electronic equipment |
| CN107704316A (en) * | 2017-08-04 | 2018-02-16 | 广东欧珀移动通信有限公司 | Applied program processing method, device, mobile terminal and storage medium |
| CN107861812A (en) * | 2017-10-30 | 2018-03-30 | 江西博瑞彤芸科技有限公司 | A kind of internal memory method for cleaning |
-
2018
- 2018-08-14 CN CN201810925055.1A patent/CN109358961B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1571538A (en) * | 2004-05-10 | 2005-01-26 | 中兴通讯股份有限公司 | A method for performing system load control on mobile switch center |
| US9063795B2 (en) * | 2012-12-19 | 2015-06-23 | International Business Machines Corporation | Adaptive resource usage limits for workload management |
| CN106095556A (en) * | 2016-06-20 | 2016-11-09 | 惠州Tcl移动通信有限公司 | A kind of method and system controlling terminal processes |
| CN106250216A (en) * | 2016-07-21 | 2016-12-21 | 宇龙计算机通信科技(深圳)有限公司 | A kind of method clearing up internal memory and terminal |
| CN107391259A (en) * | 2017-07-25 | 2017-11-24 | 广东欧珀移动通信有限公司 | Method for processing resource and device, computer-readable recording medium, mobile terminal |
| CN107402808A (en) * | 2017-07-31 | 2017-11-28 | 广东欧珀移动通信有限公司 | process management method, device, storage medium and electronic equipment |
| CN107704316A (en) * | 2017-08-04 | 2018-02-16 | 广东欧珀移动通信有限公司 | Applied program processing method, device, mobile terminal and storage medium |
| CN107861812A (en) * | 2017-10-30 | 2018-03-30 | 江西博瑞彤芸科技有限公司 | A kind of internal memory method for cleaning |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109358961A (en) | 2019-02-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10802877B2 (en) | Task management methods and system, and computer storage medium | |
| JP5984824B2 (en) | Application lifetime management | |
| CN106874031B (en) | Method and device for starting system program of terminal equipment | |
| CN109992403B (en) | Optimization method and device for multi-tenant resource scheduling, terminal equipment and storage medium | |
| CN111768006A (en) | Artificial intelligence model training method, device, equipment and storage medium | |
| US10467054B2 (en) | Resource management method and system, and computer storage medium | |
| US20170262224A1 (en) | Memory Cleaning Method and Apparatus | |
| CN110413412B (en) | GPU (graphics processing Unit) cluster resource allocation method and device | |
| CN109358961B (en) | Resource scheduling method and device with storage function | |
| CN108958975B (en) | Method, device and equipment for controlling data recovery speed | |
| CN106020984B (en) | Method and device for creating process in electronic equipment | |
| CN106775975B (en) | Process scheduling method and device | |
| CN109788325B (en) | Video task allocation method and server | |
| KR20170023280A (en) | Multi-core system and Method for managing a shared cache in the same system | |
| CN114327894A (en) | Resource allocation method, device, electronic equipment and storage medium | |
| CN111338803B (en) | Thread processing method and device | |
| CN111143063B (en) | Task resource reservation method and device | |
| CN112506821A (en) | System bus interface request arbitration method and related components | |
| CN111708618A (en) | Processing method and device based on Java multithreading | |
| CN111626916B (en) | Information processing method, device and equipment | |
| CN115562840A (en) | Task processing method, device and medium | |
| JP2008225641A (en) | Computer system, interrupt control method and program | |
| CN110851286B (en) | Thread management method and device, electronic equipment and storage medium | |
| CN110390464B (en) | Task allocation method, device, computer equipment and readable storage medium | |
| CN108279977B (en) | Data processing method and device based on RTOS (real time operating System) and controller |
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 |