CN110633303A - Method and device for determining task conflict and server - Google Patents
Method and device for determining task conflict and server Download PDFInfo
- Publication number
- CN110633303A CN110633303A CN201910932226.8A CN201910932226A CN110633303A CN 110633303 A CN110633303 A CN 110633303A CN 201910932226 A CN201910932226 A CN 201910932226A CN 110633303 A CN110633303 A CN 110633303A
- Authority
- CN
- China
- Prior art keywords
- intersection
- character strings
- conflict
- domains
- tasks
- 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 55
- 230000014509 gene expression Effects 0.000 claims description 9
- 230000010365 information processing Effects 0.000 abstract description 2
- 238000004590 computer program Methods 0.000 description 8
- 238000010586 diagram Methods 0.000 description 8
- 238000004891 communication Methods 0.000 description 7
- 230000006870 function Effects 0.000 description 5
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000012795 verification Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000012546 transfer Methods 0.000 description 2
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000000126 substance Substances 0.000 description 1
- 230000001052 transient effect Effects 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2237—Vectors, bitmaps or matrices
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
- G06F16/24553—Query execution of query operations
- G06F16/24558—Binary matching operations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/903—Querying
- G06F16/90335—Query processing
- G06F16/90344—Query processing by using string matching techniques
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computational Linguistics (AREA)
- Software Systems (AREA)
- Debugging And Monitoring (AREA)
Abstract
The application relates to a method, a device and a server for determining task conflict, belonging to the technical field of information processing; the task conflict determination method comprises the following steps: and determining whether the tasks executing the more than two character strings conflict or not according to the intersection of the corresponding domains of the more than two character strings. Whether the tasks of the executed character strings conflict or not is judged according to the intersection condition of the domains corresponding to the character strings, whether the tasks are overlapped or not is determined without comparing all the corresponding domains, the comparison times are reduced, the speed is improved, and the efficiency is higher.
Description
Technical Field
The present application relates to the field of information processing technologies, and for example, to a method, an apparatus, and a server for determining a task conflict.
Background
Under the conditions of small task amount and single operation, manually recording and judging whether the tasks conflict or not, and avoiding the task conflict by adopting a manual operation mode. With the continuous development and growth of services, more and more tasks are required, and hundreds of tasks run simultaneously. The operation of these tasks may coincide at a future time point, resulting in an intersection, which may cause different task plans to be triggered at the same time point, resulting in a task conflict.
In the process of implementing the embodiments of the present disclosure, it is found that at least the following problems exist in the related art: through manual operation, recording and judging whether the tasks conflict or not, the workload is huge, and the efficiency is low; the huge number of task character strings run simultaneously, external calling cannot be realized through an interface mode, and thousands of tasks cannot be subjected to unified verification.
Disclosure of Invention
The following presents a simplified summary in order to provide a basic understanding of some aspects of the disclosed embodiments. This summary is not an extensive overview nor is intended to identify key/critical elements or to delineate the scope of such embodiments but rather as a prelude to the more detailed description that is presented later.
The embodiment of the disclosure provides a method, a device and a server for determining task conflict, so as to solve the technical problems that the efficiency is low and the task cannot be uniformly checked in the process of judging whether the task conflicts.
In some embodiments, the method comprises:
and determining whether the tasks executing the more than two character strings conflict or not according to the intersection of the corresponding domains of the more than two character strings.
The embodiment of the disclosure provides a task conflict determination device.
In some embodiments, the apparatus comprises:
a determination module configured to: and determining whether the tasks executing the more than two character strings conflict or not according to the intersection of the corresponding domains of the more than two character strings.
The embodiment of the disclosure provides a server.
In some embodiments, the server comprises: the task conflict determination device.
The embodiment of the disclosure provides an electronic device.
In some embodiments, the electronic device comprises:
at least one processor; and
a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,
the memory stores instructions executable by the at least one processor, which when executed by the at least one processor, cause the at least one processor to perform the method of task conflict determination described above.
The disclosed embodiments provide a computer-readable storage medium.
In some embodiments, the computer-readable storage medium stores computer-executable instructions configured to perform the method of task conflict determination described above.
The disclosed embodiments provide a computer program product.
In some embodiments, the computer program product comprises a computer program stored on a computer readable storage medium, the computer program comprising program instructions which, when executed by a computer, cause the computer to perform the method of task conflict determination described above.
Some technical solutions provided by the embodiments of the present disclosure can achieve the following technical effects:
and obtaining the intersection of the corresponding domains by adopting a mode of solving the intersection of the corresponding domains of more than two character strings, and determining whether the tasks executing the character strings conflict or not according to the intersection result of the corresponding domains. The task character strings with huge number are simultaneously operated and compared, whether the tasks are overlapped or not can be determined according to the intersection condition in time, and whether the tasks are overlapped or not is determined without comparing all corresponding domains, so that the comparison times are reduced, the speed is improved, and the efficiency is higher.
The foregoing general description and the following description are exemplary and explanatory only and are not restrictive of the application.
Drawings
One or more embodiments are illustrated by way of example in the accompanying drawings, which correspond to the accompanying drawings and not in limitation thereof, in which elements having the same reference numeral designations are shown as like elements and not in limitation thereof, and wherein:
FIG. 1 is a schematic diagram of a method for task conflict determination according to an embodiment of the present disclosure;
FIG. 2 is a flowchart illustrating a method for task conflict determination according to an embodiment of the present disclosure;
FIG. 3 is a flowchart illustrating another method for task conflict determination provided by an embodiment of the present disclosure;
fig. 4 is a domain comparison diagram corresponding to a character string of a method for determining task conflicts according to an embodiment of the present disclosure;
fig. 5 is a schematic structural diagram of an electronic device provided in an embodiment of the present disclosure.
Reference numerals:
100. a processor; 101. a memory; 102. a communication interface; 103. a bus.
Detailed Description
So that the manner in which the features and elements of the disclosed embodiments can be understood in detail, a more particular description of the disclosed embodiments, briefly summarized above, may be had by reference to the embodiments, some of which are illustrated in the appended drawings. In the following description of the technology, for purposes of explanation, numerous details are set forth in order to provide a thorough understanding of the disclosed embodiments. However, one or more embodiments may be practiced without these details. In other instances, well-known structures and devices may be shown in simplified form in order to simplify the drawing.
The embodiment of the present disclosure provides a method for determining a task conflict, as shown in fig. 1, including: and determining whether the tasks executing the more than two character strings conflict or not according to the intersection of the corresponding domains of the more than two character strings.
In some embodiments, before determining whether tasks executing two or more character strings conflict according to an intersection of corresponding domains of the two or more character strings, the method further includes: receiving an instruction for performing conflict check on the task; instructions are executed using either the sdk interface or the rest interface.
In some embodiments, the character string is a Cron expression, and the field corresponding to the character string is a time field.
In some embodiments, the time domain includes: second, minute, hour, day, month, week, year.
In some embodiments, as shown in fig. 2, determining whether the tasks of executing the two or more strings conflict further comprises: judging whether the corresponding domains of more than two character strings have intersection or not: under the condition that all corresponding domains of more than two character strings have intersection, the tasks conflict; and under the condition that at least one corresponding domain of more than two character strings does not have intersection, the tasks do not conflict.
In some embodiments, determining whether the corresponding domains of the two or more character strings have an intersection includes: sequentially judging whether the corresponding domains of the character strings have intersections: and under the condition of intersection, continuously judging whether the next corresponding domain has intersection or not until all the domains are judged to be finished or the domain without intersection appears.
In some embodiments, a method of task conflict determination includes the steps of:
step S101, splitting each part of the Cron expression, wherein the total number of the parts is seven, namely seven domains, which are respectively as follows: second, minute, hour, day, month, week, year;
s102, limiting the value range of each bit:
second, value range: 0-59,
and (2) minute, value range: 0-59,
and h, value range: 0-23,
day, value range: 0-31,
month, the value range: 0-11,
week, value range: 1-71 ═ SUN or SUN, MON, TUE, WED, THU, FRI, SAT, year, span: 1970-2099;
s103, adopting a contraposition comparison mode, and comparing the minimum bit: and (5) judging by using a method of solving intersection and union at the beginning of second: whether each bit of the two Cron trajectories has the same number. If the same number is judged, namely the intersection exists, the bit is indicated to have a coincident point, and the next bit is calculated by the loop.
Cron 01/3 ×?, run every three minutes, starting at the 1 st minute.
Cron 01/5 ×?, run every five minutes starting at the 1 st minute.
Comparing the corresponding domains of the character strings, as shown in fig. 4, wherein the character strings of the two Cron expressions have the same number at each digit, and are intersection points, namely intersection, so that the running tracks of the two Cron expressions are definitely overlapped to generate task conflict; if one bit does not coincide (i.e. there is no intersection), it means that the trajectories never coincide.
In some embodiments, before determining whether the tasks executing the two or more character strings conflict according to the intersection of the corresponding domains of the two or more character strings, the method further includes: receiving an instruction for performing conflict check on the task; receiving instructions to conflict check tasks is performed using a Software Development Kit (sdk) interface or a representational state Transfer (rest) interface.
The method comprises the steps of dividing the character strings of the tasks, obtaining the intersection of the corresponding domains by comparing the corresponding domains and solving the intersection, and obtaining the coincidence condition of the corresponding domains according to the intersection result so as to determine whether the tasks executing the character strings coincide or conflict. The method has the advantages that a mode of solving intersection of corresponding domains is adopted, tasks can be determined to be not overlapped as long as one corresponding domain has no intersection, the tasks are not conflicted, whether the tasks are overlapped or not can be determined after all corresponding domains are compared, the comparison times are reduced, the speed is improved, and the efficiency is higher.
The embodiment of the disclosure provides another method for determining task conflict, which includes: and determining whether the tasks executing the more than two character strings conflict or not according to the intersection of the corresponding domains of the more than two character strings.
In some embodiments, before determining whether the tasks executing the two or more character strings conflict according to the intersection of the corresponding domains of the two or more character strings, the method further includes: receiving an instruction for performing conflict check on the task; the instructions are executed using either the sdk interface or the rest interface.
In some embodiments, the character string is a Cron expression, and the field corresponding to the character string is a time field.
In some embodiments, the time domain includes: second, minute, hour, day, month, week, year.
In some embodiments, as shown in FIG. 3, determining whether tasks executing more than two strings conflict includes: judging whether the corresponding domains of more than two character strings have intersection or not: under the condition that at least one corresponding domain of more than two character strings has intersection, the tasks conflict; and under the condition that all corresponding domains of more than two character strings have no intersection, the tasks do not conflict.
In some embodiments, determining whether the corresponding domains of the two or more character strings have an intersection further includes: sequentially judging whether the corresponding domains of the character strings have intersections: and under the condition of no intersection, continuously judging whether the next corresponding domain has the intersection or not until all the domains are judged to be finished or the intersected domain appears.
The method comprises the steps of dividing the character strings of the tasks into domains, comparing the corresponding domains and solving the intersection to obtain the intersection of the corresponding domains, and obtaining the coincidence condition of the corresponding domains according to the intersection result so as to determine whether the tasks executing the character strings coincide or conflict. The method has the advantages that a mode of solving intersection by one pair of corresponding domains is adopted, once the intersection of the corresponding domains appears, the task can be determined to be overlapped, the task conflicts, whether the task is overlapped or not is determined without comparing all the corresponding domains after the completion, the comparison times are reduced, the speed is improved, and the efficiency is higher.
The embodiment of the present disclosure provides a device for determining a task conflict, including: a determination module configured to: and determining whether the tasks executing the more than two character strings conflict or not according to the intersection of the corresponding domains of the more than two character strings.
In some embodiments, the means for task conflict determination further comprises: an sdk interface or rest interface configured to: and executing and receiving an instruction for performing conflict check on the task before determining whether the task executing more than two character strings conflicts according to the intersection of the corresponding domains of more than two character strings.
In some embodiments, the string is a cron expression and the field to which the string corresponds is a time field.
In some embodiments, the time domain includes: second, minute, hour, day, month, week, year.
In some embodiments, the determination module is further configured to: judging whether the corresponding domains of more than two character strings have intersection or not, and under the condition that all the corresponding domains of more than two character strings have intersection, the tasks conflict; and under the condition that at least one corresponding domain of more than two character strings does not have intersection, the tasks do not conflict.
In some embodiments, the determination module is further configured to: sequentially judging whether the corresponding domains of the character strings have intersections: and under the condition of intersection, continuously judging whether the next corresponding domain has intersection or not until all the domains are judged to be finished or the domain without intersection appears.
The judgment module divides the task character string into domains, compares the corresponding domains and finds the intersection to obtain the intersection of the corresponding domains, and the judgment module obtains the coincidence condition of the corresponding domains according to the intersection result so as to determine whether the tasks of the executed character string coincide or conflict. The method has the advantages that a large number of character strings are simultaneously operated and compared, the judgment module adopts a mode of solving intersection of corresponding domains, once a corresponding domain is judged to have no intersection, the tasks can be determined to be not overlapped, the tasks are not conflicted, whether the tasks are overlapped or not is determined without comparing all the corresponding domains, the comparison times are reduced, the speed is improved, and the efficiency is higher; the application is expanded by using an sdk interface or a rest interface, hundreds of task plans are subjected to unified verification, and the use is convenient.
Another apparatus for determining a task conflict is provided in an embodiment of the present disclosure, including: a determination module configured to: and determining whether the tasks executing the more than two character strings conflict or not according to the intersection of the corresponding domains of the more than two character strings.
In some embodiments, further comprising: an sdk interface or rest interface configured to: and executing and receiving an instruction for performing conflict check on the task before determining whether the task executing more than two character strings conflicts according to the intersection of the corresponding domains of more than two character strings.
In some embodiments, the string is a cron expression and the field to which the string corresponds is a time field.
In some embodiments, the time domain includes: second, minute, hour, day, month, week, year.
In some embodiments, the determination module is further configured to: judging whether the corresponding domains of more than two character strings have intersection or not: under the condition that at least one corresponding domain of more than two character strings has intersection, the tasks conflict; and under the condition that all corresponding domains of more than two character strings have no intersection, the tasks do not conflict.
In some embodiments, the determination module is further configured to: sequentially judging whether the corresponding domains of the character strings have intersections: and under the condition of no intersection, continuously judging whether the next corresponding domain has the intersection or not until all the domains are judged to be finished or the intersected domain appears.
The judgment module divides the task character string into domains, compares the corresponding domains and finds the intersection to obtain the intersection of the corresponding domains, and the judgment module obtains the coincidence condition of the corresponding domains according to the intersection result so as to determine whether the tasks of the executed character string coincide or conflict. The method comprises the steps that a large number of character strings are operated and compared at the same time, the judgment module adopts a mode of solving intersection of corresponding domains one by one, once the corresponding domains are judged to have the intersection, the task coincidence can be determined, the task conflicts, whether the tasks coincide or not is determined without comparing all the corresponding domains, the comparison times are reduced, the speed is improved, and the efficiency is higher; the application is expanded by using an sdk interface or a rest interface, hundreds of task plans are subjected to unified verification, and the use is convenient.
The embodiment of the disclosure provides a server, which includes the above task conflict determination device.
Embodiments of the present disclosure provide a computer-readable storage medium storing computer-executable instructions configured to perform the above-mentioned task conflict determination method.
An embodiment of the present disclosure provides a computer program product comprising a computer program stored on a computer-readable storage medium, the computer program comprising program instructions which, when executed by a computer, cause the computer to perform the above task conflict determination method.
The computer-readable storage medium described above may be a transitory computer-readable storage medium or a non-transitory computer-readable storage medium.
An embodiment of the present disclosure provides an electronic device, a structure of which is shown in fig. 5, and the electronic device includes:
at least one processor (processor)100, one processor 100 being exemplified in fig. 5; and a memory (memory)101, and may further include a Communication Interface (Communication Interface)102 and a bus 103. The processor 100, the communication interface 102, and the memory 101 may communicate with each other via a bus 103. The communication interface 102 may be used for information transfer. The processor 100 may call logic instructions in the memory 101 to perform the task conflict determination method of the above embodiment.
In addition, the logic instructions in the memory 101 may be implemented in the form of software functional units and stored in a computer readable storage medium when the logic instructions are sold or used as independent products.
The memory 101, which is a computer-readable storage medium, may be used for storing software programs, computer-executable programs, such as program instructions/modules corresponding to the methods in the embodiments of the present disclosure. The processor 100 executes the functional application and data processing by executing the software program, instructions and modules stored in the memory 101, that is, implements the task conflict determination method in the above-described method embodiment.
The memory 101 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 the use of the terminal device, and the like. In addition, the memory 101 may include a high-speed random access memory, and may also include a nonvolatile memory.
The technical solution of the embodiments of the present disclosure may be embodied in the form of a software product, where the computer software product is stored in a storage medium and includes one or more instructions to enable a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method of the embodiments of the present disclosure. And the aforementioned storage medium may be a non-transitory storage medium comprising: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes, and may also be a transient storage medium.
The above description and drawings sufficiently illustrate embodiments of the disclosure to enable those skilled in the art to practice them. Other embodiments may incorporate structural, logical, electrical, process, and other changes. The examples merely typify possible variations. Individual components and functions are optional unless explicitly required, and the sequence of operations may vary. Portions and features of some embodiments may be included in or substituted for those of others. The scope of the disclosed embodiments includes the full ambit of the claims, as well as all available equivalents of the claims. As used in this application, although the terms "first," "second," etc. may be used in this application to describe various elements, these elements should not be limited by these terms. These terms are only used to distinguish one element from another. For example, a first element could be termed a second element, and, similarly, a second element could be termed a first element, unless the meaning of the description changes, so long as all occurrences of the "first element" are renamed consistently and all occurrences of the "second element" are renamed consistently. The first and second elements are both elements, but may not be the same element. Furthermore, the words used in the specification are words of description only and are not intended to limit the claims. As used in the description of the embodiments and the claims, the singular forms "a", "an" and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. Similarly, the term "and/or" as used in this application is meant to encompass any and all possible combinations of one or more of the associated listed. Furthermore, the terms "comprises" and/or "comprising," when used in this application, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method or apparatus that comprises the element. In this document, each embodiment may be described with emphasis on differences from other embodiments, and the same and similar parts between the respective embodiments may be referred to each other. For methods, products, etc. of the embodiment disclosures, reference may be made to the description of the method section for relevance if it corresponds to the method section of the embodiment disclosure.
Those of skill in the art would appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software may depend upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the disclosed embodiments. It can be clearly understood by the skilled person that, for convenience and brevity of description, the specific working processes of the system, the apparatus and the unit described above may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the embodiments disclosed herein, the disclosed methods, products (including but not limited to devices, apparatuses, etc.) may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units may be merely a logical division, and in actual implementation, there may be another division, for example, multiple 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. The 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 implement the present embodiment. In addition, functional units in the embodiments of the present disclosure 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 flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. In the description corresponding to the flowcharts and block diagrams in the figures, operations or steps corresponding to different blocks may also occur in different orders than disclosed in the description, and sometimes there is no specific order between the different operations or steps. For example, two sequential operations or steps may in fact be executed substantially concurrently, or they may sometimes be executed in the reverse order, depending upon the functionality involved. Each block of the block diagrams and/or flowchart illustrations, and combinations of blocks in the block diagrams and/or flowchart illustrations, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
Claims (17)
1. A method of task conflict determination, comprising:
and determining whether the tasks executing the more than two character strings conflict or not according to the intersection of the corresponding domains of the more than two character strings.
2. The method of claim 1, further comprising, before determining whether tasks executing two or more strings conflict based on an intersection of corresponding fields of the two or more strings:
receiving an instruction for performing conflict check on the task;
the instructions are executed using either the sdk interface or the rest interface.
3. The method of claim 2, wherein the string is a cron expression and the field corresponding to the string is a time field.
4. The method of claim 3, wherein the time domain comprises: second, minute, hour, day, month, week, year.
5. The method of claim 4, wherein the determining whether the tasks for executing the two or more strings conflict comprises:
judging whether the corresponding domains of the more than two character strings have intersection or not: under the condition that all corresponding domains of the more than two character strings have intersection, the tasks conflict; and under the condition that at least one corresponding domain of the more than two character strings has no intersection, the tasks do not conflict.
6. The method of claim 4, wherein the determining whether the tasks for executing the two or more strings conflict comprises:
judging whether the corresponding domains of the more than two character strings have intersection or not: under the condition that at least one corresponding domain of the more than two character strings has intersection, the tasks conflict; and under the condition that all corresponding domains of the more than two character strings have no intersection, the tasks do not conflict.
7. The method of claim 5, wherein the determining whether the corresponding fields of the two or more character strings intersect further comprises:
sequentially judging whether the corresponding domains of the character strings have intersections: and under the condition of intersection, continuously judging whether the next corresponding domain has intersection or not until all the domains are judged to be finished or the domain without intersection appears.
8. The method of claim 6, wherein the determining whether the corresponding fields of the two or more character strings intersect further comprises:
sequentially judging whether the corresponding domains of the character strings have intersections: and under the condition of no intersection, continuously judging whether the next corresponding domain has the intersection or not until all the domains are judged to be finished or the intersected domain appears.
9. An apparatus for task conflict determination, comprising:
a determination module configured to: and determining whether the tasks executing the more than two character strings conflict or not according to the intersection of the corresponding domains of the more than two character strings.
10. The apparatus of claim 9, further comprising:
an sdk interface or rest interface configured to: and executing and receiving an instruction for performing conflict check on the task before determining whether the task executing the more than two character strings conflicts according to the intersection of the corresponding domains of the more than two character strings.
11. The apparatus of claim 10, wherein the string is a cron expression, and the field corresponding to the string is a time field.
12. The apparatus of claim 11, wherein the time domain comprises: second, minute, hour, day, month, week, year.
13. The apparatus of claim 12, wherein the determining module is further configured to: judging whether the corresponding domains of the more than two character strings have intersection or not, and if so, the task conflicts; and under the condition that at least one corresponding domain of the more than two character strings has no intersection, the tasks do not conflict.
14. The apparatus of claim 12, wherein the determining module is further configured to: judging whether the corresponding domains of the more than two character strings have intersection or not: under the condition that at least one corresponding domain of the more than two character strings has intersection, the tasks conflict; and under the condition that all corresponding domains of the more than two character strings have no intersection, the tasks do not conflict.
15. The apparatus of claim 13, wherein the determining module is further configured to:
sequentially judging whether the corresponding domains of the character strings have intersections: and under the condition of intersection, continuously judging whether the next corresponding domain has intersection or not until all the domains are judged to be finished or the domain without intersection appears.
16. The apparatus of claim 14, wherein the determining module is further configured to:
sequentially judging whether the corresponding domains of the character strings have intersections: and under the condition of no intersection, continuously judging whether the next corresponding domain has the intersection or not until all the domains are judged to be finished or the intersected domain appears.
17. A server, characterized in that it comprises a device according to any one of claims 9 to 16.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910932226.8A CN110633303A (en) | 2019-09-29 | 2019-09-29 | Method and device for determining task conflict and server |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910932226.8A CN110633303A (en) | 2019-09-29 | 2019-09-29 | Method and device for determining task conflict and server |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110633303A true CN110633303A (en) | 2019-12-31 |
Family
ID=68974701
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910932226.8A Pending CN110633303A (en) | 2019-09-29 | 2019-09-29 | Method and device for determining task conflict and server |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110633303A (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20190050463A1 (en) * | 2017-08-11 | 2019-02-14 | Bae Systems Applied Intelligence Us Corp | Dynamic visualizations |
| CN109783718A (en) * | 2018-12-14 | 2019-05-21 | 中国联合网络通信集团有限公司 | Repetitive requests judgment method and device |
| CN110221905A (en) * | 2019-05-22 | 2019-09-10 | 网联清算有限公司 | Timed task monitoring method, device, system, equipment and storage medium |
-
2019
- 2019-09-29 CN CN201910932226.8A patent/CN110633303A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20190050463A1 (en) * | 2017-08-11 | 2019-02-14 | Bae Systems Applied Intelligence Us Corp | Dynamic visualizations |
| CN109783718A (en) * | 2018-12-14 | 2019-05-21 | 中国联合网络通信集团有限公司 | Repetitive requests judgment method and device |
| CN110221905A (en) * | 2019-05-22 | 2019-09-10 | 网联清算有限公司 | Timed task monitoring method, device, system, equipment and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 会吃猫的鱼: "cron冲突检测，检查多个cron表达式执行时间点是否有重合", 《HTTPS://BLOG.CSDN.NET/HCMDY/ARTICLE/DETAILS/80066590》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110209650A (en) | The regular moving method of data, device, computer equipment and storage medium | |
| CN109710402A (en) | Method, apparatus, computer equipment and the storage medium of process resource acquisition request | |
| CN109684304B (en) | Data migration method and device | |
| CN105487924A (en) | Batch processing controlling method and device | |
| CN112700329A (en) | Response method of wind control rule engine and wind control rule engine | |
| CN108197486A (en) | Big data desensitization method, system, computer-readable medium and equipment | |
| US11681559B2 (en) | Executing computing modules using multi-coring | |
| CN101673374B (en) | Bill processing method and device | |
| CN110347724A (en) | Abnormal behaviour recognition methods, device, electronic equipment and medium | |
| CN113343677B (en) | Intention identification method and device, electronic equipment and storage medium | |
| CN110599166A (en) | Method and device for acquiring transaction dependency relationship in block chain | |
| CN111404755B (en) | Network configuration method, device and storage medium | |
| CN104036039A (en) | Parallel processing method and system of data | |
| CN108121774A (en) | A kind of tables of data backup method and terminal device | |
| CN110535939A (en) | A kind of service discovery and method for pre-emptively, device, computer equipment and storage medium | |
| CN108845762A (en) | Disk drive bleach-out process and device when a kind of solution hot plug | |
| CN110633303A (en) | Method and device for determining task conflict and server | |
| CN106201692A (en) | A kind of timing task processing system and method | |
| US20180341521A1 (en) | Managing job schedules | |
| CN115185946A (en) | Multi-tenant system, multi-tenant management method, computer device, and storage medium | |
| CN114237775A (en) | Parallel execution method and device, electronic equipment and storage medium | |
| CN113626438A (en) | Data table management method and device, computer equipment and storage medium | |
| CN113342647A (en) | Test data generation method and device | |
| CN107291439A (en) | A kind of target delta data construction method and device | |
| CN106127026A (en) | Authority configuring method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20191231 |