CN107766131B - Task scheduling method and device - Google Patents
Task scheduling method and device Download PDFInfo
- Publication number
- CN107766131B CN107766131B CN201610704230.5A CN201610704230A CN107766131B CN 107766131 B CN107766131 B CN 107766131B CN 201610704230 A CN201610704230 A CN 201610704230A CN 107766131 B CN107766131 B CN 107766131B
- Authority
- CN
- China
- Prior art keywords
- task
- state
- target
- target task
- service data
- 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/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
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Debugging And Monitoring (AREA)
Abstract
The invention provides a task scheduling method, which comprises the following steps: receiving a task scheduling request, and extracting a task type in the task scheduling request; searching a target task corresponding to the task type in a task scheduling table, wherein all tasks and corresponding task types are recorded in the task scheduling table; reading the searched state of the target task; and when the state of the target task is an executable state, locking the target task, and changing the state of the target task into a non-executable state. All tasks and corresponding task states are recorded through the task scheduling table, and the tasks are allowed to be called only when the target tasks are read to be in an executable state, so that one task is effectively prevented from being executed in a contended mode, and the condition that one service data is read for multiple times or written for multiple times is also prevented. In addition, a task scheduling device is also provided.
Description
Technical Field
The present invention relates to the field of computer processing, and in particular, to a task scheduling method and apparatus.
Background
Task scheduling is an important component of an operating system, and processes relevant business data by scheduling tasks. A task refers to a computing resource that processes corresponding service data according to a certain service logic. In many systems, there is automatically executed job task scheduling, but a task scheduling framework cannot guarantee that only one job task is executed at the same time on multiple machines, which results in one job task being contended on multiple machines, and thus a situation that one piece of service data is read or written for multiple times occurs.
Disclosure of Invention
In view of the foregoing, it is desirable to provide a task scheduling method and apparatus that can avoid the same task from being executed in a contest.
A method of task scheduling, the method comprising: receiving a task scheduling request, and extracting a task type in the task scheduling request; searching a target task corresponding to the task type in a task scheduling table, wherein all tasks and corresponding task types are recorded in the task scheduling table; reading the searched state of the target task; and when the state of the target task is an executable state, locking the target task, and changing the state of the target task into a non-executable state.
In one embodiment, after the step of locking the target task and changing the state of the target task to the non-executable state when the task state of the target task is the executable state, the method further includes: calling the target task to process corresponding service data according to the corresponding service logic; and when the service data is processed, releasing the target task, and changing the state of the target task into an executable state.
In one embodiment, the step of invoking the target task to process the corresponding service data according to the corresponding service logic includes: acquiring service data in a to-be-executed state in a service data table, wherein the state of each piece of service data is recorded in the service data table; and calling the target task to process the service data according to the corresponding service logic, and changing the state corresponding to the service data in the service data table into completion every time one piece of service data is processed.
In one embodiment, the step of locking the target task and changing the state of the target task to the non-executable state when the task state of the target task is the executable state includes: and when the task state of the target task is an executable state, locking the target task by locking a task lock corresponding to the target task in the task scheduling table, and then changing the state of the target task into a non-executable state.
In one embodiment, the method further comprises: regularly initiating and detecting whether the tasks in the task scheduling table are in an executable state; if not, detecting whether a task is written in a task recording table corresponding to the task within preset time or not; and if no task is written in the preset time, the task is forced to be turned into an executable state.
A task scheduling apparatus, the apparatus comprising: the receiving module is used for receiving a task scheduling request and extracting a task type in the task scheduling request; the searching module is used for searching a target task corresponding to the task type in a task scheduling table, and all tasks and corresponding task types are recorded in the task scheduling table; the reading module is used for reading the searched state of the target task; and the locking module is used for locking the target task and changing the state of the target task into the unexecutable state when the state of the target task is the executable state.
In one embodiment, the apparatus further comprises: the calling module is used for calling the target task to process corresponding service data according to the corresponding service logic; and the release module is used for releasing the target task after the business data is processed, and changing the state of the target task into an executable state.
In one embodiment, the calling module includes: the system comprises an acquisition module, a processing module and a processing module, wherein the acquisition module is used for acquiring the service data in a to-be-executed state in a service data table, and the state of each piece of service data is recorded in the service data table; and the processing module is used for calling the target task to process the service data according to the corresponding service logic, and changing the state corresponding to the service data in the service data table into a complete state after processing one piece of service data.
In one embodiment, the locking module is further configured to lock the target task by locking a task lock corresponding to the target task in the task scheduling table when the task state of the target task is an executable state, and then change the state of the target task to an unexecutable state.
In one embodiment, the apparatus further comprises: the first detection module is used for initiating and detecting whether the tasks in the task scheduling table are in an executable state at regular time; the second detection module is used for detecting whether a task is written in a task recording table corresponding to the task within preset time or not if the task in the task scheduling table is in an unexecutable state; and the turning module is used for forcibly turning the task into an executable state if no task is written in the preset time.
According to the task scheduling method and device, the task type in the task scheduling request is extracted by receiving the task scheduling request, the target task corresponding to the task type is searched in the task scheduling table, all tasks and the corresponding task types are recorded in the task scheduling table, the task state of the searched target task is read, when the target task is in an executable state, the target task is locked, and the state of the target task is changed into an unexecutable state. All tasks and corresponding task states are recorded through the task scheduling table, when the target task is read to be in an executable state, the target task is not executed currently, the target task is locked, and the state of the target task is changed into an unexecutable state, so that other programs can not call the task any more, the phenomenon that one task is executed in a contest is effectively prevented, and the phenomenon that one service datum is read for many times or written for many times is also prevented.
Drawings
FIG. 1 is a flow diagram of a method for task scheduling in one embodiment;
FIG. 2 is a flow diagram of a method of task scheduling in another embodiment;
FIG. 3 is a flowchart illustrating a method for invoking a target task to process corresponding service data according to corresponding service logic in one embodiment;
FIG. 4 is a flow diagram of a method for detecting whether task scheduling is abnormal, according to an embodiment;
FIG. 5 is a block diagram of an apparatus for task scheduling in one embodiment;
FIG. 6 is a block diagram showing an apparatus for task scheduling in another embodiment;
FIG. 7 is a block diagram of the structure of a calling module in one embodiment;
FIG. 8 is a block diagram of an apparatus for task scheduling in one embodiment.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
As shown in fig. 1, in one embodiment, a task scheduling method is provided, which includes:
and 102, receiving a task scheduling request and extracting a task type in the task scheduling request.
Specifically, task scheduling is an important component of an operating system, and processes relevant service data by scheduling tasks. A task refers to a computing resource that processes corresponding service data according to a certain service logic. Different tasks correspond to different functions, different task types are set for the different tasks in advance, and then the tasks and the corresponding task types are correspondingly stored. After receiving the task scheduling request, firstly extracting the task type in the task scheduling request, and then searching the corresponding task according to the task type.
And 104, searching a target task corresponding to the task type in a task scheduling table, wherein all tasks and corresponding task types are recorded in the task scheduling table.
Specifically, all tasks and corresponding task types are recorded in the task scheduling table, after the task types in the task scheduling request are extracted, the tasks corresponding to the task types are searched in the task scheduling table, and the searched tasks are used as target tasks. The task scheduling table is stored in the database, the task scheduling table is a key for task scheduling, the task is searched through the task scheduling table, and subsequently, the state is required to be read according to the task scheduling table, so that the task is scheduled.
In this embodiment, in addition to all tasks and corresponding task types, the task schedule also records a task state corresponding to each task, and the task states are divided into two types, one is an executable state and the other is a non-executable state. When the task state is an executable state, the task is not occupied and is in an available state. When the task state is the non-executable state, the task is in the occupied state and is not available. Specifically, after the target task corresponding to the task type is found, the task state of the target task is read, if the task state of the target task is an executable state, it is indicated that the target task is in an idle state, the target task is firstly locked, so that other application programs are prevented from calling the target task again, and then the state of the target task is changed into an unexecutable state. And when the task state of the target task is the non-executable state, indicating that the target task is in an occupied state and is not available at present, and ending the task calling at this time.
And step 108, locking the target task and changing the state of the target task into an unexecutable state.
In this embodiment, when it is read that the task state of the target task is an executable state, it indicates that the current target task is available, in order to prevent another program from calling the task before the target task is not locked, and preempt the opportunity of calling this time, the target task needs to be locked first, after the locking is successful, another application program cannot call the target task, and then the state of the target task is changed to an unexecutable state.
In this embodiment, a task scheduling request is received, a task type in the task scheduling request is extracted, and then a target task corresponding to the task type is searched in a task scheduling table, all tasks and corresponding task states are recorded in the task scheduling table, the task state of the searched target task is read, when the target task is in an executable state, the target task is locked, and the state of the target task is changed into an unexecutable state. All tasks and corresponding task states are recorded through the task scheduling table, when the target task is read to be in an executable state, the target task is not executed currently, the target task is locked, and the state of the target task is changed into an unexecutable state, so that other programs can not call the task any more, the phenomenon that one task is executed in a contest is effectively prevented, and the phenomenon that one service datum is read for many times or written for many times is also prevented.
As shown in fig. 2, in an embodiment, after the step of locking the target task and changing the state of the target task to the non-executable state when the task state of the target task is the executable state, the method further includes:
and step 110, calling the target task, and processing corresponding service data according to the corresponding service logic.
In this embodiment, the task is used for processing the related service data according to the preset service logic, that is, each task corresponds to one service logic. The calling target task is to process corresponding service data according to the corresponding service logic. For example, a task is used for extracting data and sending the extracted data. Then invoking the task is to extract and issue the acquired relevant data. Invoking the target task is actually invoking the target task to process the related business data according to the corresponding business logic. Specifically, the service data to be processed is acquired, the target task is called, the service data is processed according to the corresponding service logic, and the state corresponding to the service data in the service data table is changed to be completed after each piece of service data is processed, so that the completed service cannot be pulled when the service data is pulled, and the repeated processing of the service data is effectively avoided.
And step 112, releasing the target task after the business data is processed, and changing the state of the target task into an executable state.
In this embodiment, the calling target task processes the acquired service data according to the corresponding service logic, after the service data is processed, the result of task execution is stored in the task record table, the target task is released, that is, the corresponding task lock is opened, then the state of the target task is changed into an executable state, and then other application programs can call the task. And after the calling target task finishes processing the corresponding service data, unlocking the target task in time, and facilitating the calling of other application programs or platforms.
As shown in fig. 3, in an embodiment, the step of invoking the target task and processing the corresponding service data according to the corresponding service logic includes:
In this embodiment, the status of each piece of service data is recorded in the service data table, and the status of the service data is divided into three types, one is a to-be-executed status, one is an in-execution status, and one is a completion status. And calling the target task to process the acquired service data, wherein the service data is the service data which is pulled from the service data table and is in the state to be executed. When the service data is in the executing state or the finishing state, the service data is processed or is processed completely, and the same service data is prevented from being processed in a contended mode or processed repeatedly when the service data is pulled. Therefore, through the management and control of the service data table, only the service data in the to-be-executed state is pulled, and the same service data can be effectively prevented from being processed in a contended mode or processed repeatedly.
And step 110B, calling the target task to process the service data according to the corresponding service logic, and changing the state corresponding to the service data in the service data table into a complete state after processing one piece of service data.
In this embodiment, when the target task is called to process the service data according to the corresponding service logic, only the service data in the to-be-executed state is pulled and processed, and after a piece of service data is pulled, the service data is firstly locked, and then the state of the service data in the service data table is changed into the executing state, so that the service data can be effectively prevented from being processed in a scrambling manner. After processing a piece of service data, the state corresponding to the piece of service data in the service data is changed to be completed. Therefore, the repeated processing of the same service data can be avoided.
In one embodiment, when the task state of the target task is an executable state, the target task is locked, and the step of changing the state of the target task to the non-executable state comprises the following steps: and when the task state of the target task is an executable state, locking the target task by locking a task lock corresponding to the target task in the task scheduling table, and then changing the state of the target task into a non-executable state.
In this embodiment, before task scheduling, the state of a target task corresponding to a task scheduling table is checked first, and only when the target task is in an executable state, the target task is allowed to be scheduled. Specifically, the task state of each task is recorded in the task scheduling table, when the task state of the target task is found to be an executable state, the target task is locked by locking the task lock corresponding to the target task in the task scheduling table, and then the state updating statement is executed to change the state of the target task to be an unexecutable state.
As shown in fig. 4, in an embodiment, the task scheduling method further includes detecting whether the task scheduling is abnormal, specifically including:
and step 114, periodically initiating and detecting whether the tasks in the task scheduling table are in an executable state, if not, entering step 116, and if so, ending.
In this embodiment, since the system may sometimes have an exception, a state occurs in which the task is always in execution, and the business data is not actually processed. It is necessary to establish a separate task for initiating the detection of the occurrence of an anomaly in the system at a certain timing. Specifically, whether a task in a task scheduling table is in an executable state is detected at regular time, if any task is in an unexecutable state, whether a task is written in a task recording table corresponding to the task within a preset time needs to be further detected, if no task is written, the system is abnormal, and at this time, the state of the task is forcibly turned into the executable state. And if the tasks are all in an executable state, which indicates that no exception exists, continuing the detection, and ending.
And step 116, detecting whether a task is written in a task record table corresponding to the task within a preset time, if not, entering step 118, and if so, ending.
In this embodiment, since the execution result of the task is written into the corresponding task record table during the normal execution of the task, if it is to be detected that the task is in a normal execution state or in an abnormal state, it is possible to detect whether there is a task written in the task record table within a period of time. Specifically, if it is detected that the state of a certain task or certain tasks in the task scheduling table is in the non-executable state, it is further detected whether a task recording table corresponding to the certain task or certain tasks is written in a preset time, and if so, it is indicated that the task is in the normal execution state. If no task is written, the task is abnormal, and the state of the task is forced to be turned into an executable state.
In this embodiment, when it is found that a task is always in an unexecutable state, that is, is always occupied, whether a task is written in a task record table corresponding to the task within a preset time is detected, and if not, an exception occurs in the execution of the task, and at this time, the state of the task may be forcibly turned from the unexecutable state to an executable state.
As shown in fig. 5, in one embodiment, a task scheduling apparatus is provided, the apparatus comprising:
the receiving module 502 is configured to receive a task scheduling request and extract a task type in the task scheduling request.
The searching module 504 is configured to search for a target task corresponding to a task type in a task scheduling table, where all tasks and corresponding task types are recorded in the task scheduling table.
And a reading module 506, configured to read a found state of the target task.
And a locking module 508, configured to lock the target task and change the state of the target task to an unexecutable state when the state of the target task is an executable state.
As shown in fig. 6, in an embodiment, the task scheduling apparatus further includes:
and the calling module 510 is configured to call the target task to process corresponding service data according to the corresponding service logic.
And a releasing module 512, configured to release the target task after the service data is processed, and change the state of the target task into an executable state.
As shown in FIG. 7, in one embodiment, the calling module includes:
the obtaining module 510A is configured to obtain service data in a service data table in a to-be-executed state, where the state of each piece of service data is recorded in the service data table.
The processing module 510B is configured to invoke the target task to process the service data according to the corresponding service logic, and change the state corresponding to the service data in the service data table to be completed after each piece of service data is processed.
In one embodiment, the locking module is further configured to lock the target task by locking a task lock corresponding to the target task in the task schedule when the task state of the target task is the executable state, and then change the state of the target task to the non-executable state.
As shown in fig. 8, in an embodiment, the task scheduling apparatus further includes:
a first detection module 514, configured to periodically initiate detection whether a task in the task schedule is in an executable state.
The second detecting module 516 is configured to detect whether a task is written in a task record table corresponding to a task within a preset time if the task in the task schedule table is in an unexecutable state.
The flipping module 518 is configured to force the task to be flipped to an executable state if it is detected that no task is written within a preset time.
The technical features of the embodiments described above may be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the embodiments described above are not described, but should be considered as being within the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present invention, and the description thereof is more specific and detailed, but not construed as limiting the scope of the present invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the inventive concept, which falls within the scope of the present invention. Therefore, the protection scope of the present patent shall be subject to the appended claims.
Claims (10)
1. A method of task scheduling, the method comprising the steps of:
receiving a task scheduling request, and extracting a task type in the task scheduling request;
searching a target task corresponding to the task type in a task scheduling table, wherein all tasks and corresponding task types are recorded in the task scheduling table, and the corresponding task state of each task is recorded at the same time;
reading the searched state of the target task;
when the state of the target task is an executable state, locking the target task, and changing the state of the target task into a non-executable state; the executable state refers to an available state in which the target task is not occupied, and the non-executable state refers to an unavailable state in which the target task is currently occupied;
the method further comprises the following steps:
regularly initiating and detecting whether the tasks in the task scheduling table are in an executable state;
if not, detecting whether the task data is written in a task recording table corresponding to the task within the preset time or not;
and if detecting that the task data is not written in the preset time, forcibly turning the task into an executable state.
2. The method according to claim 1, wherein after the step of locking the target task and changing the state of the target task to the non-executable state when the state of the target task is the executable state, further comprising:
calling the target task, and processing corresponding service data according to corresponding service logic;
and when the service data is processed, releasing the target task, and changing the state of the target task into an executable state.
3. The method of claim 2, wherein the step of invoking the target task and processing the corresponding service data according to the corresponding service logic comprises:
acquiring service data in a to-be-executed state in a service data table, wherein the state of each piece of service data is recorded in the service data table;
and calling the target task to process the service data according to the corresponding service logic, and changing the state corresponding to the service data in the service data table into completion every time one piece of service data is processed.
4. The method according to claim 1, wherein the step of locking the target task when the task state of the target task is executable state and changing the state of the target task to non-executable state comprises:
and when the state of the target task is an executable state, locking the target task through a task lock corresponding to the target task in the task scheduling table, and then changing the state of the target task into a non-executable state.
5. A task scheduling apparatus, characterized in that the apparatus comprises:
the receiving module is used for receiving a task scheduling request and extracting a task type in the task scheduling request;
the searching module is used for searching a target task corresponding to the task type in a task scheduling table, wherein all tasks and corresponding task types are recorded in the task scheduling table, and the task state corresponding to each task is recorded at the same time;
the reading module is used for reading the searched state of the target task;
the locking module is used for locking the target task and changing the state of the target task into an unexecutable state when the state of the target task is an executable state; the executable state refers to an available state in which the target task is not occupied, and the non-executable state refers to an unavailable state in which the target task is currently occupied;
the device further comprises:
the first detection module is used for initiating and detecting whether the tasks in the task scheduling table are in an executable state at regular time;
the second detection module is used for detecting whether the task data are written in a task recording table corresponding to the task within preset time or not if the task in the task scheduling table is in an unexecutable state;
and the turning module is used for forcibly turning the task into an executable state if the fact that the task data are not written in the preset time is detected.
6. The apparatus of claim 5, further comprising:
the calling module is used for calling the target task to process corresponding service data according to the corresponding service logic;
and the release module is used for releasing the target task after the business data is processed, and changing the state of the target task into an executable state.
7. The apparatus of claim 6, wherein the invoking module comprises:
the system comprises an acquisition module, a processing module and a processing module, wherein the acquisition module is used for acquiring the service data in a to-be-executed state in a service data table, and the state of each piece of service data is recorded in the service data table;
and the processing module is used for calling the target task to process the service data according to the corresponding service logic, and changing the state corresponding to the service data in the service data table into a complete state after processing one piece of service data.
8. The apparatus of claim 5, wherein the locking module is further configured to lock the target task by a task lock corresponding to the target task in the task schedule when the task state of the target task is executable, and then change the state of the target task to the non-executable state.
9. 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 method according to any one of claims 1 to 4.
10. A mobile terminal comprising a memory and a processor, the memory having stored therein computer readable instructions which, when executed by the processor, cause the processor to perform the steps of the method according to any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610704230.5A CN107766131B (en) | 2016-08-22 | 2016-08-22 | Task scheduling method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610704230.5A CN107766131B (en) | 2016-08-22 | 2016-08-22 | Task scheduling method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107766131A CN107766131A (en) | 2018-03-06 |
| CN107766131B true CN107766131B (en) | 2020-09-22 |
Family
ID=61264220
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610704230.5A Active CN107766131B (en) | 2016-08-22 | 2016-08-22 | Task scheduling method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107766131B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109062698A (en) * | 2018-08-13 | 2018-12-21 | 郑州云海信息技术有限公司 | A kind of task processing method, apparatus and system |
| CN109062681A (en) * | 2018-08-24 | 2018-12-21 | 郑州云海信息技术有限公司 | A kind of execution method, system, device and the storage medium of periodic cycle task |
| CN110046138B (en) * | 2019-03-06 | 2024-03-01 | 平安科技（深圳）有限公司 | iSCSI target multi-instance processing method and distributed storage system |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP3328118B2 (en) * | 1995-09-28 | 2002-09-24 | 日本電気株式会社 | Multitask transaction communication controller |
| CN103761148A (en) * | 2014-01-26 | 2014-04-30 | 北京京东尚科信息技术有限公司 | Control method for cluster timing scheduling tasks |
| CN103984544A (en) * | 2014-04-24 | 2014-08-13 | 浪潮电子信息产业股份有限公司 | Method for avoiding simultaneous execution of tasks |
| CN105468450A (en) * | 2015-12-29 | 2016-04-06 | 华为技术有限公司 | Task scheduling method and system |
-
2016
- 2016-08-22 CN CN201610704230.5A patent/CN107766131B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP3328118B2 (en) * | 1995-09-28 | 2002-09-24 | 日本電気株式会社 | Multitask transaction communication controller |
| CN103761148A (en) * | 2014-01-26 | 2014-04-30 | 北京京东尚科信息技术有限公司 | Control method for cluster timing scheduling tasks |
| CN103984544A (en) * | 2014-04-24 | 2014-08-13 | 浪潮电子信息产业股份有限公司 | Method for avoiding simultaneous execution of tasks |
| CN105468450A (en) * | 2015-12-29 | 2016-04-06 | 华为技术有限公司 | Task scheduling method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107766131A (en) | 2018-03-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10838838B2 (en) | Method and apparatus for dealing with abnormality of application program and storage medium | |
| US8250543B2 (en) | Software tracing | |
| KR20190079809A (en) | Fault injection test apparatus and method for the same | |
| US10831622B2 (en) | Method and apparatus for processing gateway device fault | |
| US20090327815A1 (en) | Process Reflection | |
| CN108681598B (en) | Automatic task rerun method, system, computer equipment and storage medium | |
| CN107766131B (en) | Task scheduling method and device | |
| CN107861799B (en) | Task processing method and device based on multi-thread environment | |
| CN107783829B (en) | Task processing method and device, storage medium and computer equipment | |
| CN110225078B (en) | Application service updating method, system and terminal equipment | |
| CN109445927B (en) | Task management method and device for storage cluster | |
| CN109409087B (en) | Anti-privilege-raising detection method and device | |
| CN110597695A (en) | Alarm method, alarm device, computer equipment and readable storage medium | |
| CN112988503A (en) | Analysis method, analysis device, electronic device, and storage medium | |
| CN106776050B (en) | Multi-user process mutual exclusion method and device | |
| CN109558249B (en) | Control method and device for concurrent operation | |
| JP2018180982A (en) | Information processing device and log recording method | |
| US10102052B2 (en) | Dumping resources | |
| CN109445951B (en) | Information processing method and device | |
| CN110832459B (en) | Vehicle control device | |
| EP3070610B1 (en) | Information processing device, control method thereof, and recording medium | |
| CN113792326B (en) | File content copy limiting method and device | |
| CN111857689A (en) | Framework, function configuration method of framework, terminal and storage medium | |
| CN110968486A (en) | Script running method and device | |
| US20130160033A1 (en) | Hook re-entry prevention device and recording medium, in which program for executing method thereof in computer is recorded thereon |
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 |