CN111008072A - Task scheduling method and device, storage medium and electronic equipment - Google Patents
Task scheduling method and device, storage medium and electronic equipment Download PDFInfo
- Publication number
- CN111008072A CN111008072A CN201911359464.0A CN201911359464A CN111008072A CN 111008072 A CN111008072 A CN 111008072A CN 201911359464 A CN201911359464 A CN 201911359464A CN 111008072 A CN111008072 A CN 111008072A
- Authority
- CN
- China
- Prior art keywords
- task
- information
- period
- scheduling
- identifier
- 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 49
- 230000015654 memory Effects 0.000 claims description 17
- 238000004364 calculation method Methods 0.000 claims description 6
- 238000004590 computer program Methods 0.000 claims description 5
- 238000012545 processing Methods 0.000 abstract description 8
- 238000010586 diagram Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012544 monitoring process Methods 0.000 description 2
- 239000007787 solid Substances 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000004806 packaging method and process Methods 0.000 description 1
- 230000000737 periodic effect Effects 0.000 description 1
- 238000012163 sequencing technique Methods 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
-
- 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/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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/50—Indexing scheme relating to G06F9/50
- G06F2209/5011—Pool
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/50—Indexing scheme relating to G06F9/50
- G06F2209/5018—Thread allocation
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 task scheduling method, a device, a storage medium and an electronic device, wherein a task has a period identifier and is monitored according to a basic period, and the scheduling method comprises the following steps: acquiring task information corresponding to current time interval information, wherein the task information comprises scheduling time interval information and task cycle identification of a task; judging whether the period identifier is a preset identifier or not; when the identification is a preset identification, executing a task corresponding to the task information; the period mark is a multiple of the basic period, the current time period information is one of a plurality of time period information equally divided from the basic period, and each time period information corresponds to at least one task. The method comprises the steps of dividing a task to be scheduled according to preset time period information, calling a task corresponding to the current time period based on the time period information, judging whether the called task needs to be executed or not by utilizing a period identifier, scanning a task queue at the current moment during scheduling, and not scanning all task queues, so that the scanning scale is reduced, and the processing efficiency of complex tasks is improved.
Description
Technical Field
The invention relates to the technical field of data processing, in particular to a task scheduling method, a task scheduling device, a task scheduling storage medium and electronic equipment.
Background
There are many time-based scheduling scenarios in the task scheduling process, and in these scenarios, it is necessary to implement the function of running the task program at a specific time point or time interval. The prior art scheme of task scheduling at present is as follows:
the task scheduling device comprises the following operation steps: 1. the task scheduler scans the task list at each period of information or at a specific point in time; 2. selecting a task to be executed; 3. starting to execute a task; 4. calculating the time for starting the scheduling program next time; 5. repeating step 1 after a specified time; and a timer is used for calling in the scheduling process, and the scheduling can be realized based on the parallel task scheduling of the thread pool, for example, based on a periodic execution thread pool (scheduled executive) designed by the thread pool.
However, the existing task scheduling method needs to execute the tasks serially during task scheduling or scan all the tasks before execution, and thus it is difficult to implement scheduling of complex tasks.
Disclosure of Invention
The technical scheme provides a task scheduling method, a task scheduling device, a storage medium and electronic equipment to achieve scheduling of complex tasks.
According to a first aspect, an embodiment of the present invention provides a task scheduling method, where a task has a period identifier and is monitored according to a basic period, and the scheduling method includes: acquiring task information corresponding to current time interval information, wherein the task information comprises scheduling time interval information and task cycle identification of a task; judging whether the period identifier is a preset identifier or not; when the period identifier is a preset identifier, executing a task corresponding to the task information; the period mark is a multiple of the basic period, the current time period information is one of a plurality of time period information equally divided from the basic period, and each time period information corresponds to at least one task.
Optionally, before acquiring the task information corresponding to the current period information, the method includes: acquiring a current time scale; calculating the time interval between the execution time of the task to be scheduled and the current time based on the cycle identifier and the current time scale, and generating scheduling period information based on the time interval; task information is generated based on the scheduling period information and the cycle identification.
Optionally, the obtaining of the task information corresponding to the current period information includes: acquiring current time interval information; based on the current time interval information and the scheduling time interval information, task information is called in the task queue; and subtracting one from the period identifier in the task information to serve as a new period identifier.
Optionally, the determining whether the period identifier is a preset identifier includes: and judging whether the new period identifier is zero, and executing the task corresponding to the task information when the new period identifier is zero.
Optionally, when the value is not zero, the task corresponding to the task information is put back to the task queue.
Optionally, after executing the task corresponding to the task information, the method includes: resetting a period identifier corresponding to the task; acquiring an execution time scale when the task is executed; and updating the task information of the current task based on the execution time scale and the reset period identification.
According to a second aspect, an embodiment of the present invention provides a task scheduling apparatus, where a task has a period identifier and is monitored according to a basic period, and the scheduling apparatus includes: the first acquisition module is used for acquiring task information corresponding to current time interval information, and the task information comprises scheduling time interval information and task cycle identification of a task; the judging module is used for judging whether the period identifier is a preset identifier or not; the execution module is used for executing the task corresponding to the task information when the period identifier is a preset identifier; the period mark is a multiple of the basic period, the current time period information is one of a plurality of time period information equally divided from the basic period, and each time period information corresponds to at least one task.
Optionally, the task scheduling device further includes: the second acquisition module is used for acquiring the current time scale; the calculation module is used for calculating the time interval between the execution time of the task to be scheduled and the current time based on the period identification and the current time scale; a scheduling period information generating module for generating the scheduling period information based on the time interval; and the task information generating module is used for generating task information based on the scheduling period information and the cycle identifier.
According to a third aspect, an embodiment of the present invention provides a computer-readable storage medium, where computer instructions are stored, and the computer instructions are configured to cause a computer to execute the task scheduling method described in any one of the first aspect above.
According to a fourth aspect, an embodiment of the present invention provides an electronic device, including: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores a computer program executable by the at least one processor, the computer program being executable by the at least one processor to cause the at least one processor to perform the method of task scheduling as described in any one of the above first aspects.
The tasks to be scheduled are divided according to preset time interval information, each task has corresponding scheduling time interval information and a task cycle identifier, and a task scheduling plan at any time can be inquired at any time. The method includes the steps that tasks corresponding to the current time period are called based on time period information, whether the called tasks need to be executed or not is judged through task cycle identification, only task queues at the current moment need to be scanned during scheduling, all task information queues do not need to be scanned, the scanning scale is reduced, when the number of tasks is large, or complex tasks are scheduled, all tasks do not need to be polled, scheduling list scanning does not need to be conducted for a long time, and the processing efficiency of the complex tasks is improved. And the task corresponding to the current time interval is called based on the time interval information, and whether the called task needs to be executed is judged by using the task cycle identifier, and the tasks executed before and after are not influenced.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and other drawings can be obtained by those skilled in the art without creative efforts.
FIG. 1 is a diagram illustrating a task scheduling method according to the present embodiment;
FIG. 2 is a diagram illustrating another task scheduling method according to the present embodiment;
FIG. 3 is a schematic diagram showing a task scheduling apparatus of the present embodiment;
fig. 4 shows a schematic view of an electronic device of an embodiment of the invention.
Detailed Description
The technical solutions of the present invention will be described clearly and completely with reference to the accompanying drawings, and it should be understood that the described embodiments are some, but 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.
At present, the task scheduling based on time generally utilizes timer scheduling and parallel task scheduling based on a thread pool, and the inventor finds that the parallel task scheduling based on the timer scheduling and the thread pool has a plurality of problems. Specifically, the scheduling method using the timer scheduling includes the steps of putting tasks received by the timer into a task list, sequencing the task list according to the initial execution time of the tasks, creating a timing thread in the timer, polling all the tasks by the timing thread, finding a task to be executed recently, sleeping, and awakening the timing thread and executing the task when the starting time point of the task to be executed recently is reached. The task scheduling by using the timer is simple and easy to use, but all tasks are performed in series because all tasks are scheduled by the same thread, only one task is performed at the same time, and the delay or the abnormity of the previous task can influence the subsequent tasks.
In addition, parallel task scheduling based on thread pools. For example, due to the scheduling of the schedulers based on the thread pool design, each scheduled task is executed by one thread in the thread pool, so that the tasks are executed concurrently and are not interfered with each other. It should be noted that the scheduledExecutor actually starts a thread only when the execution time of the task comes, and the scheduledExecutor is in the polling state for the rest of the time. Therefore, the task list must be rescanned for each scheduling, and when the number of tasks is large, the task scheduling apparatus needs to perform the scheduling list scanning for a long time. Based on the existing task scheduling method, the complex task scheduling is difficult to realize.
Based on this, an embodiment of the present invention provides a task scheduling method, where a task has a period identifier and is monitored according to a basic period, and specifically, the task scheduling method performs task scheduling based on a system framework for task scheduling, where the system framework may include: a task module: the method comprises the steps of packaging programs to be executed, wherein tasks in a task module all contain task period identification, and specifically, a data structure of the period identification is integer. For example, the period indicator may be a multiple of the base period, for example, the base period may be 24 hours, when the running period of the task exceeds 24 hours, the multiple of 24 is a period indicator, and the task period indicator is decreased by one after the task plan recording module runs for 24 hours each time. For example, if the task is executed every 48 hours or every 36 hours, the period identifier of the task is 2, the task calculation recording module decrements the task period identifier by one every 24 hours, and when the task period identifier is zero, that is, the task calling time is reached, the task is started. A task monitoring module: and the system is responsible for checking task information in the task planning module, wherein the task information can comprise scheduling period information and task cycle identification of a task, and the task is started when the task cycle identification is monitored to be zero. A task plan recording module: the task scheduling time can be divided into a plurality of equally divided time interval information according to the basic cycle, and the task scheduling is started once in each time interval. For example, the divided period information may be a time interval of 1 second, and the mission plan recording module may include 86400 period information (60 seconds × 60 minutes × 24 hours), each corresponding to at least one mission. And the task monitoring module scans the task queue corresponding to the time interval information every second, and starts scanning from the 0 scale again after 86400 scales are scanned, namely, the task queue is scanned again from the next basic cycle. A task queue module: for storing task information.
As shown in fig. 1, the task scheduling method may include the following steps:
and S11, acquiring task information corresponding to the current time period information. In this embodiment, the current period information may be any period information, and the task information may include scheduling period information and a task cycle identifier. Specifically, the task information may be obtained in the following manner, so as to obtain the current time period information; task information is called in the task queue based on the current time interval information and the scheduling time interval information of the tasks; and subtracting one from the period identifier in the task information to generate the called period identifier. For example, if the current time period information is 01:30, the task executed by the time period information marked with 01:30 is searched in the task queue, the cycle identifier of the task is checked, and the cycle identifier is subtracted by one, so that the called cycle identifier is obtained.
And S12, judging whether the period mark is a preset mark or not. In this embodiment, the period identifier may be a number, the number may be an integral multiple of the basic period, and the preset identifier may be "zero", specifically, after the task information is obtained, it may be directly determined whether the period identifier is zero, for example, a task with a task execution period less than 24 hours, and the period identifier is zero each time the task is executed, that is, the period identifier of the task with the execution period less than 24 hours is directly determined to be the preset identifier, and the process directly enters step S13. In addition, each time when the task execution cycle is longer than 24 hours and the corresponding time period is reached, it is determined whether the cycle flag obtained by subtracting one from the cycle flag is zero, and if the cycle flag obtained by subtracting one from the cycle flag is zero, it is determined that the cycle flag is the preset flag, and the process proceeds to step S13. When the cycle flag obtained by subtracting one from the cycle flag is not zero, the process proceeds to step S14.
And S13, executing the task corresponding to the task information.
And S14, putting the task corresponding to the task information back to a task queue. Returning to step S11, the next period information is acquired.
The tasks to be scheduled are divided according to preset time interval information, each task has corresponding scheduling time interval information and a task cycle identifier, and a task scheduling plan at any time can be inquired at any time. The method includes the steps that tasks corresponding to the current time period are called based on time period information, whether the called tasks need to be executed or not is judged through task cycle identification, only task queues at the current moment need to be scanned during scheduling, all task information queues do not need to be scanned, the scanning scale is reduced, when the number of tasks is large, or complex tasks are scheduled, all tasks do not need to be polled, scheduling list scanning does not need to be conducted for a long time, and the processing efficiency of the complex tasks is improved. And the task corresponding to the current time interval is called based on the time interval information, and whether the called task needs to be executed is judged by using the task cycle identifier, and the tasks executed before and after are not influenced.
As an exemplary embodiment, before task scheduling is performed, a task to be executed needs to be added to a task queue of the task to be executed, specifically, a current time scale is obtained, a time interval between an execution time of the task to be scheduled and the current time is calculated based on a cycle identifier and the current time scale, and task information is generated based on the time interval and the cycle identifier. For example, for a task with a task scheduling cycle exceeding 24 hours, the scheduling period information of the task may be calculated by:
A＝(w+(a×60×60+b×60+c))mod d——(1)；
wherein, A is task scheduling time interval information, w is the current time scale, a is the hours of the task execution time, b is the minutes of the task execution time, c is the seconds of the task execution, and d is the basic cycle.
For example, at 1 point 30 per day, the task cycle is labeled 1, assuming that the currently executed time scale is 0, the base cycle is 24 hours, and the execution time of the task is every other base cycle executed at 5400 ═ 0+ (1 × 60+30 × 60+0 × 60)) mod 86400 seconds.
As an optional embodiment, after the task runs, since the task cycle identifier is already cleared, when the task is executed again next time, the task execution time may be inaccurate, especially for the task whose execution cycle exceeds the basic cycle, and therefore in this embodiment, as shown in fig. 2, after step S13, the method may further include:
and S15, resetting the task information and returning to the step S11. Specifically, the period identifier of the currently executed task needs to be reset, and the next period information executed by the current task is recalculated based on the execution time of the current task and the reset period identifier, and is added to the task queue, specifically, the period identifier corresponding to the task can be reset, and the period identifier can be reset according to the period and the basic period executed by the task, for example, the task is executed once every 48 hours, and the period identifier can be reset to 2; acquiring an execution time scale of the task during execution; and resetting the task information of the current task based on the execution time scale and the reset period identifier. The description is given of the reset task information by taking the example of adding a task to a task queue in the above embodiment. The task information of the currently executed task can be reset by a calculation method formula (1) added with the task scheduling time interval information, new time interval information of the current task scheduled next time is obtained after the resetting is completed, and the current task is put into the task queue again after the execution of the current task is completed. Returning to step S11, it waits for the task to be scheduled next time according to the new period information according to step S11.
An embodiment of the present invention provides a task scheduling device, where a task has a period identifier and is monitored according to a basic period, and as shown in fig. 2, the task scheduling device includes: the first obtaining module 11 is configured to obtain task information corresponding to current time interval information, where the task information includes scheduling time interval information of a task and a task cycle identifier; the judging module 12 is configured to judge whether the period identifier is a preset identifier; the execution module 13 is configured to execute a task corresponding to the task information when the period identifier is the preset identifier; the period mark is a multiple of the basic period, the current time period information is one of a plurality of time period information equally divided from the basic period, and each time period information corresponds to at least one task.
Optionally, the task scheduling device further includes: the second acquisition module is used for acquiring the current time scale; the scheduling system comprises a calculation module, a scheduling period information generation module and a scheduling period information generation module, wherein the calculation module is used for calculating the time interval between the execution time of a task to be scheduled and the current time based on the cycle identifier and the current time scale; and the task information generating module is used for generating task information based on the scheduling period information and the cycle identifier.
An embodiment of the present invention provides an electronic device, as shown in fig. 4, the electronic device includes one or more processors 41 and a memory 42, where one processor 41 is taken as an example in fig. 4.
The controller may further include: an input device 43 and an output device 44.
The processor 41, the memory 42, the input device 43 and the output device 44 may be connected by a bus or other means, and fig. 4 illustrates the connection by a bus as an example.
The processor 41 may be a Central Processing Unit (CPU). The processor 41 may also be other general purpose processors, Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or combinations thereof. A general purpose processor may be a microprocessor or any conventional processor or the like.
The memory 42, which is a non-transitory computer readable storage medium, can be used for storing non-transitory software programs, non-transitory computer executable programs, and modules, such as program instructions/modules corresponding to the control methods in the embodiments of the present application. The processor 41 executes various functional applications of the server and data processing, i.e. implements the task scheduling method of the above-described method embodiment, by running non-transitory software programs, instructions and modules stored in the memory 42.
The memory 42 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store data created according to use of a processing device operated by the server, and the like. Further, the memory 42 may include high speed random access memory, and may also include non-transitory memory, such as at least one magnetic disk storage device, flash memory device, or other non-transitory solid state storage device. In some embodiments, memory 42 may optionally include memory located remotely from processor 41, which may be connected to a network connection device via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The input device 43 may receive input numeric or character information and generate key signal inputs related to user settings and function control of the processing device of the server. The output device 44 may include a display device such as a display screen.
One or more modules are stored in the memory 42 and, when executed by the one or more processors 41, perform the method as shown in fig. 1 or 2.
It will be understood by those skilled in the art that all or part of the processes in the method for implementing the above embodiment may be implemented by instructing relevant hardware through a computer program, and the executed program may be stored in a computer-readable storage medium, and when executed, may include the processes in the embodiment of the task scheduling method as described above. The storage medium may be a magnetic disk, an optical disk, a Read-only memory (ROM), a Random Access Memory (RAM), a flash memory (FlashMemory), a hard disk (hard disk drive, abbreviated as HDD) or a Solid State Drive (SSD), etc.; the storage medium may also comprise a combination of memories of the kind described above.
Although the embodiments of the present invention have been described in conjunction with the accompanying drawings, those skilled in the art may make various modifications and variations without departing from the spirit and scope of the invention, and such modifications and variations fall within the scope defined by the appended claims.
Claims (10)
1. A task scheduling method, wherein the task has a period identifier and is monitored according to a basic period, the scheduling method comprising:
acquiring task information corresponding to current time interval information, wherein the task information comprises scheduling time interval information and task cycle identification of a task;
judging whether the period identifier is a preset identifier or not;
when the period identifier is a preset identifier, executing a task corresponding to the task information;
the period mark is a multiple of a basic period, the current time period information is one of a plurality of time period information equally divided from the basic period, and each time period information corresponds to at least one task.
2. The task scheduling method according to claim 1, wherein before the acquiring the task information corresponding to the current period information, the task scheduling method comprises:
acquiring a current time scale;
calculating the time interval between the execution time of the task to be scheduled and the current time based on the period identification and the current time scale;
generating the scheduling period information based on the time interval;
and generating the task information based on the scheduling period information and the cycle identifier.
3. The task scheduling method according to claim 1, wherein the acquiring the task information corresponding to the current period information comprises:
acquiring current time interval information;
calling the task information in a task queue based on the current time period information and the scheduling time period information;
and subtracting one from the period identifier in the task information to be used as a new period identifier.
4. The task scheduling method of claim 3, wherein determining whether the period identifier is a preset identifier comprises:
judging whether the new period mark is zero or not;
and when the number is zero, executing the task corresponding to the task information.
5. The task scheduling method of claim 4,
and when the task information is not zero, the task corresponding to the task information is put back to the task queue.
6. The task scheduling method according to claim 1, wherein after the executing the task corresponding to the task information, the task scheduling method comprises:
resetting a period identifier corresponding to the task;
acquiring an execution time scale of the task during execution;
and resetting the task information of the current task based on the execution time scale and the reset period mark.
7. A task scheduling apparatus, comprising: the task has a period identifier and is monitored according to a basic period, and the scheduling device comprises:
the first acquisition module is used for acquiring task information corresponding to current time interval information, wherein the task information comprises scheduling time interval information and task cycle identification of a task;
the judging module is used for judging whether the period identifier is a preset identifier or not;
the execution module is used for executing the task corresponding to the task information when the period identifier is a preset identifier;
the period mark is a multiple of a basic period, the current time period information is one of a plurality of time period information equally divided from the basic period, and each time period information corresponds to at least one task.
8. The task scheduler of claim 7, further comprising:
the second acquisition module is used for acquiring the current time scale;
the calculation module is used for calculating the time interval between the execution time of the task to be scheduled and the current time based on the period identification and the current time scale;
a scheduling period information generating module for generating the scheduling period information based on the time interval; and the task information generating module is used for generating the task information based on the scheduling period information and the cycle identifier.
9. A computer-readable storage medium storing computer instructions for causing a computer to perform the task scheduling method of any one of claims 1 to 6.
10. An electronic device, comprising: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores a computer program executable by the at least one processor, the computer program being executable by the at least one processor to cause the at least one processor to perform the method of task scheduling according to any of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911359464.0A CN111008072A (en) | 2019-12-25 | 2019-12-25 | Task scheduling method and device, storage medium and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911359464.0A CN111008072A (en) | 2019-12-25 | 2019-12-25 | Task scheduling method and device, storage medium and electronic equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111008072A true CN111008072A (en) | 2020-04-14 |
Family
ID=70118661
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911359464.0A Pending CN111008072A (en) | 2019-12-25 | 2019-12-25 | Task scheduling method and device, storage medium and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111008072A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111857983A (en) * | 2020-04-29 | 2020-10-30 | 国家计算机网络与信息安全管理中心 | Task scheduling method and device based on distributed data acquisition |
| CN112817721A (en) * | 2021-01-29 | 2021-05-18 | 中国平安财产保险股份有限公司 | Task scheduling method and device based on artificial intelligence, computer equipment and medium |
| CN113505071A (en) * | 2021-07-14 | 2021-10-15 | 度普(苏州)新能源科技有限公司 | Method and device for determining task scheduling operation cycle |
| CN115107042A (en) * | 2022-08-31 | 2022-09-27 | 上海擎朗智能科技有限公司 | Robot scheduling identifier resetting method, device, equipment and storage medium |
| CN117421106A (en) * | 2023-12-11 | 2024-01-19 | 湖南行必达网联科技有限公司 | Task scheduling method, system and equipment for embedded software |
| CN118069378A (en) * | 2024-04-22 | 2024-05-24 | 山东云海国创云计算装备产业创新中心有限公司 | Position determining method and device, storage medium and electronic equipment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103744730A (en) * | 2014-01-27 | 2014-04-23 | 北京京东尚科信息技术有限公司 | Task scheduling method and device |
| CN106354557A (en) * | 2016-08-29 | 2017-01-25 | 佛山市美的清湖净水设备有限公司 | Household appliance based on time slice task scheduling system and control method and controller thereof |
| WO2017107843A1 (en) * | 2015-12-21 | 2017-06-29 | 北京奇虎科技有限公司 | Periodic task processing method and apparatus, computer program, and readable medium |
| WO2018103685A1 (en) * | 2016-12-08 | 2018-06-14 | 北京得瑞领新科技有限公司 | Operation instruction scheduling method and apparatus for nand flash memory device |
-
2019
- 2019-12-25 CN CN201911359464.0A patent/CN111008072A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103744730A (en) * | 2014-01-27 | 2014-04-23 | 北京京东尚科信息技术有限公司 | Task scheduling method and device |
| WO2017107843A1 (en) * | 2015-12-21 | 2017-06-29 | 北京奇虎科技有限公司 | Periodic task processing method and apparatus, computer program, and readable medium |
| CN106354557A (en) * | 2016-08-29 | 2017-01-25 | 佛山市美的清湖净水设备有限公司 | Household appliance based on time slice task scheduling system and control method and controller thereof |
| WO2018103685A1 (en) * | 2016-12-08 | 2018-06-14 | 北京得瑞领新科技有限公司 | Operation instruction scheduling method and apparatus for nand flash memory device |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111857983A (en) * | 2020-04-29 | 2020-10-30 | 国家计算机网络与信息安全管理中心 | Task scheduling method and device based on distributed data acquisition |
| CN111857983B (en) * | 2020-04-29 | 2023-02-28 | 国家计算机网络与信息安全管理中心 | Task scheduling method and device based on distributed data acquisition |
| CN112817721A (en) * | 2021-01-29 | 2021-05-18 | 中国平安财产保险股份有限公司 | Task scheduling method and device based on artificial intelligence, computer equipment and medium |
| CN112817721B (en) * | 2021-01-29 | 2022-08-09 | 中国平安财产保险股份有限公司 | Task scheduling method and device based on artificial intelligence, computer equipment and medium |
| CN113505071A (en) * | 2021-07-14 | 2021-10-15 | 度普(苏州)新能源科技有限公司 | Method and device for determining task scheduling operation cycle |
| CN115107042A (en) * | 2022-08-31 | 2022-09-27 | 上海擎朗智能科技有限公司 | Robot scheduling identifier resetting method, device, equipment and storage medium |
| CN117421106A (en) * | 2023-12-11 | 2024-01-19 | 湖南行必达网联科技有限公司 | Task scheduling method, system and equipment for embedded software |
| CN117421106B (en) * | 2023-12-11 | 2024-03-08 | 湖南行必达网联科技有限公司 | Task scheduling method, system and equipment for embedded software |
| CN118069378A (en) * | 2024-04-22 | 2024-05-24 | 山东云海国创云计算装备产业创新中心有限公司 | Position determining method and device, storage medium and electronic equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111008072A (en) | Task scheduling method and device, storage medium and electronic equipment | |
| US9990229B2 (en) | Scheduling method and apparatus for applying laxity correction based on task completion proportion and preset time | |
| CN109298924B (en) | Timing task management method, computer readable storage medium and terminal device | |
| CN103744730B (en) | Task scheduling method and device | |
| CN110262883B (en) | Timer-based task processing method and device and electronic equipment | |
| CN108536530B (en) | Multithreading task scheduling method and device | |
| CN110244991A (en) | A kind of micro services dependency analysis method and device | |
| CN112214291A (en) | Task scheduling method and device | |
| EP2996039B1 (en) | Adaptive scheduling jobs of a virus detection batch according to cpu performance | |
| WO2020198220A1 (en) | Processor and interrupt controller | |
| CN110362554B (en) | Method, device, equipment and computer readable storage medium for setting timer | |
| CN109284193B (en) | Distributed data processing method based on multithreading and server | |
| CN108292236B (en) | Information processing method and device | |
| CN110688206A (en) | Timing task scheduling method and device, computer equipment and storage medium | |
| CN106982268B (en) | Information processing method and server | |
| CN112527543A (en) | Client starting exception handling method and device, electronic equipment and storage medium | |
| CN112650646A (en) | Concurrent task timeout monitoring method and device and electronic equipment | |
| JP2008532150A (en) | Method for real-time analysis of systems | |
| CN107291946B (en) | Big data ETL task scheduling method and device | |
| US20170315842A1 (en) | Resource consuming tasks scheduler | |
| CN116048834A (en) | Method, device and storage medium for updating integrated ranking list in real time | |
| CN115858114A (en) | Scheduling method and device of idle task, electronic equipment and readable storage medium | |
| CN114003498A (en) | Software anomaly detection method and device and electronic equipment | |
| CN111258724B (en) | Data processing method, device, equipment and storage medium of distributed system | |
| CN113485864A (en) | Abnormality detection method, abnormality analysis method, abnormality detection apparatus, abnormality analysis apparatus, electronic device, and 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 | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20200414 |
|
| WD01 | Invention patent application deemed withdrawn after publication |