CN110704173A - Task scheduling method, scheduling system, electronic device and computer storage medium - Google Patents
Task scheduling method, scheduling system, electronic device and computer storage medium Download PDFInfo
- Publication number
- CN110704173A CN110704173A CN201910936828.0A CN201910936828A CN110704173A CN 110704173 A CN110704173 A CN 110704173A CN 201910936828 A CN201910936828 A CN 201910936828A CN 110704173 A CN110704173 A CN 110704173A
- Authority
- CN
- China
- Prior art keywords
- task
- executed
- execution
- list
- scheduling
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 50
- 238000012216 screening Methods 0.000 claims abstract description 15
- 238000004891 communication Methods 0.000 claims description 15
- 238000004590 computer program Methods 0.000 claims 2
- 230000002354 daily effect Effects 0.000 description 9
- 230000001419 dependent effect Effects 0.000 description 6
- 238000010586 diagram Methods 0.000 description 4
- 230000002085 persistent effect Effects 0.000 description 3
- 238000001514 detection method Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 1
- 230000003203 everyday effect Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000011022 operating instruction Methods 0.000 description 1
- 238000000926 separation method Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/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 embodiment of the invention discloses a task scheduling method, a task scheduling system, electronic equipment and a computer storage medium. The task scheduling method comprises the following steps: storing the dependency relationship and the triggering condition among the existing tasks; periodically acquiring and analyzing the messages in the message queue; determining a task list formed by dividing the execution state of the task; screening the current task to be executed according to the dependency relationship, the trigger condition and the task list; issuing the task to be executed to an execution engine; and updating the message queue according to the task execution condition of the execution engine. The message queue realizes the decoupling between task execution and task scheduling, ensures the flexibility of the task scheduling process, and meets the use requirements of real-time triggering, conditional triggering and simple management.
Description
Technical Field
The present invention relates to the field of task scheduling technologies, and in particular, to a task scheduling method, a task scheduling system, an electronic device, and a computer storage medium.
Background
The task scheduling is a process of determining the existing execution sequence of each task according to a series of rules such as triggering conditions and dependency relationships of the tasks in the running process of a back-end system platform or a big data system platform. Effective task scheduling can help the system platforms to run efficiently, and the working efficiency is improved.
In the existing task scheduling system, the dependent scheduling among different project tasks is based on the detection and judgment of the state of the task depended on by the timing task, so as to determine whether to continue to execute the downstream task.
For example, when the task B depends on the task a and the execution periods of the task a and the task B are different, a plurality of timing tasks need to be started, the task B is run at a timing while the task a is executed at a timing to detect whether the task a is completed, and the task B is executed until the task a is completed. Of course, the task A fails and then an alarm is given.
In such a task scheduling method, when the number of dependencies between tasks is large, the number of timing tasks to be started is large, and management is difficult. The start time of the timing task is set based on experience. For example, assuming that the time for the task a to complete execution is usually 15:00, the starting time of the task B should be 15:00 later, and a loop detection operation is required to ensure that the task B does not fail due to the delay of the execution progress of the task a, which increases the complexity of the operation.
The need for automatic triggering of certain timed tasks, such as executing daily timed tasks every day, and triggering monthly tasks in real time after the completion of the daily task execution on the last day, cannot even be fulfilled.
Therefore, it is desirable to provide a new task scheduling method to solve one or more of the above problems.
Disclosure of Invention
Embodiments of the present invention provide a task scheduling method, a task scheduling system, an electronic device, and a storage medium, which are used to solve one or more problems in an existing task scheduling system.
The first aspect of the embodiments of the present invention provides a task scheduling method. The task scheduling method comprises the following steps:
storing the dependency relationship and the triggering condition among the existing tasks; periodically acquiring and analyzing the messages in the message queue; determining a task list formed by dividing the execution state of the task; screening the current task to be executed according to the dependency relationship, the trigger condition and the task list; issuing the task to be executed to an execution engine; and updating the message queue according to the task execution condition of the execution engine.
Optionally, periodically acquiring the message in the message queue, and determining the execution condition of the task in the execution engine specifically includes:
acquiring the messages in the message queue according to a set period; and analyzing the acquired message to acquire a task execution state, and storing the task information into a corresponding task list according to the task state. Optionally, screening a task to be executed currently according to the dependency relationship, the trigger condition, and the task list specifically includes:
traversing a task list with a task state being completed, and determining a downstream task of each task in the completed task list; judging whether the tasks depended by the downstream tasks are all executed or not according to the dependency relationship; if yes, determining the task to be executed currently; if not, moving to a task list of which the task state is waiting to be executed.
Optionally, before periodically acquiring the message in the message queue and determining the execution state of the task in the execution engine, the method further includes:
determining an initial task that needs to be executed first; and issuing the initial task to the task engine.
Optionally, the task comprises a first task and a second task; the first task and the second task have different task frequencies; screening the current task to be executed according to the dependency relationship, the trigger condition and the task list, which specifically comprises the following steps: determining whether the first task is completed according to the task list; when the first task is finished, judging whether the triggering condition of the second task is met; and if so, issuing the second task to the execution engine.
A second aspect of an embodiment of the present invention provides a task scheduling system. The task scheduling system comprises: the storage unit is used for storing the dependency relationship and the triggering condition among the existing tasks; the message queue is used for recording the execution condition of the task in the task engine; the scheduling unit is used for periodically acquiring the messages in the message queue; and screening the tasks to be executed currently according to the dependency relationship, the trigger condition and the task list, and sending the tasks to be executed currently to the execution engine.
Optionally, the scheduling unit includes: an analysis subunit and a judgment unit;
the analysis subunit is used for acquiring the messages in the message queue in a set period, analyzing the acquired messages to obtain a task execution state, and storing task information into a task list according to the task state;
the judging unit is used for traversing a task list with a task state of being executed and determining a downstream task of each task in the executed task list; and is
Judging whether the tasks depended by the downstream tasks are all executed or not according to the dependency relationship;
if yes, determining the task to be executed currently.
Optionally, the scheduling unit is further configured to read an existing timing task, determine an initial task that needs to be executed first, and issue the initial task to the task engine.
A third aspect of the embodiments of the present invention provides an electronic device for task scheduling. The electronic equipment comprises a processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface complete mutual communication through the communication bus;
the memory is used for storing at least one executable instruction which causes the processor to execute the steps of the task scheduling method.
A fourth aspect of the embodiments of the present invention provides a computer storage medium, where at least one executable instruction is stored in the computer storage medium, and the executable instruction causes a processor to execute the steps of the task scheduling method described above.
The task scheduling method provided by the embodiment of the invention realizes the decoupling between task execution and task scheduling through the message queue, ensures the flexibility of the task scheduling process, and meets the use requirements of real-time triggering, conditional triggering, simple management and the like.
The foregoing description is only an overview of the technical solutions of the embodiments of the present invention, and the embodiments of the present invention can be implemented according to the content of the description in order to make the technical means of the embodiments of the present invention more clearly understood, and the detailed description of the present invention is provided below in order to make the foregoing and other objects, features, and advantages of the embodiments of the present invention more clearly understandable.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
FIG. 1 is a flowchart of a task scheduling method according to an embodiment of the present invention;
FIG. 2 is a flow chart of step 140 provided by an embodiment of the present invention;
FIG. 3 is a functional block diagram of a task scheduling system provided by an embodiment of the present invention;
fig. 4 is a block diagram of an electronic device according to an embodiment of 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 some, not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It will be understood that the terms "comprises" and/or "comprising," when used in this specification and the appended claims, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
Fig. 1 shows a flowchart of a task scheduling method according to an embodiment of the present invention. The method can be applied to a task scheduling system and is used for scheduling the timing tasks of a back-end system platform or a big data system platform and realizing the ordered control among the tasks.
As shown in fig. 1, the method may include the steps of:
step 100: storing the dependency relationship among the existing tasks and the trigger condition.
The existing tasks are a series of timing tasks that have already been set, need to be executed, and the like. Corresponding dependency relationships exist between different tasks, for example, a specific task B needs to be executed after the task a is completed. The trigger condition refers to a condition that a task is triggered, for example, a daily timed task or the like.
The dependencies and trigger conditions of these existing tasks may be stored in the persistent storage engine, and recorded and stored for a long time.
Step 120: and periodically acquiring and analyzing the messages in the message queue.
The period for acquiring the messages in the message queue can be set according to the needs of actual conditions, and is an empirical value. By periodically acquiring the messages in the message queue and analyzing the messages, the execution state of the determined tasks can be periodically updated, and the execution condition of each task can be determined.
Step 130: a task list formed by dividing the execution state of the task is determined. According to the execution state of the tasks, the tasks can be divided into corresponding task lists. Different task lists correspond to different execution states.
The function module related to scheduling may acquire the messages in the message queue at a set period. And then, analyzing the acquired message according to a set analysis mode, acquiring corresponding task state data and storing the task state data into different task state lists.
In this embodiment, the message queue stores task-related data, and the scheduling unit obtains task state information by reading and analyzing messages in the message queue. And then storing the task information into different task lists according to the task state. That is, the task list is divided according to task states.
Step 140: and screening the current task to be executed according to the dependency relationship, the trigger condition and the task list.
As described above, the dependency relationship indicates the sequence of task execution, and the task that needs to be executed at present can be screened and determined by integrating the dependency relationship and the current task execution condition provided by the task list, so as to complete task scheduling.
Step 160: and issuing the task to be executed to an execution engine. The execution engine is a module for executing tasks, and any suitable type of engine can be selected and used according to the needs of the actual situation. After receiving the issued task, the method executes the content of the issued task.
Step 180: and updating the message queue according to the task execution condition of the execution engine.
The message queue keeps track of the execution of the task. Therefore, based on the execution result of the execution engine on the task, the message queue can be updated accordingly to ensure the real-time performance of the execution situation of the task.
With reference to fig. 1, in the initial stage of task scheduling, an initialization procedure needs to be set to determine the task that needs to be issued to the execution engine for execution, where the initialization procedure includes:
step 110: an initial task that needs to be performed first is determined.
The determination of the initial task may be judged by a rule of a trigger condition or the like, and a task that needs to be executed first, which has the earliest trigger time and is not dependent on other tasks, may be selected as the initial task.
After determining the initial task, step 160 may be executed to issue the initial task to the task engine for execution so as to complete the initialization process. As the initial task is executed by the execution engine, the message queue correspondingly shows the execution condition of the initial task. Accordingly, the process of task scheduling can be realized by circularly executing the continuous scheduling checking period formed by the steps 120 to 180.
Fig. 2 is a flowchart illustrating a specific step of step 140 according to an embodiment of the present invention. When the message queue is divided in the form of a task list, as shown in fig. 2, the process of screening currently to be executed specifically includes:
step 141: and traversing the task list with the task state being the executed task list, and determining the downstream task of each task in the executed task list.
The downstream task refers to other tasks which need to be downstream of the task execution schedule on the basis of the executed task. The downstream task may have one or more, and belong to the downstream task as long as the task whose execution order is lower than the executed task belongs to the downstream task.
Step 142: and judging whether the tasks depended by the downstream tasks are all executed or not according to the dependency relationship. If yes, go to step 143, otherwise go to step 144.
For the downstream task, it needs to further determine whether the task it depends on has been executed. For example, for downstream task C, it may depend on tasks B and A. Tasks a and B may only be executed if they are both completed.
Step 143: and determining the task to be executed currently.
When the tasks depended on by the tasks are displayed by traversing the task list and are completely executed, the task can be determined to be executed and provided to the execution engine.
Step 144: and moving to a task state to be a task list waiting to be executed.
If some dependent tasks are not completed, the downstream tasks need to wait for the completion of the execution of the dependent tasks. Additionally, a task list with the state of waiting for execution is arranged for accommodating the tasks in the waiting state.
The task list waiting to be executed can be re-determined whether the task list can be executed according to the updated message queue condition in the next scheduling checking period.
The following describes the task scheduling method provided by the embodiment of the present invention in detail, taking the example that the daily report task of the last day automatically triggers the monthly report task.
The task A is a daily report task, the task B is a monthly report task, and the dependency relationship between the task B and the task A is as follows: and after the daily report task A on the last day of each month is executed, automatically triggering. And the task B is provided with a corresponding trigger condition. It should be noted that the daily and monthly report tasks are for illustration only and are not meant to limit the present invention. Both task a and task B may be tasks with any task frequency. The task frequency refers to the period of task execution. For tasks with different task frequencies, in some embodiments, it may also be referred to as a "first task" and a "second task" to distinguish.
Correspondingly, the process of screening the tasks to be executed at present specifically includes:
firstly, whether the daily report task is completed or not is determined according to the information in the information queue acquired by analysis. Then, when the daily report task of the last day of each month is completed, it is determined whether the monthly report task satisfies all the execution conditions. The execution conditions include whether the tasks depended on by the execution are executed, whether all the trigger conditions of the monthly report tasks are met, and the like.
And if so, issuing the monthly report task to the execution engine. If not, the monthly report task is ignored and is put into a task list waiting to be executed.
According to the task scheduling method provided by the embodiment of the invention, the decoupling between task execution and task dependence is realized by acquiring the message of the message queue, the scheduling flexibility is effectively improved, and whether the dependent task is executed or not does not need to be detected every time in the execution process of the timing task.
Fig. 3 is a schematic structural diagram illustrating a task scheduling system according to an embodiment of the present invention. As shown in fig. 3, the task scheduling system may include: a storage unit 310, a scheduling unit 320, and an execution engine 330.
The storage unit 310 is used for storing the dependency relationship between the existing tasks and the trigger condition. The task execution of the execution engine 330 is shown and recorded in the form of a message queue. The scheduling unit 320 is configured to periodically obtain messages in the message queue; analyzing the acquired message and storing the message into different task state lists according to the task state; and screening the tasks to be executed currently according to the dependency relationship, the trigger condition and the task list, and sending the tasks to be executed currently to the execution engine. The storage unit may be a persistent storage engine that maintains data information in the form of persistent storage for a long period of time.
Referring to fig. 3, the scheduling unit 320 may specifically include a parsing subunit 321 and a determining unit 322.
The parsing subunit 321 is configured to obtain, in a set period, the messages in the message queue, parse the obtained messages, and obtain different task lists. The determining unit 322 is configured to traverse a task list whose task state is that the task has been executed, and determine a downstream task of each task in the task list that has been executed; judging whether the tasks depended by the downstream tasks are all executed or not according to the dependency relationship; if yes, determining the task to be executed currently.
Of course, in the initial stage of task scheduling, the scheduling unit 320 may also determine an initial task that needs to be executed first by reading an existing timing task, and issue the initial task to the task engine to complete the initial task scheduling process.
By the task scheduling system provided by the embodiment of the invention, the separation processing between execution and scheduling is realized by using the message queue, the dependent task does not need to be judged before each time of periodically executing the task, and the task scheduling system has a good application prospect.
An embodiment of the present invention provides a non-volatile computer storage medium, where at least one executable instruction is stored in the computer storage medium, and the computer executable instruction may execute the task scheduling method in any method embodiment described above.
The executable instructions may be specifically configured to cause the processor to: storing the dependency relationship and the triggering condition among the existing tasks; periodically acquiring and analyzing the messages in the message queue, and determining a task list formed by dividing the execution state of the task; screening the current task to be executed according to the dependency relationship, the trigger condition and the task list; issuing the task to be executed to an execution engine; and updating the message queue according to the task execution condition of the execution engine.
Fig. 4 is a schematic structural diagram of an embodiment of an electronic device according to an embodiment of the present invention, and the specific embodiment of the present invention does not limit the specific implementation of the electronic device.
As shown in fig. 4, the electronic device may include: a processor (processor)402, a Communications Interface 404, a memory 406, and a Communications bus 408.
The processor 402, the communication interface 404, and the memory 406 communicate with each other via a communication bus 408. A communication interface 404 for communicating with network elements of other devices, such as clients or other servers. The processor 402 is configured to execute the program 410, and may specifically perform relevant steps in the above-described task scheduling method embodiment.
In particular, program 410 may include program code comprising computer operating instructions.
The processor 402 may be a central processing unit CPU, or an application specific Integrated circuit asic, or one or more Integrated circuits configured to implement an embodiment of the present invention. The electronic device comprises one or more processors, which can be the same type of processor, such as one or more CPUs; or may be different types of processors such as one or more CPUs and one or more ASICs.
And a memory 406 for storing a program 410. Memory 406 may comprise high-speed RAM memory, and may also include non-volatile memory (non-volatile memory), such as at least one disk memory.
The program 410 may specifically be configured to cause the processor 402 to perform the following operations: storing the dependency relationship and the triggering condition among the existing tasks; periodically acquiring and analyzing the messages of the message queue, and determining a task list formed by dividing the execution state of the task; screening the current task to be executed according to the dependency relationship, the trigger condition and the task list; issuing the task to be executed to an execution engine; and updating the message queue according to the task execution condition of the execution engine.
The algorithms or displays presented herein are not inherently related to any particular computer, virtual system, or other apparatus. Various general purpose systems may also be used with the teachings herein. The required structure for constructing such a system will be apparent from the description above. In addition, embodiments of the present invention are not directed to any particular programming language. It is appreciated that a variety of programming languages may be used to implement the teachings of the present invention as described herein, and any descriptions of specific languages are provided above to disclose the best mode of the invention.
In the description provided herein, numerous specific details are set forth. It is understood, however, that embodiments of the invention may be practiced without these specific details. In some instances, well-known methods, structures and techniques have not been shown in detail in order not to obscure an understanding of this description.
Similarly, it should be appreciated that in the foregoing description of exemplary embodiments of the invention, various features of the embodiments of the invention are sometimes grouped together in a single embodiment, figure, or description thereof for the purpose of streamlining the invention and aiding in the understanding of one or more of the various inventive aspects. However, the disclosed method should not be interpreted as reflecting an intention that: that the invention as claimed requires more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive aspects lie in less than all features of a single foregoing disclosed embodiment. Thus, the claims following the detailed description are hereby expressly incorporated into this detailed description, with each claim standing on its own as a separate embodiment of this invention.
Those skilled in the art will appreciate that the modules in the device in an embodiment may be adaptively changed and disposed in one or more devices different from the embodiment. The modules or units or components of the embodiments may be combined into one module or unit or component, and furthermore they may be divided into a plurality of sub-modules or sub-units or sub-components. All of the features disclosed in this specification (including any accompanying claims, abstract and drawings), and all of the processes or elements of any method or apparatus so disclosed, may be combined in any combination, except combinations where at least some of such features and/or processes or elements are mutually exclusive. Each feature disclosed in this specification (including any accompanying claims, abstract and drawings) may be replaced by alternative features serving the same, equivalent or similar purpose, unless expressly stated otherwise.
While the invention has been described with reference to specific embodiments, the invention is not limited thereto, and various equivalent modifications and substitutions can be easily made by those skilled in the art within the technical scope of the invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (10)
1. A method for task scheduling, comprising:
storing the dependency relationship and the triggering condition among the existing tasks;
periodically acquiring and analyzing the messages in the message queue;
determining a task list formed by dividing the execution state of the task;
screening the current task to be executed according to the dependency relationship, the trigger condition and the task list;
issuing the task to be executed to an execution engine;
and updating the message queue according to the task execution condition of the execution engine.
2. The task scheduling method according to claim 1, wherein periodically acquiring and parsing the messages in the message queue specifically comprises:
acquiring the messages in the message queue according to a set period;
analyzing the acquired message, acquiring a task execution state, and storing the task information into a corresponding task list according to the task state.
3. The task scheduling method according to claim 2, wherein the task to be executed at present is screened according to the dependency relationship, the trigger condition and the task list, and specifically includes:
traversing a task list with a task state being completed, and determining a downstream task of each task in the completed task list;
judging whether the tasks depended by the downstream tasks are all executed or not according to the dependency relationship;
if yes, determining the task to be executed currently;
if not, moving to a task list of which the task state is waiting to be executed.
4. The task scheduling method according to claim 1, wherein before periodically acquiring the messages in the message queue and determining the execution state of the task in the execution engine, the method further comprises:
determining an initial task that needs to be executed first;
and issuing the initial task to the task engine.
5. The task scheduling method according to claim 3, wherein the task includes a first task and a second task; the first task and the second task have different task frequencies;
screening the current task to be executed according to the dependency relationship, the trigger condition and the task list, which specifically comprises the following steps:
traversing a task list, and determining whether the first task is completed;
when the first task is finished, judging whether the second task meets all execution conditions;
and if so, issuing the second task to the execution engine.
6. A task scheduling system, the task scheduling system comprising:
the storage unit is used for storing the dependency relationship and the triggering condition among the existing tasks;
the message queue is used for recording the execution condition of the task in the task engine;
the scheduling unit is used for periodically acquiring the messages in the message queue; screening the current task to be executed according to the dependency relationship, the trigger condition and the task list, and screening
And issuing the task to be executed to the execution engine.
7. The task scheduling system of claim 6, wherein the scheduling unit comprises: an analysis subunit and a judgment unit;
the analysis subunit is used for acquiring the message in the message queue in a set period, analyzing the message to acquire a task state, and storing task information into a task list according to the task state;
the judging unit is used for traversing a task list with a task state of being executed and determining a downstream task of each task in the executed task list; and is
Judging whether the tasks depended by the downstream tasks are all executed or not according to the dependency relationship;
if yes, determining the task to be executed currently.
8. The task scheduling system of claim 6 wherein the scheduling unit is further configured to read existing timed tasks, determine an initial task that needs to be first executed, and
and issuing the initial task to the task engine.
9. An electronic device for task scheduling is characterized by comprising a processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface complete mutual communication through the communication bus;
the memory is for storing at least one executable computer program instruction for causing the processor to perform the steps of the task scheduling method according to any one of claims 1-5.
10. A computer storage medium having stored therein at least one executable computer program instruction for causing a processor to perform the steps of the task scheduling method according to any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910936828.0A CN110704173A (en) | 2019-09-29 | 2019-09-29 | Task scheduling method, scheduling system, electronic device and computer storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910936828.0A CN110704173A (en) | 2019-09-29 | 2019-09-29 | Task scheduling method, scheduling system, electronic device and computer storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110704173A true CN110704173A (en) | 2020-01-17 |
Family
ID=69197455
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910936828.0A Pending CN110704173A (en) | 2019-09-29 | 2019-09-29 | Task scheduling method, scheduling system, electronic device and computer storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110704173A (en) |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111309464A (en) * | 2020-02-12 | 2020-06-19 | 杭州涂鸦信息技术有限公司 | Task scheduling method and system |
| CN111338705A (en) * | 2020-02-13 | 2020-06-26 | 贝壳技术有限公司 | Data processing method, device and storage medium |
| CN112286664A (en) * | 2020-10-30 | 2021-01-29 | 中国平安财产保险股份有限公司 | Task scheduling method and device, computer equipment and readable storage medium |
| CN112286661A (en) * | 2020-10-30 | 2021-01-29 | 海通证券股份有限公司 | Task scheduling method and device, storage medium and terminal |
| CN112559143A (en) * | 2020-12-04 | 2021-03-26 | 海南车智易通信息技术有限公司 | Task scheduling method and system and computing device |
| CN112650573A (en) * | 2020-12-31 | 2021-04-13 | 中国农业银行股份有限公司 | Task scheduling method and device |
| CN112925624A (en) * | 2021-03-17 | 2021-06-08 | 中国电子***技术有限公司 | Configuration method and device of data processing task |
| CN113010289A (en) * | 2021-03-17 | 2021-06-22 | 杭州遥望网络科技有限公司 | Task scheduling method, device and system |
| CN113268318A (en) * | 2021-04-07 | 2021-08-17 | 北京思特奇信息技术股份有限公司 | Task scheduling method and distributed system |
| CN114095487A (en) * | 2020-07-30 | 2022-02-25 | 中移(苏州)软件技术有限公司 | Remote task execution method and device and storage medium |
| CN116721007A (en) * | 2023-08-02 | 2023-09-08 | 摩尔线程智能科技(北京)有限责任公司 | Task control method, system and device, electronic equipment and storage medium |
| CN116882716A (en) * | 2023-09-08 | 2023-10-13 | 长城证券股份有限公司 | Task scheduling method, device and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2664989A1 (en) * | 2012-05-14 | 2013-11-20 | Alcatel-Lucent | Task scheduling |
| CN103678133A (en) * | 2013-12-18 | 2014-03-26 | 中国科学院深圳先进技术研究院 | Task scheduling system for application software cloud testing |
| CN104657212A (en) * | 2015-02-13 | 2015-05-27 | 北京亚信数据有限公司 | Task scheduling method and system |
| US9104500B1 (en) * | 2011-09-29 | 2015-08-11 | Emc Corporation | Lock-free job scheduler for multi-processor systems |
| CN106980543A (en) * | 2017-04-05 | 2017-07-25 | 福建智恒软件科技有限公司 | The distributed task dispatching method and device triggered based on event |
| CN109445926A (en) * | 2018-11-09 | 2019-03-08 | 杭州玳数科技有限公司 | Data task dispatching method and data task dispatch system |
-
2019
- 2019-09-29 CN CN201910936828.0A patent/CN110704173A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9104500B1 (en) * | 2011-09-29 | 2015-08-11 | Emc Corporation | Lock-free job scheduler for multi-processor systems |
| EP2664989A1 (en) * | 2012-05-14 | 2013-11-20 | Alcatel-Lucent | Task scheduling |
| CN103678133A (en) * | 2013-12-18 | 2014-03-26 | 中国科学院深圳先进技术研究院 | Task scheduling system for application software cloud testing |
| CN104657212A (en) * | 2015-02-13 | 2015-05-27 | 北京亚信数据有限公司 | Task scheduling method and system |
| CN106980543A (en) * | 2017-04-05 | 2017-07-25 | 福建智恒软件科技有限公司 | The distributed task dispatching method and device triggered based on event |
| CN109445926A (en) * | 2018-11-09 | 2019-03-08 | 杭州玳数科技有限公司 | Data task dispatching method and data task dispatch system |
Non-Patent Citations (2)
| Title |
|---|
| 吴小竹: "地理知识云服务发现与组合技术研究", 《中国博士学位论文全文数据库 信息科技辑》 * |
| 吴小竹: "地理知识云服务发现与组合技术研究", 《中国博士学位论文全文数据库 信息科技辑》, 15 October 2016 (2016-10-15), pages 139 - 8 * |
Cited By (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111309464A (en) * | 2020-02-12 | 2020-06-19 | 杭州涂鸦信息技术有限公司 | Task scheduling method and system |
| CN111338705A (en) * | 2020-02-13 | 2020-06-26 | 贝壳技术有限公司 | Data processing method, device and storage medium |
| CN114095487A (en) * | 2020-07-30 | 2022-02-25 | 中移(苏州)软件技术有限公司 | Remote task execution method and device and storage medium |
| CN114095487B (en) * | 2020-07-30 | 2024-03-19 | 中移(苏州)软件技术有限公司 | Remote task execution method, device and storage medium |
| CN112286661B (en) * | 2020-10-30 | 2021-10-15 | 海通证券股份有限公司 | Task scheduling method and device, storage medium and terminal |
| CN112286661A (en) * | 2020-10-30 | 2021-01-29 | 海通证券股份有限公司 | Task scheduling method and device, storage medium and terminal |
| CN112286664A (en) * | 2020-10-30 | 2021-01-29 | 中国平安财产保险股份有限公司 | Task scheduling method and device, computer equipment and readable storage medium |
| CN112286664B (en) * | 2020-10-30 | 2024-05-28 | 中国平安财产保险股份有限公司 | Task scheduling method, device, computer equipment and readable storage medium |
| CN112559143A (en) * | 2020-12-04 | 2021-03-26 | 海南车智易通信息技术有限公司 | Task scheduling method and system and computing device |
| CN112650573A (en) * | 2020-12-31 | 2021-04-13 | 中国农业银行股份有限公司 | Task scheduling method and device |
| CN112650573B (en) * | 2020-12-31 | 2024-04-12 | 中国农业银行股份有限公司 | Task scheduling method and device |
| CN112925624A (en) * | 2021-03-17 | 2021-06-08 | 中国电子***技术有限公司 | Configuration method and device of data processing task |
| CN113010289A (en) * | 2021-03-17 | 2021-06-22 | 杭州遥望网络科技有限公司 | Task scheduling method, device and system |
| CN113268318A (en) * | 2021-04-07 | 2021-08-17 | 北京思特奇信息技术股份有限公司 | Task scheduling method and distributed system |
| CN116721007B (en) * | 2023-08-02 | 2023-10-27 | 摩尔线程智能科技(北京)有限责任公司 | Task control method, system and device, electronic equipment and storage medium |
| CN116721007A (en) * | 2023-08-02 | 2023-09-08 | 摩尔线程智能科技(北京)有限责任公司 | Task control method, system and device, electronic equipment and storage medium |
| CN116882716B (en) * | 2023-09-08 | 2024-03-08 | 长城证券股份有限公司 | Task scheduling method, device and storage medium |
| CN116882716A (en) * | 2023-09-08 | 2023-10-13 | 长城证券股份有限公司 | Task scheduling method, device and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110704173A (en) | Task scheduling method, scheduling system, electronic device and computer storage medium | |
| CN106371894B (en) | Configuration method and device and data processing server | |
| US9319281B2 (en) | Resource management method, resource management device, and program product | |
| EP2254049A2 (en) | Job scheduling apparatus and job scheduling method | |
| CN113641457A (en) | Container creation method, device, apparatus, medium, and program product | |
| CN108574645B (en) | Queue scheduling method and device | |
| CN112988281B (en) | Application starting method and device | |
| CN111225029A (en) | Dynamic message pushing method and system and automobile diagnosis server | |
| CN113886069A (en) | Resource allocation method and device, electronic equipment and storage medium | |
| CN115328741A (en) | Exception handling method, device, equipment and storage medium | |
| CN112860387A (en) | Distributed task scheduling method and device, computer equipment and storage medium | |
| CN113885971A (en) | State management method and device based on self-adaptive platform system | |
| CN116483546B (en) | Distributed training task scheduling method, device, equipment and storage medium | |
| CN109257256B (en) | Equipment monitoring method and device, computer equipment and storage medium | |
| CN111831408A (en) | Asynchronous task processing method and device, electronic equipment and medium | |
| CN111046007B (en) | Method, apparatus and computer program product for managing a storage system | |
| CN114995982A (en) | Task processing method and device and storage medium | |
| CN115756615A (en) | Quick starting method, device, equipment and storage medium | |
| CN115469940A (en) | Software service processing method, electronic device and storage medium | |
| JP5387083B2 (en) | Job management system and method | |
| CN112685334A (en) | Method, device and storage medium for block caching of data | |
| CN114153427A (en) | Optimization method and system of continuous integration assembly line | |
| CN111258728A (en) | Task execution method and device, storage medium and electronic device | |
| CN109491948B (en) | Data processing method and device for double ports of solid state disk | |
| CN110932927B (en) | Service processing method, device, equipment and readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200117 |