CN106708481B - Method for controlling task execution - Google Patents
Method for controlling task execution Download PDFInfo
- Publication number
- CN106708481B CN106708481B CN201510460921.0A CN201510460921A CN106708481B CN 106708481 B CN106708481 B CN 106708481B CN 201510460921 A CN201510460921 A CN 201510460921A CN 106708481 B CN106708481 B CN 106708481B
- Authority
- CN
- China
- Prior art keywords
- task
- type
- traversing
- list
- execution
- 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
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Debugging And Monitoring (AREA)
Abstract
The invention provides a method for controlling task execution, which comprises the following steps: traversing the task list, and judging whether an unexecuted task exists; dividing the task type for each unexecuted task according to a plurality of preset task types, and inquiring an operation parameter list according to the divided task types to obtain records comprising a plurality of type-specific operation parameters corresponding to the divided task types, wherein the operation parameter list comprises a plurality of type-specific operation parameters assigned to each task type; traversing the operation parameter list, and judging whether traversing of a plurality of type-specific operation parameters in the record is finished or not, wherein if not, judging whether the actual operation parameters are in accordance with the corresponding type-specific operation parameters or not, if not, returning to the step of traversing the task list, if so, continuing to execute the step of traversing the operation parameter list, and if so, executing the unexecuted task and updating the task state to the executed state.
Description
Technical Field
The invention relates to the technical field of computers, in particular to a method for controlling task execution.
Background
In the technical field of computers, with the rapid development of networks, a large application system inevitably needs to adopt an asynchronous mode to complete certain functions in the development process, and the specific realization of the asynchronous mode is a system task, namely, operations which are expected to be carried out asynchronously are packaged into task records, and the task records are executed by adopting a timing thread. Thus, repeated retries of the task can be realized, and the execution of the task is guaranteed to be completed by one hundred percent. In the prior art, task systems are executed regularly, a task execution timing thread queries a task list to be executed, traverses the task list, executes each task record, and modifies the task state into a completion state if the execution is successful; if the execution is not successful, the next re-execution is performed. The specific flow chart is shown in fig. 1.
However, the prior art has the following disadvantages: the task execution system executes tasks at regular time, does not concern the existence of other applications, and does not concern the running environment of the applications and the like, such as information of a memory, a CPU (central processing unit), a load and the like, so that if too many tasks are executed in the task execution process, the execution service is complex, severe pressure is caused on the server, and the service of other applications deployed on the same server is influenced.
Disclosure of Invention
In view of the above, the present invention provides a method for controlling task execution, which dynamically plans the execution of tasks by using a method for dividing task types and setting task type operation parameters, that is, in the technical scheme, a task execution system first queries a task list to be executed, traverses the task list, queries a corresponding operation environment record according to the type of each task record, determines whether the task can be executed, skips the task record if not, and executes the record if possible.
To achieve the above object, according to one aspect of the present invention, there is provided a method of controlling task execution, including: traversing the task list, and judging whether an unexecuted task exists; dividing the task type for each unexecuted task according to a plurality of preset task types, and inquiring an operation parameter list according to the divided task types to obtain records comprising a plurality of type-specific operation parameters corresponding to the divided task types, wherein the operation parameter list comprises a plurality of type-specific operation parameters assigned to each task type; traversing the operation parameter list, and judging whether traversing of the plurality of type-specific operation parameters in the record is finished or not, wherein if not, judging whether the actual operation parameters are consistent with the corresponding type-specific operation parameters or not, if not, returning to the step of traversing the task list, if so, continuing to execute the step of traversing the operation parameter list, and if so, executing the unexecuted task and updating the task state to be executed.
Optionally, the method further comprises: executing the task execution thread regularly before the step of traversing the task list, and inquiring the task list to be executed in the database.
Optionally, the plurality of task types includes: an emergency task type, a high time consuming task type, a high memory consumption task type, a high CPU consumption task type, an execution time range type, a high memory consumption and CPU task type and/or an emergency task and a before-zero completion type.
Optionally, the plurality of type-specific operating parameters includes: urgency level, elapsed time, elapsed memory size, CPU range, and/or execution time.
To achieve the above object, according to another aspect of the present invention, an electronic device is provided.
The electronic device of the present invention includes: one or more processors; and a memory for storing one or more programs; when the one or more programs are executed by the one or more processors, the one or more processors are caused to implement the method of controlling task execution of the present invention.
To achieve the above object, according to still another aspect of the present invention, there is provided a computer-readable medium.
The computer-readable medium of the present invention, on which a computer program is stored, which, when being executed by a processor, implements the method of the present invention of controlling task execution.
According to the technical scheme of the invention, the invention provides a method for controlling task execution, which dynamically plans the task execution by adopting a method for dividing task types and setting task type operation parameters, namely, in the technical scheme, a task execution system firstly inquires a task list to be executed, traverses the task list, inquires a corresponding operation environment record according to the type of each task record, judges whether the task can be executed, if not, skips the task record, and if so, executes the record.
Drawings
The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:
FIG. 1 is a flow chart of a task system executing tasks in the prior art;
FIG. 2 is a flow chart of steps of a method of controlling task execution in accordance with an embodiment of the present invention;
FIG. 3 is a task type diagram in the present invention;
FIG. 4 is a diagram of the combination of operating parameters specifying task types in the present invention;
FIG. 5 is a diagram of an example of task execution in the present invention; and
FIG. 6 is a flowchart of an example task-based execution in the present invention.
Detailed Description
Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered exemplary only. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
Referring to fig. 2, a flowchart illustrating steps of a method for controlling task execution according to an embodiment of the present invention is shown. The method comprises the following specific steps:
step S1: and traversing the task list and judging whether the unexecuted task exists or not. Before the step of traversing the task list, executing the task execution thread regularly, and inquiring the task list to be executed in the database.
Step S2: according to a predetermined plurality of task types, as shown in fig. 3, the task type is divided for each unexecuted task, and an operation parameter list is queried according to the divided task types to obtain a record including a plurality of type-specific operation parameters corresponding to the divided task types, wherein the operation parameter list includes a plurality of type-specific operation parameters assigned to each task type.
Specifically, the task types include: an emergency task type, a high time consuming task type, a high memory consumption task type, a high CPU consumption task type, an execution time range type, a high memory consumption and CPU task type and/or an emergency task and a before-zero completion type. Therefore, the selectivity and diversity of task types are improved.
Further, an urgent task type, that is, a task type with the best priority is preferentially executed; a high-time-consumption task type, namely, the task of the task type consumes very much time in the execution process and the execution time is long; the task type of the high-consumption memory, namely the task of the task type consumes the memory comparatively in the execution process, such as tasks of reading and writing files, exporting reports and the like; the task type of the CPU is high-consumption, namely, the task of the task type consumes the CPU in the execution process and needs a large amount of operations such as calculation, IO and the like; a time-range type, i.e. a task of this task type specifies that the task must be executed in that time period or completed before that point in time; the memory and CPU type is high, namely the memory and the CPU are consumed when the type is executed; the emergency task is of a type completed before zero, namely, the task is emergency and must be completed before morning every day.
In summary, it can be known that the task type is created by a developer, and various different task types can be created, and a plurality of task operation parameters are correspondingly defined for the task type, where the task operation parameters may include: operation environment information and rule information artificially defined according to the operation environment information of the system or the server. During the execution of the task, the task type of the task and a plurality of corresponding task operation parameters are dynamically acquired, so as to judge whether the task should be executed immediately or later. Therefore, flexibility and usability of task grading and time-sharing execution are achieved.
Step S3: and traversing the operation parameter list, and judging whether traversing of the plurality of type-specific operation parameters in the record is finished. Wherein, a plurality of type-specific operating parameters are shown in fig. 4, including: urgency level, elapsed time, elapsed memory size, CPU range, and/or execution time. Therefore, the selectivity and the diversity of the operation parameters are improved.
Specifically, the emergency level is an execution level of the task, and the smaller the priority is, the higher the priority is, for example, the emergency level may be divided into 1 to 10, 10 levels, where 1 is the highest emergency level and 10 is the lowest emergency level; the time-consuming duration is an estimated time-consuming duration of the task execution, for example, the time-consuming duration can be generally divided into three intervals: time-consuming duration <3s, 3s < time-consuming duration <5s, and time-consuming duration >5 s; the consumed memory size is the memory size expected to be used when a task is executed, and for example, the consumed memory size can be generally divided into three intervals: memory consumption size <1M, 1M < memory consumption size <10M, and memory consumption size > 10M; a CPU range is a range of CPUs within which a task can be performed, for example, a CPU range can be generally divided into three intervals: CPU range < 20%, CPU range < 50%, and CPU range < 70%; the execution time is a time interval in which the task is allowed to execute, and for example, the execution time can be generally divided into two intervals: 21:00< execution time <23:59 and execution time >23: 59.
In summary, it can be known that a plurality of type-specific operation parameters are configuration selectable items for a task type, and one of the plurality of operation parameters may be selected to set the task type or some of the plurality of operation parameters may be selected to set the task type, so that a task belonging to a certain task type may query records of operation parameters in a corresponding operation parameter list during execution, and determine whether the current operation environment of the system and the server satisfies the setting of the operation parameters.
Step S4: if not, judging whether the actual operation parameters are in accordance with the corresponding operation parameters aiming at the types, if not, returning to the step of traversing the task list, and if so, continuing to execute the step of traversing the operation parameter list.
Step S5: if the task is finished, executing the unexecuted task and updating the task state to be executed.
In order to better understand the method for controlling task execution proposed by the present invention, the following is a specific example, and the scope of protection of the present invention is not limited to the following example.
As shown in fig. 5, the database stores two tables other than the task record table in advance, that is, a plurality of task type tables other than the task record table and a task operation parameter table, wherein the task record table records conventional parameters of a task; the task type tables record an emergency task type, a high-time-consumption task type, a high-memory-consumption task type, a high-consumption CPU task type, an execution time range type, a high-memory-consumption and CPU task type and/or an emergency task and a pre-zero completion type; and a plurality of type-specific lists of operating parameters. For example, the size of the task, the download rate, and the like are conventional parameters of the task in the task record table; the environment information and the rule information are a plurality of type-specific operating parameters in a plurality of type-specific operating parameter lists.
Specifically, the task execution system traverses the task list and judges whether an unexecuted task exists or not; dividing the task type for each unexecuted task according to a plurality of preset task types, and inquiring an operation parameter list according to the divided task types to obtain records comprising a plurality of type-specific operation parameters corresponding to the divided task types, wherein the operation parameter list comprises a plurality of type-specific operation parameters assigned to each task type; traversing the operation parameter list, and judging whether traversing of a plurality of type-specific operation parameters in the record is finished or not, wherein if not, judging whether the actual operation parameters are in accordance with the corresponding type-specific operation parameters or not, if not, returning to the step of traversing the task list, if so, continuing to execute the step of traversing the operation parameter list, and if so, executing the unexecuted task and updating the task state to the executed state. For example, for an unexecuted task, the task type is divided into: the high-consumption memory task type is that an operation parameter list is inquired according to the high-consumption memory task type, and the operation parameter list is as follows:
emergency level: 6;
the time consumption is long: >3s and <5 s;
memory consumption: > 10M;
CPU range: < 20%;
execution time: 21:00and 23:59
Thereby obtaining a record including a plurality of type-specific operating parameters corresponding to the divided task types.
Further, traversing an operation parameter list comprising an emergency level, a time-consuming duration, a memory-consuming range, a CPU (Central processing Unit) range and an execution time, and judging whether traversing of a plurality of type-specific operation parameters in the record is finished or not, wherein if not, judging whether the actual operation parameters are consistent with the corresponding type-specific operation parameters or not, if not, returning to the step of traversing the task list, if so, continuing to execute the step of traversing the operation parameter list, and if so, executing the unexecuted task and updating the task state to be executed.
Further, to illustrate an example workflow in more detail, it is shown in FIG. 6.
Step S601: and executing the thread by the task. The task execution thread is executed in a timing mode. Therefore, the efficiency and the orderliness of the executed tasks are improved.
Step S602: and querying a task list to be executed in the database.
Step S603: and traversing the task list to be executed.
Step S604: it is determined whether there is an unexecuted task.
Step S605: if there is an unexecuted task, the task type is obtained.
Step S606: and inquiring a task operation parameter list of the task in a database according to the task type.
Step S607: and traversing the task operation parameter list.
Step S608: and judging whether a task operation parameter record exists or not.
Step S609: if not, the task is executed, and the state of the task is updated to be complete.
Step S610: and if so, acquiring task operation parameters.
Step S611: and judging whether the operation parameters of the task execution system meet the task operation parameters.
Step S612: if yes, executing step S607, if no, ending the task traversal, executing step S609, and if not, executing step S603.
The invention provides a method for controlling task execution, which dynamically plans the task execution by adopting a method for dividing task types and setting task type operation parameters, namely in the technical scheme, a task execution system firstly inquires a task list to be executed, traverses the task list, inquires a corresponding operation environment record according to the type of each task record, judges whether the task can be executed, skips the task record if the task can not be executed, and executes the record if the task can be executed.
Any process or method descriptions in flow charts or otherwise described herein may be understood as representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps of the process, and alternate implementations are included within the scope of the preferred embodiment of the present invention in which functions may be executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those reasonably skilled in the art of the present invention.
The logic and/or steps represented in the flowcharts or otherwise described herein, such as an ordered listing of executable instructions that can be considered to implement logical functions, can be embodied in any computer-readable medium for use by or in connection with an instruction execution system, apparatus, or device, such as a computer-based system, processor-containing system, or other system that can fetch the instructions from the instruction execution system, apparatus, or device and execute the instructions. For the purposes of this description, a "computer-readable medium" can be any means that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. More specific examples (a non-exhaustive list) of the computer-readable medium would include the following: an electrical connection (electronic device) having one or more wires, a portable computer diskette (magnetic device), a Random Access Memory (RAM), a read-only memory (POM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disc read-only memory (CDROM). Additionally, the computer-readable medium could even be paper or another suitable medium upon which the program is printed, as the program can be electronically captured, via for instance optical scanning of the paper or other medium, then compiled, interpreted or otherwise processed in a suitable manner if necessary, and then stored in a computer memory.
It should be understood that portions of the present invention may be implemented in hardware, software, firmware, or a combination thereof. In the above embodiments, the various steps or methods may be implemented in software or firmware stored in memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, any one or a combination of the following techniques, which are known in the art; a discrete logic circuit having a logic gate circuit for implementing a logic function on a data signal, an application specific integrated circuit having an appropriate combinational logic gate circuit, a Programmable Gate Array (PGA), a Field Programmable Gate Array (FPGA), or the like.
It will be understood by those skilled in the art that all or part of the steps carried by the method for implementing the above embodiments may be implemented by hardware related to instructions of a program, which may be stored in a computer readable storage medium, and when the program is executed, the program includes one or a combination of the steps of the method embodiments.
In addition, functional units in the embodiments of the present invention may be integrated into one processing module, or each unit may exist alone physically, or two or more units are integrated into one module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode. The integrated module, if implemented in the form of a software functional module and sold or used as a stand-alone product, may also be stored in a computer readable storage medium.
The storage medium mentioned above may be a read-only memory, a magnetic or optical disk, etc.
In the description herein, references to the description of the terms "one embodiment," "some embodiments," "an example," "a specific example" or "some examples" or the like mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, exemplary labels applied to the above terms do not necessarily refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
Although embodiments of the present invention have been shown and described above, it is understood that the above embodiments are exemplary and should not be construed as limiting the present invention, and that variations, modifications, substitutions and alterations can be made in the above embodiments by those of ordinary skill in the art without departing from the principle and spirit of the present invention. The scope of the invention is defined by the appended claims and their full range of equivalents.
The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (5)
1. A method for controlling task execution is applied to a task execution system, the task execution system is deployed on a server, and the method comprises the following steps:
traversing the task list, and judging whether an unexecuted task exists;
dividing the task type for each unexecuted task according to a plurality of preset task types, and inquiring an operation parameter list according to the divided task types to obtain records comprising a plurality of type-specific operation parameters corresponding to the divided task types, wherein the operation parameter list comprises a plurality of type-specific operation parameters assigned to each task type;
traversing the operating parameter list, and judging whether traversing of a plurality of type-specific operating parameters in the record is finished or not, wherein the type-specific operating parameters are
If not, judging whether the actual operation parameters are in accordance with the corresponding operation parameters aiming at the types, if not, returning to the step of traversing the task list, if so, continuing to execute the step of traversing the operation parameter list, and the step is also included
If the task is finished, executing the unexecuted task and updating the task state to be executed;
the plurality of type-specific operating parameters includes: urgency level, elapsed time, elapsed memory size, CPU range, and/or execution time.
2. The method of claim 1, further comprising: executing the task execution thread regularly before the step of traversing the task list, and inquiring the task list to be executed in the database.
3. The method of claim 1 or 2, wherein the plurality of task types comprises: an emergency task type, a high time consuming task type, a high memory consumption task type, a high CPU consumption task type, an execution time range type, a high memory consumption and CPU task type and/or an emergency task and a before-zero completion type.
4. An electronic device, comprising:
one or more processors; and the number of the first and second groups,
a memory for storing one or more programs;
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1 to 3.
5. A computer-readable medium, on which a computer program is stored, which program, when being executed by a processor, carries out the method according to any one of claims 1 to 3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510460921.0A CN106708481B (en) | 2015-07-30 | 2015-07-30 | Method for controlling task execution |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510460921.0A CN106708481B (en) | 2015-07-30 | 2015-07-30 | Method for controlling task execution |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106708481A CN106708481A (en) | 2017-05-24 |
| CN106708481B true CN106708481B (en) | 2021-06-29 |
Family
ID=58901631
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510460921.0A Active CN106708481B (en) | 2015-07-30 | 2015-07-30 | Method for controlling task execution |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106708481B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109995817A (en) * | 2017-12-29 | 2019-07-09 | 中移信息技术有限公司 | A kind of service scheduling method and device |
| CN110389960B (en) * | 2018-04-20 | 2024-06-14 | 北京京东尚科信息技术有限公司 | Data refreshing method and device |
| CN110442451B (en) * | 2019-07-12 | 2023-05-05 | 中国电子科技集团公司第五十二研究所 | Deep learning-oriented multi-type GPU cluster resource management scheduling method and system |
| CN111311061B (en) * | 2020-01-16 | 2024-03-12 | 上海三菱电梯有限公司 | Elevator reconstruction scheme generation method and elevator reconstruction scheme generation system |
Family Cites Families (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1859217A (en) * | 2005-06-30 | 2006-11-08 | 华为技术有限公司 | Method, system and device for processing task in equipment management |
| CN100550766C (en) * | 2006-01-24 | 2009-10-14 | 华为技术有限公司 | Preplanned mission manner of execution and management role manner of execution and terminal equipment thereof |
| CN100476739C (en) * | 2007-08-23 | 2009-04-08 | 南京联创科技股份有限公司 | Method for managing group task |
| CN101290668B (en) * | 2008-06-16 | 2011-08-17 | 中国移动通信集团湖北有限公司 | Time sharing operation dynamic dispatching method and device |
| CN103246551A (en) * | 2012-02-07 | 2013-08-14 | 北京糯米网科技发展有限公司 | Device and method for management of background timed task |
| CN103294533B (en) * | 2012-10-30 | 2016-09-07 | 北京安天电子设备有限公司 | task flow control method and system |
| US9400728B2 (en) * | 2013-01-14 | 2016-07-26 | Wal-Mart Stores, Inc. | Cross platform workflow management |
| GB2514585B (en) * | 2013-05-30 | 2015-09-23 | Kiwi Uk Ip Co Ltd | Task scheduler |
| CN103365729A (en) * | 2013-07-19 | 2013-10-23 | 哈尔滨工业大学深圳研究生院 | Dynamic MapReduce dispatching method and system based on task type |
| CN103645909A (en) * | 2013-12-30 | 2014-03-19 | 中国烟草总公司湖南省公司 | Handling method and device for timed task |
| CN104008178B (en) * | 2014-06-09 | 2017-07-14 | 中国工商银行股份有限公司 | The dynamic load processing method and system of a kind of data |
| CN104065745A (en) * | 2014-07-07 | 2014-09-24 | 电子科技大学 | Cloud computing dynamic resource scheduling system and method |
| CN104484204A (en) * | 2014-12-12 | 2015-04-01 | 北京国双科技有限公司 | Method and device for task running |
| CN104657212B (en) * | 2015-02-13 | 2018-02-16 | 北京亚信数据有限公司 | A kind of method and system of task scheduling |
-
2015
- 2015-07-30 CN CN201510460921.0A patent/CN106708481B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN106708481A (en) | 2017-05-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10810051B1 (en) | Autoscaling using file access or cache usage for cluster machines | |
| CN106708481B (en) | Method for controlling task execution | |
| KR102478395B1 (en) | Mechanism for ssds to efficiently manage background activity with notify | |
| EP2488929B1 (en) | Memory object relocation for power savings | |
| AU2010336363B2 (en) | Managing queries | |
| JP6818014B2 (en) | Operation retry method and equipment for jobs | |
| US10725796B2 (en) | Robot task management method, robot using the same and non-transitory computer readable storage medium | |
| CN112799606B (en) | Scheduling method and device of IO (input/output) request | |
| CN112581018B (en) | Method, system, device and storage medium for managing process tasks | |
| CN112256433B (en) | Partition migration method and device based on Kafka cluster | |
| CN112269661B (en) | Partition migration method and device based on Kafka cluster | |
| CN112269536A (en) | Method and device for optimizing storage software system and computer readable storage medium | |
| CN105094811A (en) | Method can device for processing events | |
| US11194623B2 (en) | Resource scheduling method and related apparatus | |
| CN109634714B (en) | Intelligent scheduling method and device | |
| US20160266808A1 (en) | Information processing device, information processing method, and recording medium | |
| CN113110918A (en) | Read-write rate control method and device, node equipment and storage medium | |
| US20140068214A1 (en) | Information processing apparatus and copy control method | |
| CN110968406B (en) | Method, device, storage medium and processor for processing task | |
| CN106648550B (en) | Method and device for concurrently executing tasks | |
| JP7141939B2 (en) | industrial controller | |
| CN114661432A (en) | Task scheduling method, device, equipment and storage medium | |
| CN114691766A (en) | Data acquisition method and device and electronic equipment | |
| CN112667463A (en) | Application system baseline state monitoring method and device | |
| CN105573920A (en) | Storage space management method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |