CN115269160A - Timed task execution method, device and system - Google Patents
Timed task execution method, device and system Download PDFInfo
- Publication number
- CN115269160A CN115269160A CN202211194767.3A CN202211194767A CN115269160A CN 115269160 A CN115269160 A CN 115269160A CN 202211194767 A CN202211194767 A CN 202211194767A CN 115269160 A CN115269160 A CN 115269160A
- Authority
- CN
- China
- Prior art keywords
- time
- task
- execution
- node
- interval
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 56
- 238000012545 processing Methods 0.000 description 9
- 238000010586 diagram Methods 0.000 description 7
- 230000002159 abnormal effect Effects 0.000 description 2
- 238000000605 extraction Methods 0.000 description 2
- 238000012544 monitoring process Methods 0.000 description 2
- 230000005856 abnormality Effects 0.000 description 1
- 238000009825 accumulation Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000002688 persistence 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
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Debugging And Monitoring (AREA)
Abstract
The invention discloses a method, a device and a system for executing a timing task, wherein the method comprises the following steps: dynamically acquiring a first time of current execution and a second time of last execution; calculating an interval of the first time and the second time; and when the interval is greater than or equal to a preset value, executing a timing task on the node in the preset interval. By adopting the embodiment of the invention, whether the time hopping occurs is judged by acquiring and comparing the first time and the second time, and the skipped timing task is executed, so that the time hopping problem is solved; in addition, the time hopping is judged only by comparing the first time with the second time, so that the problem of high operation complexity of the traversal method is avoided; in addition, the timing tasks on the time nodes are executed, so that the task scheduling by using a time slice round method is avoided, and the resource consumption of the system is reduced.
Description
Technical Field
The invention relates to the technical field of computers, in particular to a method, a device and a system for executing a timing task.
Background
With the development of information technology, the requirements of timing tasks or task scheduling become more and more extensive, and in some real-time data processing fields, the requirements for data processing become more and more high, for example: the timeliness and accuracy of task processing are guaranteed, and once the scheduling is abnormal, problems of related business abnormality, task accumulation and the like can be caused. In order to solve the problem, currently, whether task processing is abnormal is determined mainly by monitoring whether a currently executed task reaches a task timeout threshold or by monitoring whether the currently executed task is completely executed after the task timeout threshold is reached. However, only whether the task execution is overtime is considered, and the time hopping condition that the current time is inconsistent with the original time after the time is modified manually or the system is automatically corrected is not considered, so that the problem that the timing task is not executed is solved; for the problem, the prior art mainly adopts a traversal mode or a time slice round mode to solve the problem, which causes the problems of high operation complexity and high system resource consumption.
Disclosure of Invention
The invention provides a timing task execution method, a timing task execution device and a timing task execution system, which are used for solving the technical problems of high operation complexity and high system resource consumption when the time hopping problem is processed in the prior art.
In order to solve the foregoing technical problem, an embodiment of the present invention provides a method for executing a timing task, including:
dynamically acquiring a first time of current execution and a second time of last execution;
calculating an interval of the first time and the second time;
and when the interval is greater than or equal to a preset value, executing a timing task on the node in the preset interval.
According to the invention, whether time skipping occurs is judged by acquiring and comparing the first time and the second time, and the skipped timing task is executed, so that the time skipping problem is solved; in addition, the time hopping is judged only by comparing the first time with the second time, so that the problem of high operation complexity of the traversal method is avoided; in addition, the timing task on the time node is executed, so that the task scheduling by using a time slice wheel method is avoided, and the resource consumption of the system is reduced.
Further, when the interval is greater than or equal to a preset value, executing a timing task on a node within a preset interval, specifically:
and when the interval is greater than or equal to a preset value, starting a thread corresponding to the task, and executing the timing task on the node in the preset interval through the thread.
The expired tasks are executed in a new thread establishing mode, and the current task processing cannot be blocked; when the new thread executes the task, the execution time consumed in the thread is not counted in the timing task, so that the resource consumption and the operation complexity of the system are reduced.
Further, when the interval is greater than or equal to a preset value, starting a thread corresponding to the timing task, specifically:
when the interval is larger than or equal to a preset value, inquiring whether a node exists in the preset interval or not;
when a node exists in a preset interval, extracting task content on the node;
and starting a thread corresponding to the timing task.
Further, the preset value is 2 seconds.
The invention can adjust the preset value to 2 seconds, and ensures that the timing task skipped within 1 second in the current time and the last execution time interval can be executed in the subsequent process when the time is judged to be skipped under the condition that the time interval with the last execution time exceeds 2 seconds.
Further, after the dynamically obtaining a first time of the current execution and a second time of the last execution, the method includes:
querying whether a node exists at the first time;
when a node exists at the first time, extracting task content on the node;
performing a timing task on a node in the first time.
The invention creates the node corresponding to the execution time for each task, and one time node can correspond to a plurality of tasks to be executed, thereby avoiding the need of maintaining the time slice wheel without task occupation when adopting the time slice wheel method and reducing the resource consumption of the system.
Further, before the dynamically obtaining the first time of the current execution and the second time of the last execution, the method includes:
acquiring execution time from task information uploaded by a user;
inquiring whether the execution time has a corresponding node;
and when the execution time has a corresponding node, storing the task content corresponding to the task information into the node.
Further, after the querying whether the execution time has a corresponding node, the method includes:
and when the execution time has no corresponding node, creating a node corresponding to the execution time, and storing the task content corresponding to the task information into the corresponding node.
According to the invention, the task content is stored into the corresponding node according to the execution time of the task, and the node does not need to be established at the time point when the task is not required to be executed, so that the problem that the node without the task needs to be maintained when a time slice round method is used is avoided, and the resource consumption of the system is reduced.
Further, before the obtaining of the execution time from the task information uploaded by the user, the method includes:
responding to a task creating request sent by a client, and recording task information uploaded by a user;
and returning the task creation result to the client.
The invention responds to the task creating request and records the task information so as to provide the subsequent timing task execution or task scheduling process.
On the other hand, an embodiment of the present invention further provides a timing task execution device, including: the system comprises a first execution time acquisition module, an interval calculation module and a first task execution module;
the first execution time obtaining module is used for dynamically obtaining a first time of current execution and a second time of last execution;
the interval calculation module is used for calculating the interval between the first time and the second time;
the first task execution module is used for executing the timing task on the node in the preset interval when the interval is larger than or equal to the preset value.
On the other hand, an embodiment of the present invention further provides a timing task execution system, including: a server and a client;
the server is used for executing the timing task execution method according to any one of the embodiments of the invention;
the client is used for creating tasks and uploading task information; and for viewing task creation results.
According to the invention, whether time skipping occurs is judged by acquiring and comparing the first time and the second time, and the skipped timing task is executed, so that the time skipping problem is solved; in addition, when the time hopping is judged only by comparing the first time with the second time, the problem of high operation complexity of the traversal method is avoided; in addition, the timing task on the time node is executed, so that the task scheduling by using a time slice wheel method is avoided, and the resource consumption of the system is reduced.
Drawings
FIG. 1 is a flowchart illustrating a method for executing a timed task according to an embodiment of the present invention;
FIG. 2 is a flowchart illustrating a method for executing a timed task according to another embodiment of the present invention;
FIG. 3 is a flowchart illustrating a method for executing a timed task according to another embodiment of the present invention;
FIG. 4 is a schematic structural diagram of an embodiment of a timed task execution device provided in the present invention;
FIG. 5 is a schematic structural diagram of an embodiment of a timed task execution system provided in the present invention;
FIG. 6 is a flowchart illustrating task scheduling and time-hopping according to an embodiment of the present invention;
FIG. 7 is a flowchart illustrating an embodiment of distributing tasks provided by the present invention;
FIG. 8 is a timing diagram for one embodiment of task creation provided by the present invention;
fig. 9 is an overall timing diagram of an embodiment of a method for executing a timed task according to the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be obtained by a person skilled in the art without inventive step based on the embodiments of the present invention, are within the scope of protection of the present invention.
Example one
Referring to fig. 1, a flow chart of an embodiment of a method for executing a timing task according to the present invention mainly includes steps 101 to 103, which are as follows:
step 101: and dynamically acquiring a first time of current execution and a second time of last execution.
In this embodiment, the first time currently executed is a current system time, and the second time last executed is a system time displayed at a previous time, where each time may be 1 second, for example: at the current moment, the system time displays 11 points for 25 minutes and 5 seconds; when the system displays 11 points 25 minutes and 4 seconds before the last moment, namely 1 second, the system time is normal; and when the system shows 11 o' clock 25 min 3 sec before the last time, i.e. 1 sec, the system has time-hopped. The reason for the time jump may be that the system time is changed by a person or after the system is automatically calibrated.
Step 102: calculating an interval of the first time and the second time.
In this embodiment, the interval between the first time and the second time is calculated, and when the time interval is greater than 1 second, the system may be determined as a time jump, and this way may avoid determining the execution of a task or performing task scheduling in a traversal way, thereby reducing the operation complexity and the system resource consumption.
Step 103: and when the interval is greater than or equal to a preset value, executing a timing task on the node in the preset interval.
In this embodiment, when the system jumps, the interval between the first time and the second time is greater than 1 second, and therefore, the preset value is greater than 1 second; in addition, the preset value can also be 2 seconds. When the interval is greater than or equal to 2 seconds, it can be determined that the system skips, and the skipped timing task is processed according to the preset rule of the user, for example: the skipped tasks or the unexecuted tasks within a preset interval from the first time are executed. Wherein the preset interval may include, but is not limited to: 5 seconds, 10 seconds; when the system jumps and the time-jumping interval is within a preset interval, executing the skipped or unexecuted timing task in the interval; and when the time-hopping interval exceeds the preset interval, executing the skipped or unexecuted timing tasks in the preset interval.
The invention can adjust the preset value to 2 seconds, and ensures that the timing task skipped within 1 second in the current time and the last execution time interval can be executed in the subsequent process when the time is judged to be skipped under the condition that the time interval with the last execution time exceeds 2 seconds.
In this embodiment, when the interval is greater than or equal to a preset value, executing a timing task on a node within a preset interval specifically includes: and when the interval is larger than or equal to a preset value, starting a thread corresponding to the timing task, and executing the timing task on the node in the preset interval through the thread.
In this embodiment, when the interval is greater than or equal to a preset value, starting a thread corresponding to the timing task, specifically: when the interval is larger than or equal to a preset value, inquiring whether a node exists in the preset interval or not; when a node exists in a preset interval, extracting task content on the node; and starting a thread corresponding to the timing task.
When a node in a preset interval is inquired that a skipped or unexecuted timing task exists, establishing a corresponding thread for each task, and executing each task in the thread, for example: and when 3 tasks need to be executed in a preset interval, starting 3 threads to respectively execute corresponding timing tasks, so that the task scheduling is not influenced, and the task scheduling can be continuously executed in the next second.
The expired tasks are executed in a new thread establishing mode, and the current task processing cannot be blocked; when the new thread executes the task, the execution time consumed in the thread is not counted in the timing task, so that the resource consumption and the operation complexity of the system are reduced.
In this embodiment, the node name of the node may be a specific task execution time, for example, 0 minute and 0 second when a certain task is at 11, 20, 9 and 20 in 2022, then the name of the task node may be 2022-09-20: 00:00; each node does not only correspond to one task to be executed, and if the tasks all have uniform execution time, the corresponding node comprises the tasks to be executed.
Fig. 2 is a schematic flow chart illustrating a method for executing a timed task according to another embodiment of the present invention. The main difference between fig. 2 and fig. 1 is that fig. 2 further includes steps 201 to 203, which are as follows:
in this embodiment, after step 101, step 201 to step 203 may also be performed.
Step 201: querying whether a node exists at the first time.
Please refer to fig. 6, which is a schematic flowchart illustrating an embodiment of task scheduling and time hopping processing according to the present invention, wherein a first time and a second time are queried, and meanwhile, whether a node exists at the first time is also queried; since the time nodes are set according to the task execution time, when the nodes exist at the first time, one or more tasks to be executed at the moment are indicated.
Step 202: when a node exists at the first time, extracting task content on the node.
In this embodiment, the node records the task content previously uploaded by the user; executing corresponding tasks according to the task content; the node at the first time records the task with the execution time at the first time and the task content.
Step 203: performing a timing task on a node in the first time.
In this embodiment, the executing the timing task on the node in the first time specifically includes: and establishing a thread corresponding to the timing task on the node, and executing the timing task on the node in the thread. Tasks at the current system time or first time may also be run or executed in a manner that creates a new thread.
The invention creates the node corresponding to the execution time for each task, and one time node can correspond to a plurality of tasks to be executed, thereby avoiding the need of maintaining the time slice wheel without task occupation when adopting the time slice wheel method and reducing the resource consumption of the system.
Please refer to fig. 3, which is a flowchart illustrating a timing task executing method according to another embodiment of the present invention. The main difference between fig. 3 and fig. 1 is that fig. 3 includes steps 301-303, which are as follows:
in this embodiment, before step 101, step 301 to step 303 are further included.
Step 301: and acquiring the execution time from the task information uploaded by the user.
In this embodiment, the task information includes, but is not limited to: the execution time of the corresponding timing task and the task content of the corresponding timing task; the execution time may be used to find whether there is a corresponding node in the execution time, so as to record the task content in the corresponding node, or, when there is no corresponding node in the execution time, establish a node corresponding to the execution time, and record the content in the corresponding node.
Step 302: and inquiring whether the execution time has a corresponding node.
Referring to fig. 7, a schematic flowchart of an embodiment of a task distribution method provided by the present invention is shown, where after querying whether there is a corresponding node in the execution time, the method includes: and when the execution time has no corresponding node, creating a node corresponding to the execution time, and storing the task content corresponding to the task information into the corresponding node.
The invention stores the task content into the corresponding node according to the execution time of the task, and does not need to establish the node at the time point when the task is not required to be executed, thereby avoiding the problem that the node without the task needs to be maintained when a time slice round method is used, and reducing the consumption of system resources.
Step 303: and when the execution time has a corresponding node, storing the task content corresponding to the task information into the node.
The invention adopts a node mode to record the task to be executed, which is different from the scheduling mode of a time slice wheel, such as: for the tasks executed on the same day, when the execution time of the first task is 12; for a time slice wheel, however, it is necessary to divide the time into several shares and store the tasks on the corresponding shares or time slices, for example: by cutting 24 hours into 86400 segments in a manner of 24 hours × 60 minutes × 60 seconds, 86400 time slots need to be maintained, so that the task creating and task scheduling method adopted by the invention can greatly reduce the complexity of maintenance and the consumption of system resources.
Referring to fig. 8, a timing diagram of an embodiment of task creation provided by the present invention is shown, where before obtaining an execution time from task information uploaded by a user, the method includes: responding to a task creating request sent by a client, and recording task information uploaded by a user; and returning the task creation result to the client.
In this embodiment, a task data persistence mode may be adopted to record task information uploaded by a user, query or create a node according to execution time in the task information, and record task content in the task information on a corresponding node.
The invention responds to the task creating request and records the task information so as to provide the subsequent timing task execution or task scheduling process.
Referring to fig. 9, it is an overall timing chart of an embodiment of the timing task execution method provided in the present invention, wherein steps 101 to 103 in the embodiment of the present invention correspond to a time-skipping processing procedure in the overall timing chart, steps 201 to 203 correspond to a task scheduling procedure in the overall timing chart, and steps 301 to 303 correspond to a task distributing procedure in the overall timing chart; the task scheduling process and the time-hopping processing process can be executed through a timing module on the server.
Referring to fig. 4, a schematic structural diagram of an embodiment of a timing task execution device according to the present invention mainly includes: a first execution time acquisition module 401, an interval calculation module 402, and a first task execution module 403.
In this embodiment, the first execution time obtaining module 401 is configured to dynamically obtain a first time of current execution and a second time of last execution.
In this embodiment, the timed task executing apparatus further includes: the system comprises a first node query module, a task content extraction module and a second task execution module; the first node querying module is configured to query whether a node exists at a first time after the first execution time obtaining module 401 obtains the first time of current execution and a second time of last execution; when a node exists at the first time, the task content extraction module extracts task content on the node; the second task execution module is to execute a timed task on a node in the first time.
In this embodiment, the timed task execution device further includes: the first node query module is used for querying the first node; the second execution time obtaining module is configured to obtain an execution time from the task information uploaded by the user before the first execution time obtaining module 401 obtains the first time of the current execution and the second time of the last execution; the second node query module is used for querying whether the execution time has a corresponding node; the first task storage module is used for storing task contents corresponding to the task information into the nodes when the execution time has the corresponding nodes; and the second task storage module is used for creating a node corresponding to the execution time when the execution time has no corresponding node, and storing the task content corresponding to the task information into the corresponding node.
The interval calculation module 402 is configured to calculate an interval between the first time and the second time.
The first task execution module 403 is configured to execute a timing task on a node within a preset interval when the interval is greater than or equal to a preset value.
In this embodiment, the first task execution module 403 includes a first task execution unit; the first task execution unit is used for starting a thread corresponding to the timing task when the interval is larger than or equal to a preset value, and executing the timing task on the node in a preset interval through the thread.
Referring to fig. 5, a schematic structural diagram of an embodiment of a timed task execution system provided in the present invention mainly includes: a server 501 and a client 502.
In this embodiment, the server 501 is configured to execute the timed task execution method according to any one of the embodiments of the present invention.
The client 502 is used for creating tasks and uploading task information; and for viewing task creation results.
According to the invention, whether time skipping occurs is judged by acquiring and comparing the first time and the second time, and the skipped timing task is executed, so that the time skipping problem is solved; in addition, the time hopping is judged only by comparing the first time with the second time, so that the problem of high operation complexity of the traversal method is avoided; in addition, the timing task on the time node is executed, so that the task scheduling by using a time slice wheel method is avoided, and the resource consumption of the system is reduced.
The above-mentioned embodiments are provided to further explain the objects, technical solutions and advantages of the present invention in detail, and it should be understood that the above-mentioned embodiments are only examples of the present invention and are not intended to limit the scope of the present invention. It should be understood that any modifications, equivalents, improvements and the like, which come within the spirit and principle of the invention, may occur to those skilled in the art and are intended to be included within the scope of the invention.
Claims (10)
1. A method for timed task execution, comprising:
dynamically acquiring a first time of current execution and a second time of last execution;
calculating an interval of the first time and the second time;
and when the interval is greater than or equal to a preset value, executing a timing task on the node in the preset interval.
2. The method for executing the timed task according to claim 1, wherein when the interval is greater than or equal to a preset value, the timed task on the node in the preset interval is executed, specifically:
and when the interval is larger than or equal to a preset value, starting a thread corresponding to the timing task, and executing the timing task on the node in the preset interval through the thread.
3. The method for executing the timed task according to claim 2, wherein when the interval is greater than or equal to a preset value, starting a thread corresponding to the timed task, specifically:
when the interval is larger than or equal to a preset value, inquiring whether a node exists in the preset interval or not;
when the nodes exist in the preset interval, extracting task contents on the nodes;
and starting a thread corresponding to the timing task.
4. The timed task execution method according to claim 1, characterized in that said preset value is 2 seconds.
5. The timed task execution method according to claim 1, wherein after said dynamically obtaining a first time of current execution and a second time of last execution, comprising:
querying whether a node exists at the first time;
when a node exists at the first time, extracting task content on the node;
performing a timing task on a node in the first time.
6. The timed task execution method according to any one of claims 1 to 5, characterized in that before said dynamically acquiring a first time of current execution and a second time of last execution, it comprises:
acquiring execution time from task information uploaded by a user;
inquiring whether the execution time has a corresponding node;
and when the execution time has a corresponding node, storing the task content corresponding to the task information into the node.
7. The method for executing the timed task according to claim 6, wherein after said inquiring whether there is a corresponding node in the execution time, the method comprises:
and when the execution time has no corresponding node, creating a node corresponding to the execution time, and storing the task content corresponding to the task information into the corresponding node.
8. The timed task execution method according to claim 6, before obtaining the execution time from the task information uploaded by the user, comprising:
responding to a task creating request sent by a client, and recording task information uploaded by a user;
and returning the task creation result to the client.
9. A timed task execution apparatus, comprising: the system comprises a first execution time acquisition module, an interval calculation module and a first task execution module;
the first execution time obtaining module is used for dynamically obtaining a first time of current execution and a second time of last execution;
the interval calculation module is used for calculating the interval between the first time and the second time;
the first task execution module is used for executing the timing task on the node in the preset interval when the interval is larger than or equal to the preset value.
10. A timed task execution system, comprising: a server and a client;
the server is used for executing the timed task execution method according to any one of claims 1 to 8;
the client is used for creating tasks and uploading task information; and for viewing task creation results.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211194767.3A CN115269160B (en) | 2022-09-29 | 2022-09-29 | Timed task execution method, device and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211194767.3A CN115269160B (en) | 2022-09-29 | 2022-09-29 | Timed task execution method, device and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115269160A true CN115269160A (en) | 2022-11-01 |
| CN115269160B CN115269160B (en) | 2023-01-06 |
Family
ID=83755848
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211194767.3A Active CN115269160B (en) | 2022-09-29 | 2022-09-29 | Timed task execution method, device and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115269160B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105468450A (en) * | 2015-12-29 | 2016-04-06 | 华为技术有限公司 | Task scheduling method and system |
| CN106502767A (en) * | 2015-09-08 | 2017-03-15 | 大唐移动通信设备有限公司 | A kind of process management method and its device |
| US20200250064A1 (en) * | 2019-02-01 | 2020-08-06 | Fujitsu Limited | Information processing apparatus and distributed processing system |
| CN113590287A (en) * | 2021-07-28 | 2021-11-02 | 百度在线网络技术（北京）有限公司 | Task processing method, device, equipment, storage medium and scheduling system |
| WO2022007594A1 (en) * | 2020-07-08 | 2022-01-13 | 苏宁易购集团股份有限公司 | Method and system for scheduling distributed task |
-
2022
- 2022-09-29 CN CN202211194767.3A patent/CN115269160B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106502767A (en) * | 2015-09-08 | 2017-03-15 | 大唐移动通信设备有限公司 | A kind of process management method and its device |
| CN105468450A (en) * | 2015-12-29 | 2016-04-06 | 华为技术有限公司 | Task scheduling method and system |
| US20200250064A1 (en) * | 2019-02-01 | 2020-08-06 | Fujitsu Limited | Information processing apparatus and distributed processing system |
| WO2022007594A1 (en) * | 2020-07-08 | 2022-01-13 | 苏宁易购集团股份有限公司 | Method and system for scheduling distributed task |
| CN113590287A (en) * | 2021-07-28 | 2021-11-02 | 百度在线网络技术（北京）有限公司 | Task processing method, device, equipment, storage medium and scheduling system |
Non-Patent Citations (1)
| Title |
|---|
| 刘一田等: "多租户高可用并行任务调度框架", 《计算机系统应用》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115269160B (en) | 2023-01-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10216542B2 (en) | Resource comparison based task scheduling method, apparatus, and device | |
| CN112507029B (en) | Data processing system and data real-time processing method | |
| CN109669776B (en) | Detection task processing method, device and system | |
| US8516499B2 (en) | Assistance in performing action responsive to detected event | |
| CN109560989B (en) | Link monitoring system | |
| CN114223189A (en) | Duration statistical method and device, electronic equipment and computer readable medium | |
| CN111680085A (en) | Data processing task analysis method and device, electronic equipment and readable storage medium | |
| CN111784318A (en) | Data processing method and device, electronic equipment and storage medium | |
| CN111459629A (en) | Azkaban-based project operation method and device and terminal equipment | |
| CN111400294A (en) | Data anomaly monitoring method, device and system | |
| CN111339357A (en) | Recommendation method and device based on live user behaviors | |
| CN111756778A (en) | Server disk cleaning script pushing method and device and storage medium | |
| CN113194339A (en) | Live list generation method and device, electronic equipment and readable storage medium | |
| CN115269160B (en) | Timed task execution method, device and system | |
| CN113608982A (en) | Function execution performance monitoring method and device, computer equipment and storage medium | |
| CN113761052A (en) | Database synchronization method and device | |
| CN112764988A (en) | Data segmentation acquisition method and device | |
| EP3687133B1 (en) | System and method for synchronization of media objects between devices operating in a multiroom system | |
| CN111124650A (en) | Streaming data processing method and device | |
| CN113434729B (en) | Video related information aggregation acquisition method and device and terminal equipment | |
| CN113032207A (en) | Application process monitoring method and device, electronic equipment and storage medium | |
| CN114553947A (en) | Method and device for processing message | |
| CN111294231A (en) | Resource management method and system | |
| CN112968933B (en) | Data transmission method, device, server and storage medium | |
| CN110851325B (en) | Method, device and equipment for monitoring data warehouse based on Hive table |
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 | ||
| CP03 | Change of name, title or address |
Address after: No. 56 Nanli East Road, Shiqi Town, Panyu District, Guangzhou City, Guangdong Province, 510000 Patentee after: Guangdong Baolun Electronics Co.,Ltd. Address before: No.19 Chuangyuan Road, Zhongcun street, Panyu District, Guangzhou, Guangdong 510000 Patentee before: GUANGZHOU ITC ELECTRONIC TECHNOLOGY Co.,Ltd. |
|
| CP03 | Change of name, title or address |