CN109298925B - Periodic task timing starting method, system and related device - Google Patents
Periodic task timing starting method, system and related device Download PDFInfo
- Publication number
- CN109298925B CN109298925B CN201811131856.7A CN201811131856A CN109298925B CN 109298925 B CN109298925 B CN 109298925B CN 201811131856 A CN201811131856 A CN 201811131856A CN 109298925 B CN109298925 B CN 109298925B
- Authority
- CN
- China
- Prior art keywords
- strategy
- time
- current
- week
- date
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 230000000737 periodic effect Effects 0.000 title claims abstract description 93
- 238000000034 method Methods 0.000 title claims abstract description 42
- 238000004590 computer program Methods 0.000 claims description 9
- 238000000605 extraction Methods 0.000 claims description 3
- 230000008569 process Effects 0.000 abstract description 12
- 230000009286 beneficial effect Effects 0.000 abstract description 2
- 230000009471 action Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000002123 temporal effect Effects 0.000 description 2
- 230000003442 weekly effect Effects 0.000 description 2
- 206010027339 Menstruation irregular Diseases 0.000 description 1
- 239000002775 capsule Substances 0.000 description 1
- 125000004122 cyclic group Chemical group 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000036962 time dependent 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/4812—Task transfer initiation or dispatching by interrupt, e.g. masked
- G06F9/4825—Interrupt from clock, e.g. time of day
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Telephonic Communication Services (AREA)
Abstract
The application provides a periodic task timing starting method, which comprises the following steps: extracting a periodic task strategy and acquiring the current time; matching the date policy with the current date; matching the week policy with the current week; matching the time strategy with the current time; and if at least one group of matched matching results are preset values, starting the periodic task according to the periodic task strategy. The method only needs to generate a date strategy, a week strategy and a time strategy which are relevant to the execution period of the periodic task, and the three strategies are obviously digital coding strategies relevant to time. The periodic task strategy setting process is simple and is not easy to make mistakes, the actual matching process is also simple and convenient, and the timing setting efficiency and the timing starting efficiency of the periodic task are improved. The application also provides a periodic task timing starting system, a computer readable storage medium and a server, which have the beneficial effects.
Description
Technical Field
The present application relates to the field of data processing, and in particular, to a method and a system for starting a periodic task at a fixed time, a computer-readable storage medium, and a server.
Background
In software requirements, performing some work periodically, such as updating a database regularly, is a very common requirement scenario. This kind of scenario is not only performed at intervals of n seconds, n minutes, n, but also with relatively irregular periods such as n days per month, or several days per week, and a brief and convenient timing scheme is proposed herein for this problem.
The current timing schemes are broadly divided into two categories: the first is to use cron expression, which is flexible and can set various timing rules, and the expression needs to be resolved first during execution. For some simple scenes, the software is complex, and a software user does not necessarily have the skill of writing a cron expression, so that the difficulty of using the software is increased. The second is to convert the period into time-minute-second to utilize programming language timing processing, which requires multiple threads to be created and exist for a long time, consuming system resources. Therefore, the problems of complex setting process and high difficulty exist in the existing timing schemes.
Disclosure of Invention
The application aims to provide a periodic task timing starting method, a periodic task timing starting system, a computer readable storage medium and a server, and solves the problem that an existing timing scheme is high in difficulty.
In order to solve the technical problem, the present application provides a periodic task timing starting method, which has the following specific technical scheme:
extracting a periodic task strategy and acquiring the current time; the periodic task strategy comprises a date strategy, a week strategy and a time strategy, and the current time comprises the current date, the current week and the current time;
matching the date policy and the current date, the week policy and the current week, the time policy and the current time, respectively;
and if at least one group of matched matching results are preset values, starting the periodic task according to the periodic task strategy.
And if the matching result of the date strategy and the current date or week strategy and the current week is the preset value and the time strategy is not an empty strategy, starting the periodic task only when the matching result of the time strategy and the current time is also the preset value.
The date strategy, the week strategy and the time strategy are all binary strategies.
The date strategy is a 31-bit binary number, the week strategy is a 7-bit binary number, and the time strategy is a 24-bit binary number;
the step of respectively matching the date policy and the current date, the week policy and the current week, and the time policy and the current time is specifically as follows:
shifting the date strategy by the digit number of the corresponding digit of the current date and taking the rest, shifting the week strategy by the digit number of the corresponding digit of the current week and taking the rest, and shifting the time strategy by the digit number of the corresponding digit of the current time and taking the rest.
If at least one group of matched matching results are preset values, starting the periodic task according to the periodic task strategy specifically comprises the following steps:
and if any group of matched residue taking results is 1, starting the periodic task.
The present application further provides a periodic task timing starting system, including:
the extraction module is used for extracting the periodic task strategy and acquiring the current time; the periodic task strategy comprises a date strategy, a week strategy and a time strategy, and the current time comprises the current date, the current week and the current time;
the matching module is used for respectively matching the date strategy and the current date, the week strategy and the current week, and the time strategy and the current time;
and the starting module is used for starting the periodic task according to the periodic task strategy if at least one group of matched matching results are preset values.
And if the matching result of the date strategy and the current date or week strategy and the current week is the preset value and the time strategy is not an empty strategy, starting the periodic task only when the matching result of the time strategy and the current time is also the preset value.
The date strategy is a 31-bit binary number, the week strategy is a 7-bit binary number, and the time strategy is a 24-bit binary number;
the matching module is specifically a module for shifting the date strategy by the number of digits of the corresponding number of the current date and taking the remainder, shifting the week strategy by the number of digits of the corresponding number of the current week and taking the remainder, and shifting the time strategy by the number of digits of the corresponding number of the current time and taking the remainder.
The present application also provides a computer-readable storage medium having stored thereon a computer program which, when being executed by a processor, carries out the steps of the timed starting method as described above.
The application also provides a server, which comprises a memory and a processor, wherein the memory stores a computer program, and the processor realizes the steps of the timing starting method when calling the computer program in the memory.
The application provides a periodic task timing starting method, which comprises the following steps: extracting a periodic task strategy and acquiring the current time; the periodic task strategy comprises a date strategy, a week strategy and a time strategy, and the current time comprises the current date, the current week and the current time; matching the date policy with the current date; matching the week policy with the current week; matching the time strategy with the current time; and if at least one group of matched matching results are preset values, starting the periodic task according to the periodic task strategy.
According to the method and the device, the periodic task strategy is divided into a date strategy, a week strategy and a time strategy, and after the three strategies are respectively matched with the current actual time, whether the starting time requirement of the task is met is judged. Once any one strategy is successfully matched, the periodic task can be started. The method only needs to generate a date strategy, a week strategy and a time strategy which are relevant to the execution period of the periodic task, and the three strategies are obviously digital coding strategies relevant to time. The periodic task strategy setting process is simple and is not easy to make mistakes, the actual matching process is also simple and convenient, and the timing setting efficiency and the timing starting efficiency of the periodic task are improved. The application also provides a periodic task timing starting system, a computer readable storage medium and a server, which have the beneficial effects and are not described herein again.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, it is obvious that the drawings in the following description are only embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.
Fig. 1 is a flowchart of a method for starting a periodic task at a fixed time according to an embodiment of the present disclosure;
fig. 2 is a schematic structural diagram of a periodic task timing start system according to an embodiment of the present disclosure.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are some embodiments of the present application, but 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 application.
Referring to fig. 1, fig. 1 is a flowchart of a timing starting method for a periodic task according to an embodiment of the present application, where the timing starting method includes:
s101: extracting a periodic task strategy and acquiring the current time;
the current time comprises a current date, a current week and a current moment;
the periodic task policy refers to a periodic policy of a task stored in advance. It should be noted that the cycle is a broad term, meaning that it is important to indicate that the task needs to be executed repeatedly, and does not require strict cycle rules. For example, it is assumed that the self-testing process of the device needs to be performed once every month, but it is possible that the month is self-testing No. 1 and the next month is self-testing No. 2, and although the periodic self-testing is not performed strictly on a fixed date, the periodic self-testing is within the scope of the periodic task policy of the step.
In this step, the periodic task policy mainly refers to time-dependent data, i.e. when a task needs to be executed repeatedly. The periodic task strategy comprises a date strategy, a week strategy and a time of day strategy. The date policy refers to which number of each natural month, i.e., days per month. Weekly strategy refers to the day of the week and temporal strategy refers to the time of day. Correspondingly, the current time should also include the number of days, days of the week, and now the time of day. Note that, in general, there is no cyclic task that needs to be repeatedly executed in units of years, and therefore, no age policy is set. Of course, an age policy may be added if desired for a particular application, such as "time capsule".
The format of three of the periodic task policies is not limited herein, and for example, a numerical expression may be used. Preferably, the date policy, the week policy and the time of day policy may be binary policies. Specifically, each strategy should be adjusted accordingly according to its usage specification. For example, the date policy is a 31-bit binary number (any one month is guaranteed to apply), the week policy is a 7-bit binary number, and the time policy is a 24-bit binary number. Specifically, 1 is filled in a specific bit number according to any specific time that the execution needs to be performed in a cycle (of course, "0" may be selected to represent the execution, and is not limited herein). The order of the binary numbers is not limited, and the number of days may be represented in order from the right to the left, or may be selected from the left to the right. Taking the example from right to left, the nth day 31|30| … |1 is shown from right to left, and when No. 3 and No. 11 per month need to execute the task, the corresponding binary bit policy is 0000000000000000000010000000100. Similarly, the order of the week strategy is not limited. When the task is represented by saturday | friday | … | sunday in order from right to left, the task is executed 0001001 every sunday and three. It can be seen that the order of the periods may also be varied, and the above example takes the weekday as the first day of the week, and may also take the monday as the first day of the week, which is not limited herein. Similarly, for the time policy, if the time policy is represented as the n-th hour 23|22| … |0 from right to left, for example, 0 time per day, the time policy corresponding to 4 hours is 00000000000000000001001.
The date policy, the week policy, and the time policy in the periodic task policy in the present application are described above by taking the binary policy as an example. It is understood that those skilled in the art can also use other binary or expression forms (e.g., A, B instead of 0 and 1) to describe the periodic task strategy, and all such forms are within the scope of the present application.
S102: matching the date policy with the current date; matching the week policy with the current week; matching the time strategy with the current time;
this step aims at matching the periodic task strategy with the current time. The actual purpose of matching is to determine whether the current time has reached the execution time of the task. Specifically, the date policy should match the current date, the week policy should match the current week, and the time policy should match the current time.
How to match is not limited, and the specific matching mode is determined according to the specific form of each strategy. The following example of binary strategy in edge S101 illustrates a matching procedure:
shifting the date strategy by the digit number of the corresponding digit of the current date and taking the rest, shifting the week strategy by the digit number of the corresponding digit of the current week and taking the rest, and shifting the time strategy by the digit number of the corresponding digit of the current time and taking the rest.
The following description is about the date policy, and it has been described above that, when No. 3 and No. 11 need to execute the task every month, the corresponding binary bit policy is 0000000000000000000010000000100, and when matching, if the current date is No. 11 and the corresponding number is 11, the binary policy is shifted to the right by 11 bits (because the binary policy specifies that the sequence is from right to left, and when the sequence of the binary numbers changes, the shifting direction changes correspondingly), so as to obtain 00000000000000000001 (shifting corresponds to removing), and then 2 is left (because of the binary policy, 2 is left, and if it is other system or representation, it can be adjusted correspondingly), and the remainder is 1.
S103: and if at least one group of matched matching results are preset values, starting the periodic task according to the periodic task strategy.
It should be noted that, before this step, or when the periodic task policy is set, a preset value for task execution needs to be determined. Following the example above, taking the remainder to be 1, it means that this task needs to be executed on day 11. In other words, if the remainder result of any one set of matching is 1, the periodic task is started. This is because when the binary policy is set, a "1" is used to represent that the task needs to be executed. According to the above method, if the number is 10, it is obvious that the remainder result is 0, and no task needs to be executed.
It should be noted that the three matching processes are independent from each other, that is, after any one matching result is a preset value, a periodic task can be started. When more than two matching results are preset values at the same time, the periodic task needs to be started according to the periodic task strategy, the periodic task cannot be started according to one matching result at the moment, and a date strategy, a week strategy and a time strategy need to be comprehensively considered. The time of day may be set to be higher priority than the date and week. In other words, the matching result of the current date and the current date is already matched and the result is a preset value, but the time is not yet matched due to the higher priority of the time, and then the matching of the time policy and the current time is also needed. See in particular the following example.
In the embodiment, the periodic task strategy is divided into a date strategy, a week strategy and a time strategy, and after the three strategies are respectively matched with the current actual time, whether the starting time requirement of the task is met is judged. Once any one strategy is successfully matched, the periodic task can be started. The method only needs to generate a date strategy, a week strategy and a time strategy which are relevant to the execution period of the periodic task, and the three strategies are obviously digital coding strategies relevant to time. The periodic task strategy setting process is simple and is not easy to make mistakes, the actual matching process is also simple and convenient, and the timing setting efficiency and the timing starting efficiency of the periodic task are improved.
Based on the above embodiment, as a preferred embodiment, if the matching result between the date policy and the current date or between the week policy and the current week is the preset value, and the time policy is not an empty policy, the periodic task is started only when the matching result between the time policy and the current time is also the preset value.
The embodiment aims to explain that when the date strategy and the time strategy exist simultaneously or the week strategy and the time strategy exist simultaneously, the periodic task can be started only when the matching results of the two strategies are both preset values.
For example, when a date policy and a time policy exist at the same time, for example, 12 o' clock 3 per month, tasks need to be executed, but the matching result of the date policy cannot be a preset value, and the tasks are executed, so that the actual result is that the tasks are repeatedly executed all day on the day 3, which obviously does not meet the original purpose of the periodic task policy setting. The same holds true for the existence of both weekly and temporal strategies.
Therefore, even if the matching result of either the date policy or the week policy is a preset value, as long as the time policy is not the null policy at this time, the task cannot be executed with the matching result of the date policy or the week policy alone.
The following describes a periodic task timing starting system provided in an embodiment of the present application, and the following described timing starting system and the above described periodic task timing starting method may be referred to correspondingly.
Referring to fig. 2, fig. 2 is a schematic structural diagram of a timing start system of a periodic task according to an embodiment of the present application, where the timing start system includes:
an extraction module 100, configured to extract a periodic task policy and obtain a current time; the periodic task strategy comprises a date strategy, a week strategy and a time strategy, and the current time comprises the current date, the current week and the current time;
a matching module 200 for matching the date policy with the current date; matching the week policy with the current week; matching the time strategy with the current time;
a starting module 300, configured to start the periodic task according to the periodic task policy if at least one group of matching results is a preset value.
Based on the above embodiment, as a preferred embodiment, if the matching result between the date policy and the current date or between the week policy and the current week is the preset value, and the time policy is not an empty policy, the periodic task is started only when the matching result between the time policy and the current time is also the preset value.
Based on the above embodiment, as a preferred embodiment, the date policy is a 31-bit binary number, the week policy is a 7-bit binary number, and the time policy is a 24-bit binary number;
the matching module 200 is specifically a module configured to shift the date policy by the number of digits of the corresponding number of the current date and take the remainder, shift the week policy by the number of digits of the corresponding number of the current week and take the remainder, and shift the time policy by the number of digits of the corresponding number of the current time and take the remainder.
The present application also provides a computer readable storage medium having stored thereon a computer program which, when executed, may implement the steps provided by the above-described embodiments. The storage medium may include: 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 application also provides a server, which may include a memory and a processor, where the memory stores a computer program, and the processor may implement the steps provided by the foregoing embodiments when calling the computer program in the memory. Of course, the server may also include various network interfaces, power supplies, and the like.
The embodiments are described in a progressive manner in the specification, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other. For the system provided by the embodiment, the description is relatively simple because the system corresponds to the method provided by the embodiment, and the relevant points can be referred to the method part for description.
The principles and embodiments of the present application are explained herein using specific examples, which are provided only to help understand the method and the core idea of the present application. It should be noted that, for those skilled in the art, it is possible to make several improvements and modifications to the present application without departing from the principle of the present application, and such improvements and modifications also fall within the scope of the claims of the present application.
It is further noted that, in the present specification, relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
Claims (7)
1. A method for starting a periodic task at a fixed time is characterized by comprising the following steps:
extracting a periodic task strategy and acquiring the current time; the periodic task strategy comprises a date strategy, a week strategy and a time strategy, and the current time comprises the current date, the current week and the current time;
matching the date policy with the current date;
matching the week policy with the current week;
matching the time strategy with the current time;
if at least one group of matched matching results are preset values, starting the periodic task according to the periodic task strategy;
wherein the date strategy, the week strategy and the time strategy are all binary strategies; the date strategy is a 31-bit binary number, the week strategy is a 7-bit binary number, and the time strategy is a 24-bit binary number;
the step of respectively matching the date policy and the current date, the week policy and the current week, and the time policy and the current time is specifically as follows:
shifting the date strategy by the digit number of the corresponding digit of the current date and taking the rest, shifting the week strategy by the digit number of the corresponding digit of the current week and taking the rest, and shifting the time strategy by the digit number of the corresponding digit of the current time and taking the rest.
2. The timed starting method according to claim 1, wherein if the matching result between the date policy and the current date or between the week policy and the current week is the preset value and the time policy is not an empty policy, the periodic task is started only when the matching result between the time policy and the current time is also the preset value.
3. The timed starting method according to claim 1, wherein if at least one group of matching results is a preset value, starting the periodic task according to the periodic task policy specifically comprises:
and if any group of matched residue taking results is 1, starting the periodic task.
4. A system for timed starting of periodic tasks, comprising:
the extraction module is used for extracting the periodic task strategy and acquiring the current time; the periodic task strategy comprises a date strategy, a week strategy and a time strategy, and the current time comprises the current date, the current week and the current time;
a matching module for matching the date policy with the current date; matching the week policy with the current week; matching the time strategy with the current time;
the starting module is used for starting the periodic task according to the periodic task strategy if at least one group of matched matching results are preset values;
the date strategy is a 31-bit binary number, the week strategy is a 7-bit binary number, and the time strategy is a 24-bit binary number;
the matching module is specifically a module for shifting the date strategy by the number of digits of the corresponding number of the current date and taking the remainder, shifting the week strategy by the number of digits of the corresponding number of the current week and taking the remainder, and shifting the time strategy by the number of digits of the corresponding number of the current time and taking the remainder.
5. The timed starting system according to claim 4, wherein if the matching result between the date policy and the current date or between the week policy and the current week is the preset value and the time policy is not an empty policy, the periodic task is started only when the matching result between the time policy and the current time is also the preset value.
6. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the timed starting method according to any one of claims 1 to 3.
7. A server, characterized by comprising a memory in which a computer program is stored and a processor which, when calling the computer program in the memory, implements the steps of the timed starting method according to any one of claims 1 to 3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811131856.7A CN109298925B (en) | 2018-09-27 | 2018-09-27 | Periodic task timing starting method, system and related device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811131856.7A CN109298925B (en) | 2018-09-27 | 2018-09-27 | Periodic task timing starting method, system and related device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109298925A CN109298925A (en) | 2019-02-01 |
| CN109298925B true CN109298925B (en) | 2021-10-15 |
Family
ID=65164611
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811131856.7A Active CN109298925B (en) | 2018-09-27 | 2018-09-27 | Periodic task timing starting method, system and related device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109298925B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110780725B (en) * | 2019-10-25 | 2021-04-27 | 宁波三星医疗电气股份有限公司 | Method for determining timing reset time and related device |
| CN112925631B (en) * | 2021-04-08 | 2022-11-04 | 上海科世达-华阳汽车电器有限公司 | Task scheduling method and device, electronic equipment and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101901164A (en) * | 2009-05-27 | 2010-12-01 | 北京金山软件有限公司 | Time plan scheduler module and method |
| CN103326828A (en) * | 2012-03-19 | 2013-09-25 | 上海贝尔股份有限公司 | Time format conversion and information transmission based on IEEE1588 protocol in communication network |
| CN104699533A (en) * | 2013-12-09 | 2015-06-10 | 中国航空工业集团公司第六三一研究所 | Scheduling method of multiple periodic tasks |
| CN106201692A (en) * | 2016-07-11 | 2016-12-07 | 浪潮(北京)电子信息产业有限公司 | A kind of timing task processing system and method |
| CN107038552A (en) * | 2016-12-20 | 2017-08-11 | 阿里巴巴集团控股有限公司 | Method for processing business, device and equipment, computer-readable recording medium |
| CN108512993A (en) * | 2018-02-28 | 2018-09-07 | 维沃移动通信有限公司 | A kind of scheduling prompt method and mobile terminal |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TW588284B (en) * | 2002-11-12 | 2004-05-21 | Mitac Technology Corp | Computer real-time power-on system and method |
| US7237183B2 (en) * | 2003-03-04 | 2007-06-26 | Broadcom Corporation | Parallel decoding of a BCH encoded signal |
-
2018
- 2018-09-27 CN CN201811131856.7A patent/CN109298925B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101901164A (en) * | 2009-05-27 | 2010-12-01 | 北京金山软件有限公司 | Time plan scheduler module and method |
| CN103326828A (en) * | 2012-03-19 | 2013-09-25 | 上海贝尔股份有限公司 | Time format conversion and information transmission based on IEEE1588 protocol in communication network |
| CN104699533A (en) * | 2013-12-09 | 2015-06-10 | 中国航空工业集团公司第六三一研究所 | Scheduling method of multiple periodic tasks |
| CN106201692A (en) * | 2016-07-11 | 2016-12-07 | 浪潮(北京)电子信息产业有限公司 | A kind of timing task processing system and method |
| CN107038552A (en) * | 2016-12-20 | 2017-08-11 | 阿里巴巴集团控股有限公司 | Method for processing business, device and equipment, computer-readable recording medium |
| CN108512993A (en) * | 2018-02-28 | 2018-09-07 | 维沃移动通信有限公司 | A kind of scheduling prompt method and mobile terminal |
Non-Patent Citations (3)
| Title |
|---|
| Improving routing and scheduling decisions at a distributor of industrial gasses;Jamison M. Day .etal;《Omega》;20090228;第37卷(第1期);227-237页 * |
| MXT5611_高精度可配置定时电路_下;刘风华;《电子产品世界》;20090831;第16卷(第8期);74-75页 * |
| Temporenc, comprehensive binary encoding format for dates and times;temporenc;《https://github.com/temporenc》;20170207;1-13页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109298925A (en) | 2019-02-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109298925B (en) | Periodic task timing starting method, system and related device | |
| CN103870327A (en) | Real-time multitask scheduling method and device | |
| CN107608772B (en) | Method and system for batch processing task configuration scheduling | |
| CN110134689B (en) | Target group screening method and system based on main body object label change and computer equipment | |
| CN106844043A (en) | The treating method and apparatus of cluster task | |
| CN110634052A (en) | Method and device for generating order number by distributed architecture | |
| CN113742044A (en) | Timed task management method, device, equipment and storage medium | |
| EP0910025A2 (en) | Relative logarithmic time stamps for reduced memory map size | |
| CN110968371A (en) | Method and system for configuring workflow in data warehouse | |
| CN106155594B (en) | A kind of data processing method and device | |
| US10409651B2 (en) | Incremental workflow execution | |
| CN111580972A (en) | Virtual resource processing method and device | |
| CN115495527A (en) | Data synchronization management system and method | |
| US20180341521A1 (en) | Managing job schedules | |
| CN111309463B (en) | Method and device for determining task execution time and readable storage medium | |
| CN115185659A (en) | Task instance running method and device and computer readable storage medium | |
| CN109213821B (en) | Data processing method and system | |
| CN114493701A (en) | User grouping method and device | |
| CN110069481B (en) | Unified cleaning method and related equipment for production library data based on big data | |
| CN107832089B (en) | Method for automatically updating software version number | |
| CN113419836A (en) | Task processing method and device, electronic equipment and computer readable storage medium | |
| US10558683B2 (en) | Selection of a start time for a periodic operation | |
| CN106708540B (en) | Universal time selection method | |
| CN113504979B (en) | Timer realizing method and device, real-time operating system and storage medium | |
| CN115391377A (en) | Method for recognizing timing calendar grammar and terminal equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |