CN111124643A - Task deletion scheduling method, system and related device in distributed storage - Google Patents
Task deletion scheduling method, system and related device in distributed storage Download PDFInfo
- Publication number
- CN111124643A CN111124643A CN201911328607.1A CN201911328607A CN111124643A CN 111124643 A CN111124643 A CN 111124643A CN 201911328607 A CN201911328607 A CN 201911328607A CN 111124643 A CN111124643 A CN 111124643A
- Authority
- CN
- China
- Prior art keywords
- threads
- resource information
- thread
- deleting
- cpu
- 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
- 238000012217 deletion Methods 0.000 title claims abstract description 50
- 230000037430 deletion Effects 0.000 title claims abstract description 50
- 238000000034 method Methods 0.000 title claims abstract description 42
- 230000008569 process Effects 0.000 claims abstract description 11
- 238000004590 computer program Methods 0.000 claims description 9
- 238000001514 detection method Methods 0.000 claims description 3
- 230000009286 beneficial effect Effects 0.000 abstract description 2
- 230000009471 action Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000013500 data storage Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000004083 survival effect 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/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/485—Task life-cycle, e.g. stopping, restarting, resuming execution
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/3003—Monitoring arrangements specially adapted to the computing system or computing system component being monitored
- G06F11/302—Monitoring arrangements specially adapted to the computing system or computing system component being monitored where the computing system component is a software system
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/3051—Monitoring arrangements for monitoring the configuration of the computing system or of the computing system component, e.g. monitoring the presence of processing resources, peripherals, I/O links, software programs
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Quality & Reliability (AREA)
- Software Systems (AREA)
- Mathematical Physics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application provides a task deleting scheduling method in distributed storage, which comprises the following steps: acquiring CPU resource information and memory resource information of node equipment; when the CPU occupancy rate of the detected target deletion thread exceeds a first preset threshold value, judging whether a thread creating condition is met according to CPU resource information and memory resource information; if yes, creating deletion threads with the number being multiple of the preset number of the target deletion threads, and adding the deletion threads into the thread pool to be executed in parallel with the target deletion threads. According to the method and the device, the new thread can be created in time according to the real-time CPU resource information and the memory resource information of the node device, and the problem that the thread with a specific purpose cannot be added in the multithreading process is solved. By combining the utilization rate of equipment resources, the dynamic scheduling of threads is realized, and the distributed storage performance is effectively improved. The application also provides a task deleting scheduling system in distributed storage, a computer readable storage medium and a server, which have the beneficial effects.
Description
Technical Field
The present application relates to the field of data storage, and in particular, to a method, a system, and a related device for scheduling a task to be deleted in distributed storage.
Background
In the technological trend of large-scale application of virtualization and cloud computing technologies to enterprise data centers, storage performance is undoubtedly one of the key indexes of whether enterprise core applications are virtualized or clouded. A common rule when planning capacity in a data center is to estimate purchases according to maximum capacity. However, if the deletion efficiency of the storage system is not as good as the write efficiency, i.e., the speed of deletion is less than the write speed, the data center will not be able to achieve the desired storage capacity. Particularly in the field of video monitoring, data are written continuously for 24 hours, but the data have a certain survival period and are automatically deleted after expiration, and if the deletion efficiency is lower than the writing efficiency, the problem that the planned capacity cannot be written due to untimely deletion is caused.
In the face of such problems, the industry generally adopts multiple threads to improve the deletion efficiency, a certain number of thread pools are generally established when a service process is initialized, and the deletion efficiency is ensured through simultaneous cooperation of the multiple threads. However, a certain number of thread pools will inevitably occupy certain device resources (CPU and memory resources), and the requirements of different application scenarios on the deletion efficiency are inconsistent, so that the number of required deleted threads is not the same. Furthermore, the number of delete threads required by the same application at different times may vary. However, when the thread pool is adopted at present, the number of various functional threads in the thread pool is basically unchanged, the corresponding thread number needs to be selected according to the task amount when the task is executed, and once the task amount is suddenly increased, the thread for deleting the task in the thread pool cannot meet the task requirement, so that the invalid storage capacity is increased, and the distributed storage efficiency is reduced.
Disclosure of Invention
The application aims to provide a method, a system, a computer readable storage medium and a server for scheduling a deleted task in distributed storage, which can schedule the deleted task according to real-time resources of node equipment.
In order to solve the above technical problem, the present application provides a method for scheduling a deleted task in distributed storage, which has the following specific technical scheme:
acquiring CPU resource information and memory resource information of node equipment;
when the CPU occupancy rate of the detected target deletion thread exceeds a first preset threshold value, judging whether a thread creating condition is met according to the CPU resource information and the memory resource information;
if yes, creating deletion threads with the number being multiple of the preset number of the target deletion threads, and adding the deletion threads into a thread pool to be executed in parallel with the target deletion threads.
When the CPU occupancy rate of the deleted thread corresponding to the target task is lower than a second preset threshold value, the method further comprises the following steps:
closing half of the deleting threads corresponding to the target task, and releasing corresponding occupied resources;
judging whether the number of the deleting threads in the deleting threads corresponding to the target task is 1;
if not, closing half of the deleting threads corresponding to the target task again until the number of the deleting threads corresponding to the target task is 1.
The CPU resource information comprises CPU occupancy rate and CPU surplus, and the memory resource information comprises memory occupancy rate and memory surplus.
Wherein, judging whether the thread creating condition is met according to the CPU resource information and the memory resource information comprises:
and judging whether the requirement of the single-thread minimum resource is met or not according to the CPU surplus and the memory surplus, and if so, executing the step of creating the deletion threads with the preset multiple number of the target deletion threads.
The present application further provides a system for scheduling a task to be deleted in distributed storage, including:
the resource acquisition module is used for acquiring CPU resource information and memory resource information of the node equipment;
the judging module is used for judging whether a thread creating condition is met or not according to the CPU resource information and the memory resource information when the CPU occupancy rate of the detection target deleting thread exceeds a first preset threshold value;
and the thread creating module is used for creating the deleting threads with the preset multiple number of the target deleting threads when the judging result of the judging module is yes, and adding the deleting threads into a thread pool to be executed in parallel with the target deleting threads.
Wherein, still include:
the process deleting module is used for closing half of the deleting threads corresponding to the target task and releasing corresponding occupied resources when the CPU occupancy rate of the deleting threads corresponding to the target task is lower than a second preset threshold value; judging whether the number of the deleting threads in the deleting threads corresponding to the target task is 1; if not, closing half of the deleting threads corresponding to the target task again until the number of the deleting threads corresponding to the target task is 1.
Wherein, the judging module comprises:
and the judging unit is used for judging whether the single-thread minimum resource requirement is met or not according to the residual quantity of the CPU in the CPU resource information and the residual quantity of the memory in the memory resource information.
The present application also provides a computer-readable storage medium having stored thereon a computer program which, when being executed by a processor, carries out the steps of the method as set forth above.
The present application further provides a server comprising a memory and a processor, wherein the memory stores a computer program, and the processor implements the steps of the method described above when calling the computer program in the memory.
The application provides a task deleting scheduling method in distributed storage, which comprises the following steps: acquiring CPU resource information and memory resource information of node equipment; when the CPU occupancy rate of the detected target deletion thread exceeds a first preset threshold value, judging whether a thread creating condition is met according to the CPU resource information and the memory resource information; if yes, creating deletion threads with the number being multiple of the preset number of the target deletion threads, and adding the deletion threads into a thread pool to be executed in parallel with the target deletion threads.
According to the method and the device, when the CPU occupancy rate of the deleted thread exceeds the threshold value according to the real-time CPU resource information and the memory resource information of the node device, a new thread can be created in time, and the problem that a special purpose thread cannot be added in the multi-thread process at present is solved. By combining the utilization rate of equipment resources, the dynamic scheduling of threads is realized, and the distributed storage performance is effectively improved. The application also provides a task deleting scheduling system in distributed storage, a computer readable storage medium and a server, which have the beneficial effects and are not described herein again.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, it is obvious that the drawings in the following description are only embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.
Fig. 1 is a flowchart of a method for scheduling a delete task in a distributed storage according to an embodiment of the present application;
fig. 2 is a schematic structural diagram of a system for scheduling a delete task in a distributed storage according to an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are some embodiments of the present application, but not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
Referring to fig. 1, fig. 1 is a flowchart of a method for scheduling a task to be deleted in a distributed storage according to an embodiment of the present application, where the method includes:
s101: acquiring CPU resource information and memory resource information of node equipment;
the step aims to acquire CPU resource information and memory resource information of the node equipment, and is used for judging the resource state of the current node. The CPU resource information may include CPU occupancy rate, CPU remaining amount, and the like, and the memory resource information may include memory occupancy rate, memory remaining amount, and the like.
S102: when the CPU occupancy rate of the detected target deletion thread exceeds a first preset threshold value, judging whether a thread creating condition is met according to the CPU resource information and the memory resource information; if yes, entering S103;
in this step, it is necessary to determine whether the CPU occupancy rate of the target deletion thread exceeds a first preset threshold, and once the CPU occupancy rate exceeds the first preset threshold, it indicates that the deletion task amount corresponding to the deletion thread is large, so that the deletion thread occupies a high CPU. At this time, whether the thread creation condition is satisfied may be determined according to the CPU resource information and the memory resource information acquired in S101.
Specifically, whether the requirement of the single-thread minimum resource is met or not is judged according to the surplus of the CPU and the surplus of the memory. How many threads can be created is determined according to the CPU resource and the memory resource of the current node device, and once the CPU resource or the memory resource is insufficient, the thread creation fails, or even if the thread is created, the thread cannot normally execute the task. Therefore, it is necessary to determine whether the current CPU residual amount and the memory residual amount satisfy the single-thread minimum resource requirement. The specific resource amount of the single-thread minimum resource is not limited, and a person skilled in the art should make a corresponding setting according to the actual task deletion requirement.
S103: and creating deletion threads with the preset multiple number of the target deletion threads, and adding the deletion threads into a thread pool to be executed in parallel with the target deletion threads.
And once the thread creating condition is met, creating a deleting thread with preset multiple of the target deleting thread. The preset multiple is not particularly limited, and may be set to 2 according to the task deletion requirement in the current distributed storage. It should be noted that the number of the target delete threads is twice as large. Assuming that there are 8 current target delete threads, 16 delete threads should be created at this time.
And after the deleting thread is created, adding the deleting thread into the thread pool, and executing the deleting task in parallel with the target deleting thread which has executed the deleting task.
According to the real-time CPU resource information and the memory resource information of the node equipment, when the CPU occupancy rate of the deleted thread exceeds the threshold value, a new thread can be created in time, and the problem that a special purpose thread cannot be added in the multithreading process is solved. By combining the utilization rate of equipment resources, the dynamic scheduling of threads is realized, and the distributed storage performance is effectively improved.
Based on the foregoing embodiment, as a preferred embodiment, when it is detected that the CPU occupancy of the deleted thread corresponding to the target task is lower than a second preset threshold, the method further includes:
s201: closing half of the deleting threads corresponding to the target task, and releasing corresponding occupied resources;
s202: judging whether the number of the deleting threads in the deleting threads corresponding to the target task is 1 or not; if not, entering S203;
s203: and closing half of the deleting threads corresponding to the target task again until the number of the deleting threads corresponding to the target task is 1.
When the CPU occupancy rate of the deleted threads is lower than a certain value, the deleted threads in the thread pool are too many at the moment, namely the deleted task quantity is small, so that the CPU occupancy rate of each deleted thread is low. Since any delete thread needs to occupy the device resource, at this time, the delete thread can be deleted, but at least one delete thread should be reserved. Specifically, half of the threads are closed first, and after closing, whether the remaining deleted threads are 1 is judged, if not, half of the deleted threads are closed again until the deleted threads corresponding to the target task are 1.
The second preset threshold is also not limited herein, and it is understood that the second preset threshold is smaller than the first preset threshold described above. And when the CPU occupancy rate of the deleted thread is between the first preset threshold and the second preset threshold, the deleted thread is considered to normally execute the deleted task.
It should be noted that the present process is directed to a specific target task. I.e. the delete thread that targets the task. The CPU occupancy rates of the delete threads may be different for different target tasks. Therefore, the present embodiment essentially releases the delete thread with a small task amount. The deleted thread is released when the CPU occupancy rate of the deleted thread is low, the node equipment resources are returned, and the deleted thread scheduling efficiency among the deleted tasks can be effectively improved.
In the following, a task deleting scheduling system in distributed storage according to an embodiment of the present application is introduced, and the task deleting scheduling system described below and the task deleting scheduling method described above may be referred to in a corresponding manner.
Referring to fig. 2, the present application further provides a system for scheduling a task to be deleted in distributed storage, including:
a resource obtaining module 100, configured to obtain CPU resource information and memory resource information of a node device;
the judging module 200 is configured to, when the CPU occupancy rate of the detection target deletion thread exceeds a first preset threshold, judge whether a thread creation condition is satisfied according to the CPU resource information and the memory resource information;
and the thread creating module 300 is configured to create a deletion thread with a preset multiple number of the target deletion threads when the judgment result of the judging module is yes, and add the deletion thread into a thread pool to be executed in parallel with the target deletion thread.
Based on the above embodiment, as a preferred embodiment, the method may further include:
the process deleting module is used for closing half of the deleting threads corresponding to the target task and releasing corresponding occupied resources when the CPU occupancy rate of the deleting threads corresponding to the target task is lower than a second preset threshold value; judging whether the number of the deleting threads in the deleting threads corresponding to the target task is 1; if not, closing half of the deleting threads corresponding to the target task again until the number of the deleting threads corresponding to the target task is 1.
Based on the above embodiment, as a preferred embodiment, the determining module 200 includes:
and the judging unit is used for judging whether the single-thread minimum resource requirement is met or not according to the residual quantity of the CPU in the CPU resource information and the residual quantity of the memory in the memory resource information.
The present application also provides a computer readable storage medium having stored thereon a computer program which, when executed, may implement the steps provided by the above-described embodiments. The storage medium may include: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
The application also provides a server, which may include a memory and a processor, where the memory stores a computer program, and the processor may implement the steps provided by the foregoing embodiments when calling the computer program in the memory. Of course, the server may also include various network interfaces, power supplies, and the like.
The embodiments are described in a progressive manner in the specification, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other. For the system provided by the embodiment, the description is relatively simple because the system corresponds to the method provided by the embodiment, and the relevant points can be referred to the method part for description.
The principles and embodiments of the present application are explained herein using specific examples, which are provided only to help understand the method and the core idea of the present application. It should be noted that, for those skilled in the art, it is possible to make several improvements and modifications to the present application without departing from the principle of the present application, and such improvements and modifications also fall within the scope of the claims of the present application.
It is further noted that, in the present specification, relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
Claims (9)
1. A task deleting scheduling method in distributed storage is characterized by comprising the following steps:
acquiring CPU resource information and memory resource information of node equipment;
when the CPU occupancy rate of the detected target deletion thread exceeds a first preset threshold value, judging whether a thread creating condition is met according to the CPU resource information and the memory resource information;
if yes, creating deletion threads with the number being multiple of the preset number of the target deletion threads, and adding the deletion threads into a thread pool to be executed in parallel with the target deletion threads.
2. The method for scheduling the deleted tasks according to claim 1, wherein when it is detected that the CPU occupancy of the deleted thread corresponding to the target task is lower than a second preset threshold, the method further comprises:
closing half of the deleting threads corresponding to the target task, and releasing corresponding occupied resources;
judging whether the number of the deleting threads in the deleting threads corresponding to the target task is 1;
if not, closing half of the deleting threads corresponding to the target task again until the number of the deleting threads corresponding to the target task is 1.
3. The deleted task scheduling method of claim 1, wherein the CPU resource information includes a CPU occupancy rate and a CPU remaining amount, and the memory resource information includes a memory occupancy rate and a memory remaining amount.
4. The method of claim 3, wherein determining whether a thread creation condition is satisfied according to the CPU resource information and the memory resource information comprises:
and judging whether the requirement of the single-thread minimum resource is met or not according to the CPU surplus and the memory surplus, and if so, executing the step of creating the deletion threads with the preset multiple number of the target deletion threads.
5. A system for scheduling tasks for deletion in distributed storage, comprising:
the resource acquisition module is used for acquiring CPU resource information and memory resource information of the node equipment;
the judging module is used for judging whether a thread creating condition is met or not according to the CPU resource information and the memory resource information when the CPU occupancy rate of the detection target deleting thread exceeds a first preset threshold value;
and the thread creating module is used for creating the deleting threads with the preset multiple number of the target deleting threads when the judging result of the judging module is yes, and adding the deleting threads into a thread pool to be executed in parallel with the target deleting threads.
6. The system for scheduling a delete task of claim 5, further comprising:
the process deleting module is used for closing half of the deleting threads corresponding to the target task and releasing corresponding occupied resources when the CPU occupancy rate of the deleting threads corresponding to the target task is lower than a second preset threshold value; judging whether the number of the deleting threads in the deleting threads corresponding to the target task is 1; if not, closing half of the deleting threads corresponding to the target task again until the number of the deleting threads corresponding to the target task is 1.
7. The system of claim 6, wherein the determining module comprises:
and the judging unit is used for judging whether the single-thread minimum resource requirement is met or not according to the residual quantity of the CPU in the CPU resource information and the residual quantity of the memory in the memory resource information.
8. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the task scheduling method according to any one of claims 1 to 4.
9. A server, characterized in that it comprises a memory in which a computer program is stored and a processor which, when it calls the computer program in the memory, implements the steps of the task scheduling method according to any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911328607.1A CN111124643A (en) | 2019-12-20 | 2019-12-20 | Task deletion scheduling method, system and related device in distributed storage |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911328607.1A CN111124643A (en) | 2019-12-20 | 2019-12-20 | Task deletion scheduling method, system and related device in distributed storage |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111124643A true CN111124643A (en) | 2020-05-08 |
Family
ID=70500759
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911328607.1A Withdrawn CN111124643A (en) | 2019-12-20 | 2019-12-20 | Task deletion scheduling method, system and related device in distributed storage |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111124643A (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111984588A (en) * | 2020-07-09 | 2020-11-24 | 新浪网技术(中国)有限公司 | Object storage life cycle management method, device and system |
| CN112099955A (en) * | 2020-09-27 | 2020-12-18 | 合肥移瑞通信技术有限公司 | Control method, device and medium for android system running memory and computer equipment |
| CN112100186A (en) * | 2020-08-26 | 2020-12-18 | 金蝶软件（中国）有限公司 | Data processing method and device based on distributed system and computer equipment |
| CN112100146A (en) * | 2020-09-21 | 2020-12-18 | 重庆紫光华山智安科技有限公司 | Efficient erasure correction distributed storage writing method, system, medium and terminal |
| CN112685132A (en) * | 2020-12-23 | 2021-04-20 | 北京浪潮数据技术有限公司 | Koji task execution method, device, equipment and readable storage medium |
| CN112860431A (en) * | 2021-01-20 | 2021-05-28 | 重庆六花网络科技有限公司 | Connection method, system, equipment and storage medium of micro service node |
| CN113094172A (en) * | 2021-04-01 | 2021-07-09 | 北京天融信网络安全技术有限公司 | Server management method and device applied to distributed storage system |
| CN114996004A (en) * | 2022-05-30 | 2022-09-02 | 杭州迪普科技股份有限公司 | Method and device for continuously deleting session |
| CN115934372A (en) * | 2023-03-09 | 2023-04-07 | 浪潮电子信息产业股份有限公司 | Data processing method, system, equipment and computer readable storage medium |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060107261A1 (en) * | 2004-11-18 | 2006-05-18 | Oracle International Corporation | Providing Optimal Number of Threads to Applications Performing Multi-tasking Using Threads |
| US20110161969A1 (en) * | 2009-12-25 | 2011-06-30 | International Business Machines Corporation | Consolidating CPU - Cache - Memory Access Usage Metrics |
| CN105630606A (en) * | 2015-12-22 | 2016-06-01 | 山东中创软件工程股份有限公司 | Method and device for adjusting capacity of thread pools |
| CN106557369A (en) * | 2016-11-25 | 2017-04-05 | 武汉斗鱼网络科技有限公司 | A kind of management method and system of multithreading |
| CN107220033A (en) * | 2017-07-05 | 2017-09-29 | 百度在线网络技术（北京）有限公司 | Method and apparatus for controlling thread pool thread quantity |
| CN107832146A (en) * | 2017-10-27 | 2018-03-23 | 北京计算机技术及应用研究所 | Thread pool task processing method in highly available cluster system |
| CN109558244A (en) * | 2018-12-03 | 2019-04-02 | 郑州云海信息技术有限公司 | Junk information recovery method, device, equipment and computer readable storage medium |
| CN109840142A (en) * | 2018-12-15 | 2019-06-04 | 平安科技（深圳）有限公司 | Thread control method, device, electronic equipment and storage medium based on cloud monitoring |
-
2019
- 2019-12-20 CN CN201911328607.1A patent/CN111124643A/en not_active Withdrawn
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060107261A1 (en) * | 2004-11-18 | 2006-05-18 | Oracle International Corporation | Providing Optimal Number of Threads to Applications Performing Multi-tasking Using Threads |
| US20110161969A1 (en) * | 2009-12-25 | 2011-06-30 | International Business Machines Corporation | Consolidating CPU - Cache - Memory Access Usage Metrics |
| CN105630606A (en) * | 2015-12-22 | 2016-06-01 | 山东中创软件工程股份有限公司 | Method and device for adjusting capacity of thread pools |
| CN106557369A (en) * | 2016-11-25 | 2017-04-05 | 武汉斗鱼网络科技有限公司 | A kind of management method and system of multithreading |
| CN107220033A (en) * | 2017-07-05 | 2017-09-29 | 百度在线网络技术（北京）有限公司 | Method and apparatus for controlling thread pool thread quantity |
| CN107832146A (en) * | 2017-10-27 | 2018-03-23 | 北京计算机技术及应用研究所 | Thread pool task processing method in highly available cluster system |
| CN109558244A (en) * | 2018-12-03 | 2019-04-02 | 郑州云海信息技术有限公司 | Junk information recovery method, device, equipment and computer readable storage medium |
| CN109840142A (en) * | 2018-12-15 | 2019-06-04 | 平安科技（深圳）有限公司 | Thread control method, device, electronic equipment and storage medium based on cloud monitoring |
Non-Patent Citations (1)
| Title |
|---|
| 李继龙，邸娜，杨明: "《数字音频广播系统设计与实现》", 31 July 2011 * |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111984588A (en) * | 2020-07-09 | 2020-11-24 | 新浪网技术(中国)有限公司 | Object storage life cycle management method, device and system |
| CN112100186A (en) * | 2020-08-26 | 2020-12-18 | 金蝶软件（中国）有限公司 | Data processing method and device based on distributed system and computer equipment |
| CN112100186B (en) * | 2020-08-26 | 2024-04-05 | 金蝶软件（中国）有限公司 | Data processing method and device based on distributed system and computer equipment |
| CN112100146A (en) * | 2020-09-21 | 2020-12-18 | 重庆紫光华山智安科技有限公司 | Efficient erasure correction distributed storage writing method, system, medium and terminal |
| CN112099955A (en) * | 2020-09-27 | 2020-12-18 | 合肥移瑞通信技术有限公司 | Control method, device and medium for android system running memory and computer equipment |
| CN112685132A (en) * | 2020-12-23 | 2021-04-20 | 北京浪潮数据技术有限公司 | Koji task execution method, device, equipment and readable storage medium |
| CN112685132B (en) * | 2020-12-23 | 2024-08-02 | 北京浪潮数据技术有限公司 | Method, device and equipment for executing koji task and readable storage medium |
| CN112860431A (en) * | 2021-01-20 | 2021-05-28 | 重庆六花网络科技有限公司 | Connection method, system, equipment and storage medium of micro service node |
| CN112860431B (en) * | 2021-01-20 | 2024-03-15 | 重庆六花网络科技有限公司 | Connection method, system, equipment and storage medium of micro service node |
| CN113094172A (en) * | 2021-04-01 | 2021-07-09 | 北京天融信网络安全技术有限公司 | Server management method and device applied to distributed storage system |
| CN114996004A (en) * | 2022-05-30 | 2022-09-02 | 杭州迪普科技股份有限公司 | Method and device for continuously deleting session |
| CN115934372A (en) * | 2023-03-09 | 2023-04-07 | 浪潮电子信息产业股份有限公司 | Data processing method, system, equipment and computer readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111124643A (en) | Task deletion scheduling method, system and related device in distributed storage | |
| US11106579B2 (en) | System and method to manage and share managed runtime memory for java virtual machine | |
| EP3129880B1 (en) | Method and device for augmenting and releasing capacity of computing resources in real-time stream computing system | |
| CN107273182B (en) | Method and system for dynamically expanding virtual machine resources | |
| US9176869B2 (en) | Memory use for garbage collected computer environments | |
| US10884667B2 (en) | Storage controller and IO request processing method | |
| CN110930291B (en) | GPU video memory management control method and related device | |
| CN107818012B (en) | Data processing method and device and electronic equipment | |
| CN108196959B (en) | Resource management method and device of ETL system | |
| US20230305880A1 (en) | Cluster distributed resource scheduling method, apparatus and device, and storage medium | |
| EP3376381A1 (en) | Resource management method and system, and computer storage medium | |
| CN114579323A (en) | Thread processing method, device, equipment and medium | |
| CN102426539B (en) | Timer task automatic processing method and system | |
| CN112114958A (en) | Resource isolation method, distributed platform, computer device, and storage medium | |
| CN117519929A (en) | Example scheduling method and device, storage medium and electronic equipment | |
| CN111143063A (en) | Task resource reservation method and device | |
| CN114157717B (en) | System and method for dynamic current limiting of micro-service | |
| CN115562840A (en) | Task processing method, device and medium | |
| CN115098252A (en) | Resource scheduling method, device and computer readable medium | |
| CN115794362A (en) | Resource allocation method, cloud host and computer-readable storage medium | |
| CN113032369A (en) | Data migration method, device and medium | |
| CN115543765A (en) | Test case scheduling method and device, computer equipment and readable medium | |
| CN111104220A (en) | Arm architecture-based server configuration method, system and related equipment | |
| CN111143037B (en) | Virtual machine resource allocation method, device, system and storage medium | |
| CN111090627A (en) | Log storage method and device based on pooling, computer equipment and 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 | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20200508 |