CN112181625A - Task scheduling method, system, device, storage medium and computer equipment - Google Patents
Task scheduling method, system, device, storage medium and computer equipment Download PDFInfo
- Publication number
- CN112181625A CN112181625A CN202011085820.7A CN202011085820A CN112181625A CN 112181625 A CN112181625 A CN 112181625A CN 202011085820 A CN202011085820 A CN 202011085820A CN 112181625 A CN112181625 A CN 112181625A
- Authority
- CN
- China
- Prior art keywords
- task
- executed
- execution
- execution condition
- meets
- 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 45
- 230000007717 exclusion Effects 0.000 claims description 15
- 230000008569 process Effects 0.000 claims description 8
- 238000010586 diagram Methods 0.000 description 6
- 238000004891 communication Methods 0.000 description 4
- 238000004590 computer program Methods 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000003252 repetitive effect Effects 0.000 description 3
- 230000002159 abnormal effect Effects 0.000 description 2
- 238000013500 data storage Methods 0.000 description 2
- 230000007547 defect Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000007704 transition 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
-
- 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/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
- G06F9/5038—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration
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)
Abstract
In the technical scheme of the task scheduling method, the system, the device, the storage medium and the computer device provided by the embodiment of the invention, the task to be executed reported by the execution terminal is obtained, whether the task to be executed meets the execution condition is judged, if the task to be executed meets the execution condition is judged, the task to be executed is executed, and if the task to be executed does not meet the execution condition is judged, the step of judging whether the task to be executed meets the execution condition is continuously executed, so that the task to be executed meeting the execution condition can be normally executed, and the task to be executed which does not meet the execution condition needs to return to the waiting queue, so that the task to be executed can be smoothly executed next time when the execution condition is met, and the accuracy of the execution time of the task to be executed is ensured.
Description
[ technical field ] A method for producing a semiconductor device
The invention relates to the technical field of vehicle-mounted communication, in particular to a task scheduling method, a system, a device, a storage medium and computer equipment.
[ background of the invention ]
Task scheduling systems currently on the market typically schedule with a single machine node. If the current machine is abnormal and cannot execute the scheduling task in the execution process, the task execution is easily disordered and even the system is falsely dead, and the task cannot be completed according to the nodes.
[ summary of the invention ]
In view of the above, the present invention provides a task scheduling method, system, apparatus, storage medium and computer device, so as to overcome the above-mentioned defects in the prior art and ensure the accuracy of the execution time of the task to be executed.
In one aspect, an embodiment of the present invention provides a task scheduling method, including:
acquiring a task to be executed reported by an execution terminal;
judging whether the task to be executed meets an execution condition;
if the task to be executed meets the execution condition, executing the task to be executed;
and if the to-be-executed task does not meet the execution condition, continuing to execute the step of judging whether the to-be-executed task meets the execution condition.
Optionally, the determining whether the task to be executed meets the execution condition includes:
acquiring current time;
judging whether the current time is within the task execution time of the task to be executed or not;
if the task to be executed meets the execution condition, executing the task to be executed, including:
and if the current time is within the task execution time of the task to be executed, executing the task to be executed.
Optionally, the determining whether the task to be executed meets the execution condition includes:
judging whether the relation between the task to be executed and the executed task comprises a mutual exclusion relation, wherein the mutual exclusion relation is used for indicating that the task to be executed and the executed task cannot be executed simultaneously;
if the task to be executed meets the execution condition, executing the task to be executed, including:
and if the relation between the task to be executed and the executed task does not comprise a mutual exclusion relation, executing the task to be executed.
Optionally, before the determining whether the task to be executed satisfies the execution condition, the method includes:
inquiring whether a task list to be executed comprises the task to be executed;
if the task list to be executed comprises the task to be executed, continuing to execute the step of judging whether the task to be executed meets the execution condition;
and if the task to be executed is not included in the task list to be executed, adding the task to be executed in the task list to be executed according to the acquired task information of the task to be executed.
Optionally, after the executing the task to be executed if it is determined that the task to be executed satisfies the execution condition, the method further includes:
and storing the execution state data of the task to be executed, wherein the execution state data is used for indicating data generated in the task to be executed in the task execution process.
In another aspect, an embodiment of the present invention provides a task scheduling system, where the system includes: the system comprises a task scheduling platform and an execution terminal, wherein the task scheduling platform is connected with the execution terminal;
the execution terminal is used for reporting a task to be executed to the task scheduling platform;
the task scheduling platform is used for acquiring a task to be executed reported by the execution terminal;
the task scheduling platform is further configured to determine whether the to-be-executed task meets an execution condition, execute the to-be-executed task if it is determined that the to-be-executed task meets the execution condition, and continue to execute the step of determining whether the to-be-executed task meets the execution condition if it is determined that the to-be-executed task does not meet the execution condition.
In another aspect, an embodiment of the present invention provides a task scheduling apparatus, where the apparatus includes:
the acquisition module is used for acquiring the tasks to be executed reported by the execution terminal;
the judging module is used for judging whether the task to be executed meets the execution condition;
and the execution module is used for executing the task to be executed if the task to be executed meets the execution condition, and continuing to execute the step of judging whether the task to be executed meets the execution condition if the task to be executed does not meet the execution condition.
On the other hand, an embodiment of the present invention provides a storage medium, where the storage medium includes a stored program, and when the program runs, a device in which the storage medium is located is controlled to execute the above task scheduling method.
In another aspect, an embodiment of the present invention provides a computer device, including a memory and a processor, where the memory is used to store information including program instructions, and the processor is used to control execution of the program instructions, and the program instructions are loaded by the processor and execute the steps of the task scheduling method described above.
In the technical scheme provided by the embodiment of the invention, the task to be executed reported by the execution terminal is obtained, whether the task to be executed meets the execution condition is judged, if the task to be executed meets the execution condition is judged, the task to be executed is executed, and if the task to be executed does not meet the execution condition is judged, the step of judging whether the task to be executed meets the execution condition is continuously executed, so that the task to be executed meeting the execution condition can be normally executed, and the task to be executed which does not meet the execution condition needs to return to the waiting queue, so that the task to be executed can be smoothly executed next time when the execution condition is met, and the accuracy of the execution time of the task to be executed is ensured.
[ description of the 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 embodiments will be briefly described below, and it is obvious that the drawings in the following description are only 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 inventive labor.
FIG. 1 is an architecture diagram of a task scheduling system according to an embodiment of the present invention;
FIG. 2 is a flowchart of a task scheduling method according to an embodiment of the present invention;
FIG. 3 is a flowchart of a task scheduling method according to another embodiment of the present invention;
FIG. 4 is a schematic structural diagram of a task scheduling device according to an embodiment of the present invention;
fig. 5 is a schematic diagram of a computer device according to an embodiment of the present invention.
[ detailed description ] embodiments
For better understanding of the technical solutions of the present invention, the following detailed descriptions of the embodiments of the present invention are provided with reference to the accompanying drawings.
It should be understood that the described embodiments are only some embodiments of the invention, and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The terminology used in the embodiments of the invention is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used in the examples of the present invention and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.
It should be understood that the term "and/or" as used herein is merely one type of associative relationship that describes an associated object, meaning that three types of relationships may exist, e.g., A and/or B, may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter related objects are in an "or" relationship.
Fig. 1 is an architecture diagram of a task scheduling system according to an embodiment of the present invention, as shown in fig. 1, the system includes: the task scheduling platform 10 is connected with the execution terminal 20, and the task scheduling platform 10 is connected with the execution terminal 20, wherein the task scheduling platform 10 includes a task scheduling judgment unit 101, an execution condition judgment unit 102, and a task data storage unit 103.
It should be noted that the task scheduling platform 10 supports Http network communication, and the task scheduling platform 10 is a JAVA operating environment. The execution terminal 20 may include a mobile phone terminal or a PC terminal, and furthermore, the execution terminal 20 may further include a browser for displaying text or pictures. The execution terminal 20 is configured to report the task to be executed to the task scheduling platform.
The task scheduling platform 10 is configured to obtain a task to be executed, which is reported by an execution terminal.
The task scheduling platform 10 is further configured to determine whether the to-be-executed task meets the execution condition, execute the to-be-executed task if it is determined that the to-be-executed task meets the execution condition, and continue to execute the step of determining whether the to-be-executed task meets the execution condition if it is determined that the to-be-executed task does not meet the execution condition.
Specifically, in the embodiment of the present invention, the execution condition determining unit 102 of the task scheduling platform 10 is specifically configured to obtain the current time; and judging whether the current time is within the task execution time of the task to be executed, and executing the task to be executed if the current time is within the task execution time of the task to be executed.
In this embodiment of the present invention, the execution condition determining unit 102 of the task scheduling platform 10 is specifically configured to determine whether a relationship between the to-be-executed task and the executed task includes a mutual exclusion relationship, where the mutual exclusion relationship is used to indicate that the to-be-executed task and the executed task cannot be executed simultaneously; and if the relation between the task to be executed and the executed task does not comprise the mutual exclusion relation, executing the task to be executed.
In the embodiment of the present invention, further, the task scheduling determining unit 101 of the task scheduling platform 10 is configured to query whether the to-be-executed task list includes the to-be-executed task; if the task list to be executed comprises the task to be executed, continuing to execute the step of judging whether the task to be executed meets the execution condition; and if the task to be executed is not included in the task list to be executed, adding the task to be executed in the task list to be executed according to the acquired task information of the task to be executed.
In this embodiment of the present invention, further, the task data storage unit 103 of the task scheduling platform 10 is configured to store execution state data of the task to be executed, where the execution state data is used to indicate data generated by the task to be executed in the task execution process.
By the task scheduling system, the to-be-executed task reported by the execution terminal can be acquired, whether the to-be-executed task meets the execution condition is judged, if the to-be-executed task meets the execution condition is judged, the to-be-executed task is executed, and if the to-be-executed task does not meet the execution condition is judged, the step of judging whether the to-be-executed task meets the execution condition is continuously executed, so that the to-be-executed task meeting the execution condition can be normally executed, and the to-be-executed task not meeting the execution condition needs to return to the waiting queue, so that the to-be-executed task can be smoothly executed next time when the execution condition is met, and the accuracy of the execution time of the to-be-executed task is.
Specifically, on the basis of the above system, a task scheduling method provided in the embodiment of the present invention is described in detail:
fig. 2 is a flowchart of a task scheduling method according to an embodiment of the present invention, and as shown in fig. 2, the method includes:
And 102, judging whether the task to be executed meets the execution condition.
And 103, executing the task to be executed if the task to be executed meets the execution condition.
And step 104, if the to-be-executed task is judged not to meet the execution condition, continuing to execute the step of judging whether the to-be-executed task meets the execution condition.
In the technical scheme provided by the embodiment of the invention, the task to be executed reported by the execution terminal is obtained, whether the task to be executed meets the execution condition is judged, if the task to be executed meets the execution condition is judged, the task to be executed is executed, and if the task to be executed does not meet the execution condition is judged, the step of judging whether the task to be executed meets the execution condition is continuously executed, so that the task to be executed meeting the execution condition can be normally executed, and the task to be executed which does not meet the execution condition needs to return to the waiting queue, so that the task to be executed can be smoothly executed next time when the execution condition is met, and the accuracy of the execution time of the task to be executed is ensured.
Fig. 3 is a flowchart of a task scheduling method according to another embodiment of the present invention, as shown in fig. 3, the method includes:
In the embodiment of the present invention, the task to be executed may include a business operation that a user needs to perform, where the task to be executed may include a business operation that needs to be repeatedly performed at a fixed time, for example, daily processing of external data, monthly card traffic reset, or business data state transition. Besides, the task scheduling method of the invention can also be adopted for non-repetitive business operations.
In the embodiment of the invention, by acquiring the tasks to be executed reported by the execution terminal, the task scheduling method can simultaneously carry out the configuration of task scheduling execution aiming at different repetitive tasks to be executed.
In the embodiment of the invention, before executing the task to be executed, the task scheduling platform needs to inquire whether the task to be executed is included in the task list to be executed, so as to judge whether the task to be executed meets the execution condition.
In the embodiment of the invention, the task to be executed can be added into the task list to be executed according to the acquired task information of the task to be executed in a mode of newly building the task to be executed by the task scheduling platform. Wherein the task information may include task execution time. By setting the task execution time of the task to be executed, whether the current time is within the task execution time of the task to be executed or not is judged when the task to be executed is executed, and therefore the accuracy of the task execution time is guaranteed.
In the embodiment of the present invention, as an alternative, the determining whether the task to be executed satisfies the execution condition includes: acquiring current time; judging whether the current time is within the task execution time of the task to be executed or not; if the current time is within the task execution time of the task to be executed, step 205 is executed.
In the embodiment of the invention, the task execution time of the task to be executed is the task execution time set when the task scheduling platform adds the task to be executed in the task list to be executed.
In the embodiment of the present invention, as another alternative, the determining whether the task to be executed satisfies the execution condition includes: it is determined whether the relationship between the to-be-executed task and the executed task includes the mutual exclusion relationship, and if it is determined that the relationship between the to-be-executed task and the executed task does not include the mutual exclusion relationship, step 205 is executed.
In the embodiment of the invention, the mutual exclusion relationship is used for indicating that the task to be executed and the executed task cannot be executed simultaneously. For example, taking the car networking platform as an example, when the task to be executed is to turn off the engine, and the vehicle is in a running state at this time, that is, the executed task is to run the vehicle, at this time, if the engine is turned off, the vehicle cannot run continuously, and a vehicle accident is easily caused.
It should be noted that, in the embodiment of the present invention, a cluster mode is adopted to support normal execution of tasks of the task scheduling platform. That is to say, when a certain machine of the task scheduling platform executes task scheduling, another server may monitor the task execution condition through the database state at the same time, and if the current machine is abnormal and cannot execute the scheduled task, that is, the to-be-executed task does not satisfy the execution condition, the cluster machine may continue to return to the to-be-executed task whose execution is suspended, so as to wait for the to-be-executed task to satisfy the execution condition, and then continue to execute the to-be-executed task, so as to ensure the accuracy of the task execution time.
And step 205, executing the task to be executed.
And step 206, storing the execution state data of the task to be executed.
In the embodiment of the invention, the execution state data is used for indicating the data generated by the task to be executed in the task execution process. By storing the execution state data of the tasks to be executed, subsequent system operators can adjust the tasks to be executed according to the execution state data of the tasks to be executed so as to optimize the operation flow of the task scheduling platform. In the technical scheme provided by the embodiment of the invention, the task to be executed reported by the execution terminal is obtained, whether the task to be executed meets the execution condition is judged, if the task to be executed meets the execution condition is judged, the task to be executed is executed, if the task to be executed does not meet the execution condition is judged, the step of judging whether the task to be executed meets the execution condition is continuously executed, so that the tasks to be executed which meet the execution conditions can be normally executed, and the tasks to be executed which do not meet the execution conditions need to return to the waiting queue so as to be smoothly executed next time when the execution conditions are met, thereby ensuring the accuracy of the execution time of the task to be executed, and in addition, by adopting the task scheduling method, the accuracy of the execution time of the task to be executed is guaranteed, meanwhile, the repetitive work of system operators is liberated, and the work efficiency is improved.
Fig. 4 is a schematic structural diagram of a task scheduling apparatus according to an embodiment of the present invention, and as shown in fig. 4, the task scheduling apparatus includes: an acquisition module 11, a judgment module 12 and an execution module 13.
The obtaining module 11 is configured to obtain a task to be executed, which is reported by an execution terminal.
The judging module 12 is configured to judge whether the task to be executed meets an execution condition.
The executing module 13 is configured to execute the to-be-executed task if it is determined that the to-be-executed task meets the executing condition, and continue to execute the step of determining whether the to-be-executed task meets the executing condition of the determining module 12 if the determining module 12 determines that the to-be-executed task does not meet the executing condition.
In the embodiment of the present invention, the determining module 12 is specifically configured to obtain the current time; and judging whether the current time is within the task execution time of the task to be executed. The execution module 13 is specifically configured to execute the task to be executed if the determination module 12 determines that the current time is within the task execution time of the task to be executed.
In this embodiment of the present invention, the determining module 12 is specifically configured to determine whether a relationship between the to-be-executed task and the executed task includes a mutual exclusion relationship, where the mutual exclusion relationship is used to indicate that the to-be-executed task and the executed task cannot be executed simultaneously. The executing module 13 is specifically configured to execute the task to be executed if the determining module 12 determines that the relationship between the task to be executed and the executed task does not include a mutual exclusion relationship.
In the embodiment of the present invention, the apparatus further includes: a query module 14 and an add module 15.
The query module 14 is configured to query whether the task list to be executed includes the task to be executed, and if the task list to be executed includes the task to be executed, continue to execute the step of determining whether the task to be executed satisfies the execution condition of the determination module 12.
The adding module 15 is configured to, if the task to be executed is not included in the task list to be executed as queried by the querying module 14, add the task to be executed in the task list to be executed according to the obtained task information of the task to be executed.
In the embodiment of the present invention, the apparatus further includes: a storage module 16.
The storage module 16 is configured to store execution state data of the task to be executed, where the execution state data is used to indicate data generated by the task to be executed in a task execution process.
In the technical scheme provided by the embodiment of the invention, the task to be executed reported by the execution terminal is obtained, whether the task to be executed meets the execution condition is judged, if the task to be executed meets the execution condition is judged, the task to be executed is executed, and if the task to be executed does not meet the execution condition is judged, the step of judging whether the task to be executed meets the execution condition is continuously executed, so that the task to be executed meeting the execution condition can be normally executed, and the task to be executed which does not meet the execution condition needs to return to the waiting queue, so that the task to be executed can be smoothly executed next time when the execution condition is met, and the accuracy of the execution time of the task to be executed is ensured.
An embodiment of the present invention provides a storage medium, where the storage medium includes a stored program, where, when the program runs, a device on which the storage medium is located is controlled to execute each step of the above embodiment of the task scheduling method, and for specific description, reference may be made to the above embodiment of the task scheduling method.
The embodiment of the invention provides computer equipment, which comprises a memory and a processor, wherein the memory is used for storing information comprising program instructions, the processor is used for controlling the execution of the program instructions, and the program instructions are loaded by the processor and realize the steps of the task scheduling method when being executed. For a detailed description, reference may be made to the above-described embodiments of the task scheduling method.
Fig. 5 is a schematic diagram of a computer device according to an embodiment of the present invention. As shown in fig. 5, the computer device 4 of this embodiment includes: the processor 41, the memory 42, and the computer program 43 stored in the memory 42 and capable of running on the processor 41, where the computer program 43 is executed by the processor 41 to implement the task scheduling method applied in the embodiment, and in order to avoid repetition, the details are not repeated herein. Alternatively, the computer program is executed by the processor 41 to implement the functions of the models/units applied in the task scheduling device in the embodiments, which are not described herein for avoiding redundancy.
The computer device 4 includes, but is not limited to, a processor 41, a memory 42. Those skilled in the art will appreciate that fig. 5 is merely an example of computer device 4 and is not intended to limit computer device 4 and may include more or fewer components than shown, or some of the components may be combined, or different components, e.g., computer device 4 may also include input-output devices, network access devices, buses, etc.
The Processor 41 may be a Central Processing Unit (CPU), other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic device, discrete hardware component, or the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
The storage 42 may be an internal storage unit of the computer device 4, such as a hard disk or a memory of the computer device 4. The memory 42 may also be an external storage device of the computer device 4, such as a plug-in hard disk provided on the computer device 4, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like. Further, the memory 42 may also include both internal storage units of the computer device 4 and external storage devices. The memory 42 is used for storing computer programs and other programs and data required by the computer device 4. The memory 42 may also be used to temporarily store data that has been output or is to be output.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the embodiments provided in the present invention, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, a division of a unit is merely a logical division, and an actual implementation may have another division, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
Units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, or in a form of hardware plus a software functional unit.
The integrated unit implemented in the form of a software functional unit may be stored in a computer readable storage medium. The software functional unit is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device) or a Processor (Processor) to execute some steps of the methods according to the embodiments of the present invention. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like made within the spirit and principle of the present invention should be included in the scope of the present invention.
Claims (9)
1. A method for task scheduling, comprising:
acquiring a task to be executed reported by an execution terminal;
judging whether the task to be executed meets an execution condition;
if the task to be executed meets the execution condition, executing the task to be executed;
and if the to-be-executed task does not meet the execution condition, continuing to execute the step of judging whether the to-be-executed task meets the execution condition.
2. The method according to claim 1, wherein the determining whether the task to be executed satisfies an execution condition comprises:
acquiring current time;
judging whether the current time is within the task execution time of the task to be executed or not;
if the task to be executed meets the execution condition, executing the task to be executed, including:
and if the current time is within the task execution time of the task to be executed, executing the task to be executed.
3. The method according to claim 1, wherein the determining whether the task to be executed satisfies an execution condition comprises:
judging whether the relation between the task to be executed and the executed task comprises a mutual exclusion relation, wherein the mutual exclusion relation is used for indicating that the task to be executed and the executed task cannot be executed simultaneously;
if the task to be executed meets the execution condition, executing the task to be executed, including:
and if the relation between the task to be executed and the executed task does not comprise a mutual exclusion relation, executing the task to be executed.
4. The method according to claim 1, wherein before said determining whether the task to be executed satisfies the execution condition, the method comprises:
inquiring whether a task list to be executed comprises the task to be executed;
if the task list to be executed comprises the task to be executed, continuing to execute the step of judging whether the task to be executed meets the execution condition;
and if the task to be executed is not included in the task list to be executed, adding the task to be executed in the task list to be executed according to the acquired task information of the task to be executed.
5. The method according to claim 1, wherein after the executing the task to be executed if it is determined that the task to be executed satisfies the execution condition, the method further comprises:
and storing the execution state data of the task to be executed, wherein the execution state data is used for indicating data generated in the task to be executed in the task execution process.
6. A task scheduling system, the system comprising: the system comprises a task scheduling platform and an execution terminal, wherein the task scheduling platform is connected with the execution terminal;
the execution terminal is used for reporting a task to be executed to the task scheduling platform;
the task scheduling platform is used for acquiring a task to be executed reported by the execution terminal;
the task scheduling platform is further configured to determine whether the to-be-executed task meets an execution condition, execute the to-be-executed task if it is determined that the to-be-executed task meets the execution condition, and continue to execute the step of determining whether the to-be-executed task meets the execution condition if it is determined that the to-be-executed task does not meet the execution condition.
7. A task scheduling apparatus, characterized in that the apparatus comprises:
the acquisition module is used for acquiring the tasks to be executed reported by the execution terminal;
the judging module is used for judging whether the task to be executed meets the execution condition;
and the execution module is used for executing the task to be executed if the task to be executed meets the execution condition, and continuing to execute the step of judging whether the task to be executed meets the execution condition if the task to be executed does not meet the execution condition.
8. A storage medium, characterized in that the storage medium comprises a stored program, wherein when the program runs, a device in which the storage medium is located is controlled to execute the task scheduling method according to any one of claims 1 to 5.
9. A computer device comprising a memory for storing information including program instructions and a processor for controlling the execution of the program instructions, characterized in that the program instructions are loaded and executed by the processor to implement the steps of the task scheduling method according to any of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011085820.7A CN112181625A (en) | 2020-10-12 | 2020-10-12 | Task scheduling method, system, device, storage medium and computer equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011085820.7A CN112181625A (en) | 2020-10-12 | 2020-10-12 | Task scheduling method, system, device, storage medium and computer equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112181625A true CN112181625A (en) | 2021-01-05 |
Family
ID=73949415
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011085820.7A Pending CN112181625A (en) | 2020-10-12 | 2020-10-12 | Task scheduling method, system, device, storage medium and computer equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112181625A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102455932A (en) * | 2010-10-22 | 2012-05-16 | 金蝶软件（中国）有限公司 | Serial execution method, device and system for task instances |
| CN108829521A (en) * | 2018-06-13 | 2018-11-16 | 平安科技（深圳）有限公司 | Task processing method and device, computer equipment and storage medium |
| CN110119306A (en) * | 2019-05-22 | 2019-08-13 | 无锡华云数据技术服务有限公司 | Operation Automatic dispatching equalization methods, device, equipment and storage medium |
| CN110543354A (en) * | 2019-09-05 | 2019-12-06 | 腾讯科技（深圳）有限公司 | Task scheduling method, device, equipment and storage medium |
| CN111104223A (en) * | 2019-12-17 | 2020-05-05 | 腾讯科技（深圳）有限公司 | Task processing method and device, computer readable storage medium and computer equipment |
-
2020
- 2020-10-12 CN CN202011085820.7A patent/CN112181625A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102455932A (en) * | 2010-10-22 | 2012-05-16 | 金蝶软件（中国）有限公司 | Serial execution method, device and system for task instances |
| CN108829521A (en) * | 2018-06-13 | 2018-11-16 | 平安科技（深圳）有限公司 | Task processing method and device, computer equipment and storage medium |
| CN110119306A (en) * | 2019-05-22 | 2019-08-13 | 无锡华云数据技术服务有限公司 | Operation Automatic dispatching equalization methods, device, equipment and storage medium |
| CN110543354A (en) * | 2019-09-05 | 2019-12-06 | 腾讯科技（深圳）有限公司 | Task scheduling method, device, equipment and storage medium |
| CN111104223A (en) * | 2019-12-17 | 2020-05-05 | 腾讯科技（深圳）有限公司 | Task processing method and device, computer readable storage medium and computer equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109840142B (en) | Thread control method and device based on cloud monitoring, electronic equipment and storage medium | |
| CN112311617A (en) | Configured data monitoring and alarming method and system | |
| CN111176937A (en) | Message middleware monitoring and warning system, method, terminal equipment and storage medium | |
| CN112612262A (en) | Production line testing method and device for vehicle-mounted equipment, computer equipment and storage medium | |
| CN112882939B (en) | Automatic testing method and device, electronic equipment and storage medium | |
| CN109839910B (en) | Control device, control method, and computer-readable storage medium | |
| CN115437339A (en) | Remote diagnosis method and device, electronic equipment and storage medium | |
| CN114157679A (en) | Cloud-native-based distributed application monitoring method, device, equipment and medium | |
| CN111459629A (en) | Azkaban-based project operation method and device and terminal equipment | |
| CN113489653A (en) | Message sending method and device and computer equipment | |
| CN109561134B (en) | Electronic device, distributed cluster service distribution method and storage medium | |
| CN111123728B (en) | Unmanned vehicle simulation method, device, equipment and computer readable medium | |
| CN112560939B (en) | Model verification method and device and computer equipment | |
| CN112052144B (en) | Information management method, device, electronic equipment and storage medium | |
| CN112181625A (en) | Task scheduling method, system, device, storage medium and computer equipment | |
| CN116860344A (en) | Flow management method, system, equipment and medium | |
| CN116303456A (en) | Industrial data processing method, system, device and computer readable storage medium | |
| CN114564249B (en) | Recommendation scheduling engine, recommendation scheduling method and computer readable storage medium | |
| CN111159009A (en) | Pressure testing method and device for log service system | |
| CN115269050A (en) | Multi-map calling method and device, storage medium and computer equipment | |
| CN115167378A (en) | Vehicle diagnosis mode control method, system, equipment and storage medium | |
| CN113342430A (en) | Fault code processing method and device, terminal equipment and readable storage medium | |
| CN112445431A (en) | Data storage method, device, equipment and medium | |
| CN112948370B (en) | Data classification method and device and computer equipment | |
| CN111224861B (en) | Method, system, equipment and storage medium for opening instant message service |
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 | ||
| CB02 | Change of applicant information |
Address after: 101500 room 106-266, building 2, courtyard 8, Xingsheng South Road, Miyun District, Beijing Applicant after: Unicom Zhiwang Technology Co.,Ltd. Address before: 101500 room 106-266, building 2, courtyard 8, Xingsheng South Road, Miyun District, Beijing Applicant before: Unicom Intelligent Network Technology Co., Ltd |
|
| CB02 | Change of applicant information |