CN113076186A - Task processing method and device, electronic equipment and storage medium - Google Patents
Task processing method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN113076186A CN113076186A CN202110493598.2A CN202110493598A CN113076186A CN 113076186 A CN113076186 A CN 113076186A CN 202110493598 A CN202110493598 A CN 202110493598A CN 113076186 A CN113076186 A CN 113076186A
- Authority
- CN
- China
- Prior art keywords
- task
- added
- item
- timing
- time
- 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.)
- Granted
Links
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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
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)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a method and a device for task processing, electronic equipment and a storage medium, and relates to the technical field of computers. One embodiment of the method comprises: receiving a task adding request, and judging whether a timing task corresponding to a data table exists or not; if not, generating a timing task corresponding to the data table, acquiring task information of the task to be added from the task adding request to generate a task item, and adding the task item into the timing task; if yes, acquiring task information of the task to be added, inquiring task information of task items included in the timing task to judge whether the task to be added and the task items conflict or not, if yes, sending task conflict prompt information, and if not, generating the task items based on the task information of the task to be added and adding the task items to the timing task. The implementation method can solve the problem that the operation data of the timed task is locked by other timed tasks in a transaction environment, so that task conflict is caused, and the stability of the application system is poor or the application system is unavailable.
Description
Technical Field
The present invention relates to the field of computer technologies, and in particular, to a method and an apparatus for task processing, an electronic device, and a storage medium.
Background
In an application system, each service sets a timing task to implement data operation in a data table of a database, and each timing task is usually executed in parallel. Because each timing task is executed in parallel, and the execution process of each timing task cannot be accurately controlled, when a certain timing task operates data in a data table, the data is locked by other timing tasks, so that task conflict is easily caused, the task cannot be executed, and the stability of an application system is poor or the application system is unavailable.
Disclosure of Invention
In view of this, embodiments of the present invention provide a method, an apparatus, an electronic device, and a storage medium for task processing, which can solve the problem that operation data of a timed task is locked by other timed tasks, so as to cause task conflict, thereby causing poor stability of an application system or making the application system unavailable.
To achieve the above object, according to an aspect of an embodiment of the present invention, a method of task processing is provided.
The task processing method of the embodiment of the invention comprises the following steps: receiving a task adding request, acquiring a data table identifier corresponding to a task to be added, and judging whether a timing task corresponding to the data table exists or not; if not, generating a timing task corresponding to the data table, acquiring task information of the task to be added from the task adding request to generate a task item, adding the task item to the timing task, and triggering the timing task based on the triggering time of the task item; if yes, acquiring task information of the task to be added from the task adding request, inquiring task information of task items included in the timed task to judge whether the task to be added and the task items conflict or not, if yes, sending task conflict prompt information, if not, generating task items based on the task information of the task to be added, adding the task items to the timed task, and serially triggering the timed task based on the triggering time of each task item in the timed task.
In one embodiment, the task information includes an execution time of the task and a processing object position;
the judging whether the task to be added and the task item conflict or not comprises the following steps:
and judging whether the task to be added and the task item conflict or not based on the execution time and the processing object position of the task to be added and the execution time and the processing object position of the task item.
In another embodiment, the determining whether the task to be added and the task item conflict with each other based on the execution information and the processing object position of the task to be added and the execution information and the processing object position of the task item includes:
judging whether the execution time of the task to be added is overlapped with the execution time of the task item;
if not, determining that the task to be added does not conflict with the task item;
if so, determining a target task item with the execution time overlapping with the execution time of the task to be added, and acquiring the processing object position of the target task item and the processing object position of the task to be added so as to judge whether the processing object position of the task to be added is the same as the processing object position of the target task item; if not, determining that the task to be added does not conflict with the task item, and if so, determining that the task to be added conflicts with the task item.
In another embodiment, before the determining whether the task to be added and the task item conflict, the method further includes:
and acquiring the trigger time and the preset execution time of the task to be added so as to calculate the execution time of the task to be added.
In another embodiment, the generating a task item based on the task information of the task to be added includes:
acquiring initial trigger time and trigger frequency of the task to be added from the task information of the task to be added to generate a task timing rule;
and acquiring the running interface of the task to be added, and combining the task timing rule to generate the task item.
In another embodiment, the serially triggering the timed task based on the trigger time of each task item in the timed task includes:
inquiring task timing rules of the timing tasks including task items to calculate the trigger time of the task items;
and determining the task item with the triggering time closest to the current time as the task to be triggered of the timing task, so as to trigger the task to be triggered when the current time reaches the triggering time of the task to be triggered.
In another embodiment, the serially triggering the timed task based on the trigger time of each task item in the timed task includes:
and acquiring the processing object position of each task item, determining the task items at the same processing object position as a task item group, and serially triggering each task item in the task item group based on the triggering time of each task item in the task item group.
To achieve the above object, according to another aspect of the embodiments of the present invention, there is provided a task processing apparatus.
The task processing device of the embodiment of the invention comprises: the receiving unit is used for receiving the task adding request, acquiring a data table identifier corresponding to the task to be added and judging whether a timing task corresponding to the data table exists or not; if not, generating a timing task corresponding to the data table, acquiring task information of the task to be added from the task adding request to generate a task item, adding the task item to the timing task, and triggering the timing task based on the triggering time of the task item; and if the timed task is not the same as the timed task, generating a task item based on the task information of the task to be added, adding the task item to the timed task, and serially triggering the timed task based on the triggering time of each task item in the timed task.
In one embodiment, the task information includes an execution time of the task and a processing object position;
the adding unit is specifically configured to:
and judging whether the task to be added and the task item conflict or not based on the execution time and the processing object position of the task to be added and the execution time and the processing object position of the task item.
In another embodiment, the adding unit is specifically configured to:
judging whether the execution time of the task to be added is overlapped with the execution time of the task item;
if not, determining that the task to be added does not conflict with the task item;
if so, determining a target task item with the execution time overlapping with the execution time of the task to be added, and acquiring the processing object position of the target task item and the processing object position of the task to be added so as to judge whether the processing object position of the task to be added is the same as the processing object position of the target task item; if not, determining that the task to be added does not conflict with the task item, and if so, determining that the task to be added conflicts with the task item.
In another embodiment, the adding unit is specifically configured to:
and acquiring the trigger time and the preset execution time of the task to be added so as to calculate the execution time of the task to be added.
In another embodiment, the adding unit is specifically configured to:
acquiring initial trigger time and trigger frequency of the task to be added from the task information of the task to be added to generate a task timing rule;
and acquiring the running interface of the task to be added, and combining the task timing rule to generate the task item.
In another embodiment, the adding unit is specifically configured to:
inquiring task timing rules of the timing tasks including task items to calculate the trigger time of the task items;
and determining the task item with the triggering time closest to the current time as the task to be triggered of the timing task, so as to trigger the task to be triggered when the current time reaches the triggering time of the task to be triggered.
In another embodiment, the adding unit is specifically configured to:
and acquiring the processing object position of each task item, determining the task items at the same processing object position as a task item group, and serially triggering each task item in the task item group based on the triggering time of each task item in the task item group.
To achieve the above object, according to still another aspect of an embodiment of the present invention, there is provided an electronic apparatus.
An electronic device of an embodiment of the present invention includes: one or more processors; the storage device is used for storing one or more programs, and when the one or more programs are executed by the one or more processors, the one or more processors are enabled to realize the method for processing the tasks provided by the embodiment of the invention.
To achieve the above object, according to still another aspect of an embodiment of the present invention, there is provided a computer-readable medium.
A computer-readable medium of an embodiment of the present invention stores thereon a computer program, which, when executed by a processor, implements a method of task processing provided by an embodiment of the present invention.
One embodiment of the above invention has the following advantages or benefits: in the embodiment of the invention, when a timing task is added to a data table, whether the timing task corresponding to the data table exists is firstly inquired based on the data table identification, if the data table does not have the corresponding timing task, the timing task corresponding to the data table can be directly generated, and a task item is generated based on task information of the task to be added so as to be added to the timing task, namely the task item is triggered through the timing task; if the data table has a corresponding timing task, the task conflict needs to be judged firstly, if the task conflict is judged, prompt information is sent to prompt that the task to be added conflicts with the existing task, and if the task is judged to have no conflict, a task item can be generated based on the task information of the task to be added to the timing task, so that the timing task is triggered serially based on the trigger time of each task item in the timing task, namely, each task item in the timing task is triggered serially based on the trigger event. Therefore, in the embodiment of the invention, only one timing task is configured for one data table, the timing task can comprise a plurality of task items, each task item can avoid the problem that the execution cannot be performed due to data locking during the execution through conflict judgment, simultaneously, each task item belonging to the same timing task can be serially triggered based on the trigger time of the task item, namely, the execution process control of each task item can be realized, and the problem that the execution cannot be performed due to the data locking is further avoided through the serial triggering of each task item in sequence, so that the problem that the stability of an application system is poor or the application system is unavailable is avoided.
Further effects of the above-mentioned non-conventional alternatives will be described below in connection with the embodiments.
Drawings
The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:
FIG. 1 is a schematic diagram of one primary flow of a method of task processing according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a mission plan store according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a task processing interface according to an embodiment of the invention;
FIG. 4 is a schematic diagram of a task addition interface according to an embodiment of the invention;
FIG. 5 is a schematic diagram of a main flow of a method for task conflict determination according to an embodiment of the present invention;
FIG. 6 is a schematic diagram of the main elements of a device for task processing according to an embodiment of the present invention;
FIG. 7 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;
FIG. 8 is a schematic block diagram of a computer system suitable for use in implementing embodiments of the present invention.
Detailed Description
Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
It should be noted that the embodiments and features of the embodiments may be combined with each other without conflict.
Embodiments of the present invention provide a task processing system, which may be used in a scenario for processing a timing task, for example, in a large-scale complex application system. Specifically, the timed task processing may include processes of scheduling and executing the timed task, and the scheduling of the timed task may include addition, modification, and deletion of the timed task. In the embodiment of the invention, the data tables are used as classification factors, a timing task is set for each data table, tasks operated on the same data table are all used as task items of the timing tasks corresponding to the data table, and the task items are configured based on different service requirements of the task items so as to avoid task conflict, thereby ensuring the stability of system operation.
An embodiment of the present invention provides a method for task processing, where the method may be performed by a task processing system, and as shown in fig. 1, the method includes:
s101: receiving a task adding request, acquiring a data table identifier corresponding to a task to be added, and judging whether a timing task corresponding to the data table exists.
The task adding request represents a request for adding a timed task to a data table, where the request may include a data table identifier corresponding to the task, task information, and the like, and the task information may specifically include execution time of the task, such as initial trigger time, trigger frequency, and the like, and may also include a corresponding processing object position and an execution interface of the task. The processing object position represents a position of data processed by the task in the data table, specifically a position of a row of the data processed by the task in the data table, the operation interface represents an interface called when the task is executed, and the trigger task can be executed by calling the operation interface.
It should be noted that each task may be used to implement a service requirement, in the embodiment of the present invention, a corresponding execution logic may be configured in the service system for each task, and an external operation interface is set, so that when a task is triggered, the operation interface may be directly called, thereby implementing task execution. Specifically, the run interface may be a Rest API. The data table identifier corresponding to the task to be added may include a plurality of data table identifiers, and at this time, it is necessary to determine whether the data table represented by each data table identifier has a corresponding timing task.
After receiving the task adding request in this step, the data table identifier corresponding to the task to be added may be obtained first to determine which data table it operates on, and then query is performed based on the data table identifier to determine whether the data table identifier has a corresponding timing task.
In the embodiment of the invention, the data table identifier can be specifically a database identifier where the data table is located and an identifier of the database, so that the data table corresponding to the task to be added can be accurately determined. After the timing task is established in the data table, a timing task identifier can be set for the timing task, and the corresponding relation between the data table and the timing task identifier is stored. If the timing task identifier corresponding to the data table identifier is empty, the timing task corresponding to the data table does not exist; and if the timing task identifier corresponding to the data table identifier is not empty, indicating that the timing task corresponding to the data table exists.
S102: if not, generating a timing task corresponding to the data table, acquiring task information of the task to be added from the task adding request to generate a task item, adding the task item into the timing task, and triggering the timing task based on the triggering time of the task item.
If not, it is indicated that no timing task corresponding to the data table exists, and at this time, a timing task may be newly created for the data table, that is, a timing task corresponding to the data table and a task identifier of the timing task are generated, and a correspondence between the data table identifier and the timing task identifier is stored. In the embodiment of the invention, each data table establishes a timing task, and each task needing to operate the data table is used as a task item of the timing task, so that the step can acquire task information of a task to be added from a task adding request to generate the task item, and the task item is added into the generated timing task after being generated, so that the timing task is triggered based on the triggering time of the task item subsequently, and the triggering of the task item is realized.
In the embodiment of the present invention, the process of generating the task item may be specifically executed as: acquiring initial trigger time and trigger frequency of a task to be added from task information of the task to be added to generate a task timing rule; and acquiring a running interface of the task to be added, and combining a task timing rule to generate a task item.
The content of the timing task core is the configuration timing rule to determine the triggering time of the task. In this step, the task information may include an initial trigger time and a trigger frequency of the task, so that a task timing rule, that is, Cron, may be generated based on the initial trigger time and the trigger frequency of the task to be added. It should be noted that the task information may not include the initial trigger time of the task, and at this time, the current time may be used as the initial trigger time of the task to generate the task timing rule. And after the task timing rule is generated, acquiring the running interface of the task to be added, and combining the two to generate the task item. The running interface of the task to be added can be obtained from the task information of the task to be added.
S103: if yes, acquiring task information of the task to be added from the task adding request, inquiring task information of task items included in the timing task to judge whether the task to be added and the task items conflict or not, if yes, sending task conflict prompt information, if not, generating the task items based on the task information of the task to be added, adding the task items into the timing task, and serially triggering the timing task based on the triggering time of each task item in the timing task.
If yes, it is indicated that the timed task corresponding to the data table exists, and at this time, it is necessary to determine whether the task to be added conflicts with each task item in the existing timed task. Since the task items in the task to be added and the timed task both operate the same data table, task conflicts are likely to occur, and therefore, before the task to be added is added, the task conflicts need to be judged first. If the task conflict exists, task conflict prompt information can be sent to prompt the user that the task to be added and other task items conflict, and if the task to be added and other task items continue to be configured, risks may exist; if the task conflict does not exist, the corresponding task item can be generated based on the task information of the task to be added and then added into the timing task, so that the adding process of the task to be added can be completed, and then triggering and executing are carried out based on the timing task.
It should be noted that, in the embodiment of the present invention, after the task conflict prompting information is sent, the subsequent step may be executed based on the instruction received again. If the received indication is that the task is continued to be added, a process of generating a task item based on the task information of the task to be added and adding the task item to the timed task can be executed.
In the embodiment of the invention, whether the task conflicts or not can be judged by judging whether the triggering time of each task item is the same as the triggering time of the task item to be added. Specifically, the following may be implemented: judging whether the timed task comprises a task item with the triggering time same as that of the task to be added or not, and if so, determining that the task to be added conflicts with the task item; if not, determining that the task to be added does not conflict with the task item. The triggering time of the task item to be added can be determined based on the task information of the task to be added, and the triggering time of each task item can be determined based on the task information of each task item.
In the embodiment of the present invention, after adding the generated task items to the timing task, the timing task may be triggered serially based on the trigger time of each task item in the timing task, and specifically, the method may be implemented as follows: inquiring a task timing rule of a timing task including each task item to calculate the trigger time of each task item; and determining the task item with the triggering time closest to the current time as the task to be triggered of the timing task, so as to trigger the task to be triggered when the current time reaches the triggering time of the task to be triggered.
Each task item has already determined that there is no task conflict, so the triggering can be done in sequence based on the triggering time of each task item. In this step, the task timing rules of the task items are queried for the task items included in the timing task, the trigger time of each task item can be calculated based on the task timing rules, that is, the trigger time of each task item is calculated, and then the trigger time closest to the current time is determined, which is closest to the current time, that is, the trigger time is reached first, so that the corresponding task item can be determined as the task item to be triggered, that is, the task item to be triggered, so that when the current time reaches the trigger time of the task to be triggered, the task to be triggered is triggered to execute the task to be triggered.
It should be noted that the process of triggering the timing task may be specifically executed after the timing task triggers a task item once, so as to determine a next task to be triggered. Meanwhile, after a task item is triggered by a timing task, whether a task item which is not triggered in time exists can be judged based on task information of each task item, and if yes, the task item can be triggered immediately so as to ensure that the task item can be executed in time.
In the embodiment of the invention, the data table and the timing task and the corresponding relation between the timing task and the task item can be stored through the task information table. Thus, based on the task information table, the query of the task item or the timing task can be realized. Meanwhile, the timed task or task item can be deleted and modified.
In the embodiment of the invention, only one timing task is configured for one data table, the timing task can comprise a plurality of task items, each task item can avoid the problem that the execution cannot be performed due to data locking during the execution through conflict judgment, simultaneously, each task item belonging to the same timing task can be serially triggered based on the triggering time of the task item, namely, the execution process control of each task item can be realized, and the problem that the execution cannot be performed due to the data locking is further avoided due to the sequential serial triggering of each task item, so that the problem that the stability of an application system is poor or the application system is unavailable is avoided.
It should be noted that in an application system, such as an internet Web application system, there are many tasks related to the presentation of a data extraction report, and the implementation logic usually adopted is to extract the required data in a timed task batch processing mode and then write the extracted data into a service table. In the embodiment of the present invention, an example of an update service of large-capacity screen information of a data center is described.
The information related to the large capacity screen of the data center is that all capacity related information of a data center mechanism is managed by taking a data center ID (dcId) and a key value (attrKey) of a related parameter as main index parameters. The information related to the large capacity screen of the data center comprises the following information: pue (energy efficiency) and HealthRate (machine room health), both of which update data by setting timing tasks, pue update frequency is typically configured by hours and HealthRate update frequency is typically configured by days. And the two parameters are used for processing data in the same data table, so that if the timing task cannot be configured properly, the task conflict caused by operating the same batch (for example, the same two rows) of data in the same data table is very likely to occur.
In the embodiment of the invention, the timed task can be planned based on the service requirement of the capacity large-screen information update of the data center, and because the data update of pue and the HealthRate is configured based on the service requirement, the corresponding data update is realized when the tasks corresponding to the pue and the HealthRate are executed, and the updated data is sent to the capacity large-screen display of the data center. Since the corresponding database is explicit, the data table of the task operation can be explicit, for example, the data table may be a dcs _ main data table in dcmodb database, and at this time, pue and the healthRate task plan may be stored, and the specific format may be as shown in fig. 2. In fig. 2, id identifies the mission plan identification, pue and the heatrate represent the key values of the corresponding parameters in the table, and dcId represents the attribute that distinguishes the data centers.
pue and the heartbeat rate are two parameters, and the update frequency of the two parameters is different, i.e. the trigger frequency of the corresponding task is different, so that the two parameters need to correspond to one timing task respectively. However, since the tasks of the two data tables need to operate on the same data table, and each data table corresponds to one timing task, pue and the HealthRate respectively correspond to one task item and belong to the timing task corresponding to the operated data table. Since the update frequency of pue is hourly and higher than the update frequency of HealthRat e, the trigger frequency of the data table for the corresponding timed task is based on the update frequency of pue, i.e., triggered hourly.
It should be noted that the task planning process can be performed in a timed task management system, and the timed task management system can be a system implemented based on quartz and can also be other similar systems supporting timed task management, which is a basis for task arrangement. After the task planning is completed, task addition may be performed by the embodiment shown in fig. 1.
The task processing method and the task processing device can process the task in a visualization mode. The related contents may be input through a display interface as shown in fig. 3, for example, at the time of task processing. The interface shown in fig. 3 may be displayed when a user selects or newly creates a timed task, the processing of the task may include adding, deleting and modifying, a database (e.g., dcmdb) and data table information (dcs _ main) related to the task processing may be first input or selected in the interface shown in fig. 3, that is, a data table identifier in step S101, and then, based on the database and the data table information, it may be queried whether a corresponding timed task exists in the data table, and if so, a timed task name and task information, that is, a task remark description, may be directly displayed from the interface shown in fig. 3; if the timing task does not exist, the content can not be displayed to indicate that the corresponding timing task does not exist in the data table, and relevant configuration is required to be carried out, such as the generation of the timing task. For a task adding scene, after determining that the corresponding timing task exists in the data table, the task information of the task to be added may be input based on the interface shown in fig. 4. After receiving the task information input through the interface shown in fig. 4, the task conflict may be determined. The task item URL in fig. 4 identifies address information storing task item execution logic.
The timing rules for the task items in FIG. 4 may be generated based on the task information entered in the interface of FIG. 4. For example, setting pue corresponds to a task item being updated every hour, and then selecting a value, such as 5, from the "score" options in time in the interface, while none of the others are selected, and the cron expression is automatically updated to "05 ×? At this point, the 5 th minute representing each hour initiates the execution pue of the task item; setting the HealthRate corresponding to the task item to be executed once a day, selecting a numerical value from the time options in the interface, such as 3, and not selecting any other, and automatically updating the cron expression to "003? At this time, it indicates that the trigger HealthRate corresponds to the task item 3 points in the morning each day.
After the interface shown in fig. 4 clicks the "create" button, the trigger time of the task item may be calculated based on the cron expression corresponding to pue or HealthRat e, and may be stored in the task item information table.
Taking the example that the timing task includes pue and two task items corresponding to the HealthRate, after the timing task is triggered once, the triggering time of the timing task and the HealthRate can be calculated based on the task timing rules of the two task items corresponding to pue and HealthRate, the triggering time closest to the current time is determined, the triggering time is determined as the next triggering time of the timing task, and the task item corresponding to the triggering event is determined as the task item to be triggered. Therefore, the task items in the timing task can be triggered in series according to the triggering time, and task conflict is avoided when the task items are executed.
It should be noted that, even if the trigger times of the two task items are the same, the positions of the two processing data in the data table are different, no task conflict occurs; however, even if the trigger times of the two task items are different, when the positions of the two processing data in the data table are the same and the task execution times overlap, a task conflict may also occur, so in the embodiment of the present invention, it may be determined whether a task conflict exists based on the execution time of the task and the position of the processing object, that is, whether the task to be added and the task item conflict, may be specifically executed as: and judging whether the task to be added and the task item conflict or not based on the execution time and the processing object position of the task to be added and the execution time and the processing object position of the task item.
Specifically, the following specifically describes, with reference to the embodiment shown in fig. 1, a method for determining whether a task to be added and a task item conflict in step S103 in the embodiment of the present invention, as shown in fig. 5, the method includes:
s501: and judging whether the execution time of the task to be added is overlapped with the execution time of the task item.
The execution time may be calculated based on the trigger time and the execution duration, for example, if the trigger time is 2 points, and the execution time is 5 seconds, the execution duration is 2 points to 2 points and zero 5 seconds. The execution duration can be preset for each task item, so that the corresponding execution time can be calculated. For the task to be added, the trigger time and the preset execution duration of the task to be added can be obtained from the task information so as to calculate the execution time of the task to be added. Therefore, whether the execution time of the task to be added is overlapped with the execution time of the task item can be judged.
S502: if not, determining that the task to be added does not conflict with the task item.
If not, the execution time of the task to be added is not overlapped with the execution time of each task item, so that the data operation at the same position is not conflicted, and the task to be added is determined not to be conflicted with the task items.
S503: if so, determining a target task item with the execution time overlapping with the execution time of the task to be added, and acquiring the processing object position of the target task item and the processing object position of the task to be added so as to judge whether the processing object position of the task to be added is the same as the processing object position of the target task item; and if not, determining that the task to be added does not conflict with the task item, and if so, determining that the task to be added conflicts with the task item.
If so, it is indicated that the execution time of the task to be added overlaps with the execution time of one or more task items, and thus, the task items with overlapped execution times may conflict with the task to be added, that is, the task item is the target task item. The processing object position of the target task item and the processing object position of the task to be added can be acquired and then judged. If the processing object position of the task to be added is different from the processing object position of the target task item, determining that the task to be added is not conflicted with the target task item, namely the task to be added is not conflicted with the task item in the timing task; and if the position of the processing object of the task to be added is the same as the position of the processing object of the target task item, determining that the task to be added is in conflict with the target task item, namely that the task to be added is in conflict with the task item in the timing task.
In the embodiment of the invention, when the task item is added, the conflict can be found in time through task conflict judgment, so that the user can make adjustment in time, the robustness of the system is improved, and the transition concentration of the timed task at a certain moment is avoided; the problem that the system is unavailable due to the fact that multiple timed tasks are needed and task conflicts caused by difficulty in overall arrangement in an application scene are effectively solved, usability and stability of the system are improved, the problem that service cannot be provided outwards due to the task conflicts is avoided, smoothness of services is guaranteed, and good experience of users is achieved.
In the embodiment of the invention, the timed tasks are managed in a grading way, each data table corresponds to one timed task and a plurality of task items, namely, the tasks for processing different data tables can exist as different timed tasks, the same data table tasks are processed, the task items in the timed tasks are used as processing units and are sequentially arranged in a time sequence, the visual operation management of the timed tasks is simplified, the operation and maintenance efficiency of a service system is improved, and the complexity is reduced. And moreover, the execution sequence and the processing of the corresponding data table of how many timing tasks are in the system are visual and clear, and the design and arrangement of the timing tasks are convenient.
It should be noted that, because the processing object positions are different and conflicts may also occur between task items, in the embodiment of the present invention, task items in a timed task may be grouped based on the processing object positions, task items with the same processing object positions are determined as a task group, task items in the same task item group are set, serial triggering is performed based on trigger time, and task items in different task groups may be set as serial triggering or parallel triggering according to requirements. Specifically, the following may be implemented: the processing object positions of the task items are obtained, the task items at the same processing object position are determined to be a task item group, and the task items in the task item group are triggered in series based on the triggering time of the task items in the task item group.
In order to solve the problems in the prior art, an embodiment of the present invention provides a device 600 for task processing, as shown in fig. 6, where the device 600 includes:
a receiving unit 601, configured to receive a task adding request, obtain a data table identifier corresponding to a task to be added, and determine whether a timing task corresponding to the data table exists;
a generating unit 602, configured to generate a timing task corresponding to the data table if the task is not to be added, acquire task information of the task to be added from the task addition request to generate a task item, add the task item to the timing task, and trigger the timing task based on a trigger time of the task item;
an adding unit 603, configured to, if yes, obtain task information of the task to be added from the task addition request, query task information of task items included in the timing task, to determine whether the task to be added and the task items conflict, if yes, send task conflict prompt information, if not, generate a task item based on the task information of the task to be added, add the task item to the timing task, and serially trigger the timing task based on trigger time of each task item in the timing task.
It should be understood that the manner of implementing the embodiment of the present invention is the same as the manner of implementing the embodiment shown in fig. 1, and the description thereof is omitted.
In an implementation manner of the embodiment of the present invention, the task information includes a task execution time and a processing object position;
the adding unit 603 is specifically configured to:
and judging whether the task to be added and the task item conflict or not based on the execution time and the processing object position of the task to be added and the execution time and the processing object position of the task item.
In another implementation manner of the embodiment of the present invention, the adding unit 603 is specifically configured to:
judging whether the execution time of the task to be added is overlapped with the execution time of the task item;
if not, determining that the task to be added does not conflict with the task item;
if so, determining a target task item with the execution time overlapping with the execution time of the task to be added, and acquiring the processing object position of the target task item and the processing object position of the task to be added so as to judge whether the processing object position of the task to be added is the same as the processing object position of the target task item; if not, determining that the task to be added does not conflict with the task item, and if so, determining that the task to be added conflicts with the task item.
In another implementation manner of the embodiment of the present invention, the adding unit 603 is specifically configured to:
and acquiring the trigger time and the preset execution time of the task to be added so as to calculate the execution time of the task to be added.
In another implementation manner of the embodiment of the present invention, the adding unit 603 is specifically configured to:
acquiring initial trigger time and trigger frequency of the task to be added from the task information of the task to be added to generate a task timing rule;
and acquiring the running interface of the task to be added, and combining the task timing rule to generate the task item.
In another implementation manner of the embodiment of the present invention, the adding unit 603 is specifically configured to:
inquiring task timing rules of the timing tasks including task items to calculate the trigger time of the task items;
and determining the task item with the triggering time closest to the current time as the task to be triggered of the timing task, so as to trigger the task to be triggered when the current time reaches the triggering time of the task to be triggered.
In another implementation manner of the embodiment of the present invention, the adding unit 603 is specifically configured to:
and acquiring the processing object position of each task item, determining the task items at the same processing object position as a task item group, and serially triggering each task item in the task item group based on the triggering time of each task item in the task item group.
It should be understood that the embodiment of the present invention is implemented in the same manner as the embodiment shown in fig. 1 or fig. 5, and is not repeated herein.
In the embodiment of the invention, only one timing task is configured for one data table, the timing task can comprise a plurality of task items, each task item can avoid the problem that the execution cannot be performed due to data locking during the execution through conflict judgment, simultaneously, each task item belonging to the same timing task can be serially triggered based on the triggering time of the task item, namely, the execution process control of each task item can be realized, and the problem that the execution cannot be performed due to the data locking is further avoided due to the sequential serial triggering of each task item, so that the problem that the stability of an application system is poor or the application system is unavailable is avoided.
According to an embodiment of the present invention, an electronic device and a readable storage medium are also provided.
The electronic device of the embodiment of the invention comprises: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the processor, and the instructions are executed by the at least one processor to cause the at least one processor to execute the method for task processing provided by the embodiment of the invention.
Fig. 7 shows an exemplary system architecture 700 of a method of task processing or a device of task processing to which embodiments of the present invention may be applied.
As shown in fig. 7, the system architecture 700 may include terminal devices 701, 702, 703, a network 704, and a server 705. The network 704 serves to provide a medium for communication links between the terminal devices 701, 702, 703 and the server 705. Network 704 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.
A user may use the terminal devices 701, 702, 703 to interact with a server 705 over a network 704, to receive or send messages or the like. Various client applications may be installed on the terminal devices 701, 702, 703.
The terminal devices 701, 702, 703 may be, but are not limited to, smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The server 705 may be a server that provides various services, and may analyze and perform processing such as analysis on data such as a received task addition request, and feed back a processing result (for example, prompt information or success information — just an example) to the terminal device.
It should be noted that the method for task processing provided by the embodiment of the present invention is generally executed by the server 705, and accordingly, a device for task processing is generally disposed in the server 705.
It should be understood that the number of terminal devices, networks, and servers in fig. 7 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Referring now to FIG. 8, a block diagram of a computer system 800 suitable for use in implementing embodiments of the present invention is shown. The computer system illustrated in FIG. 8 is only one example and should not impose any limitations on the scope of use or functionality of embodiments of the invention.
As shown in fig. 8, the computer system 800 includes a Central Processing Unit (CPU)801 that can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)802 or a program loaded from a storage section 808 into a Random Access Memory (RAM) 803. In the RAM 803, various programs and data necessary for the operation of the system 800 are also stored. The CPU 801, ROM 802, and RAM 803 are connected to each other via a bus 804. An input/output (I/O) interface 805 is also connected to bus 804.
The following components are connected to the I/O interface 805: an input portion 806 including a keyboard, a mouse, and the like; an output section 807 including a signal such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 808 including a hard disk and the like; and a communication section 809 including a network interface card such as a LAN card, a modem, or the like. The communication section 809 performs communication processing via a network such as the internet. A drive 810 is also connected to the I/O interface 805 as necessary. A removable medium 811 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 810 as necessary, so that a computer program read out therefrom is mounted on the storage section 808 as necessary.
In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program can be downloaded and installed from a network through the communication section 809 and/or installed from the removable medium 811. The computer program executes the above-described functions defined in the system of the present invention when executed by the Central Processing Unit (CPU) 801.
It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
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 various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a unit, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, 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. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units described in the embodiments of the present invention may be implemented by software or hardware. The described units may also be provided in a processor, and may be described as: a processor includes a receiving unit, a generating unit, and an adding unit. Where the names of these elements do not in some cases constitute a limitation of the element itself, for example, a receiving element may also be described as "an element of the function of the receiving element".
As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to perform the method for task processing provided by the present invention.
The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (10)
1. A method of task processing, comprising:
receiving a task adding request, acquiring a data table identifier corresponding to a task to be added, and judging whether a timing task corresponding to the data table exists or not;
if not, generating a timing task corresponding to the data table, acquiring task information of the task to be added from the task adding request to generate a task item, adding the task item to the timing task, and triggering the timing task based on the triggering time of the task item;
if yes, acquiring task information of the task to be added from the task adding request, inquiring task information of task items included in the timed task to judge whether the task to be added and the task items conflict or not, if yes, sending task conflict prompt information, if not, generating task items based on the task information of the task to be added, adding the task items to the timed task, and serially triggering the timed task based on the triggering time of each task item in the timed task.
2. The method according to claim 1, wherein the task information includes an execution time of the task and a processing object position;
the judging whether the task to be added and the task item conflict or not comprises the following steps:
and judging whether the task to be added and the task item conflict or not based on the execution time and the processing object position of the task to be added and the execution time and the processing object position of the task item.
3. The method according to claim 2, wherein the determining whether the task to be added and the task item conflict based on the execution information and the processing object position of the task to be added and the execution information and the processing object position of the task item comprises:
judging whether the execution time of the task to be added is overlapped with the execution time of the task item;
if not, determining that the task to be added does not conflict with the task item;
if so, determining a target task item with the execution time overlapping with the execution time of the task to be added, and acquiring the processing object position of the target task item and the processing object position of the task to be added so as to judge whether the processing object position of the task to be added is the same as the processing object position of the target task item; if not, determining that the task to be added does not conflict with the task item, and if so, determining that the task to be added conflicts with the task item.
4. The method according to claim 2, before said determining whether the task to be added and the task item conflict, further comprising:
and acquiring the trigger time and the preset execution time of the task to be added so as to calculate the execution time of the task to be added.
5. The method of claim 1, wherein generating task items based on task information of the tasks to be added comprises:
acquiring initial trigger time and trigger frequency of the task to be added from the task information of the task to be added to generate a task timing rule;
and acquiring the running interface of the task to be added, and combining the task timing rule to generate the task item.
6. The method of claim 1, wherein serially triggering the timed task based on the trigger time of each task item in the timed task comprises:
inquiring task timing rules of the timing tasks including task items to calculate the trigger time of the task items;
and determining the task item with the triggering time closest to the current time as the task to be triggered of the timing task, so as to trigger the task to be triggered when the current time reaches the triggering time of the task to be triggered.
7. The method of claim 1, wherein serially triggering the timed task based on the trigger time of each task item in the timed task comprises:
and acquiring the processing object position of each task item, determining the task items at the same processing object position as a task item group, and serially triggering each task item in the task item group based on the triggering time of each task item in the task item group.
8. An apparatus for task processing, comprising:
the receiving unit is used for receiving the task adding request, acquiring a data table identifier corresponding to the task to be added and judging whether a timing task corresponding to the data table exists or not;
if not, generating a timing task corresponding to the data table, acquiring task information of the task to be added from the task adding request to generate a task item, adding the task item to the timing task, and triggering the timing task based on the triggering time of the task item;
and if the timed task is not the same as the timed task, generating a task item based on the task information of the task to be added, adding the task item to the timed task, and serially triggering the timed task based on the triggering time of each task item in the timed task.
9. An electronic device, comprising:
one or more processors;
a storage device for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-7.
10. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110493598.2A CN113076186B (en) | 2021-05-07 | 2021-05-07 | Task processing method, device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110493598.2A CN113076186B (en) | 2021-05-07 | 2021-05-07 | Task processing method, device, electronic equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113076186A true CN113076186A (en) | 2021-07-06 |
| CN113076186B CN113076186B (en) | 2023-07-28 |
Family
ID=76616362
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110493598.2A Active CN113076186B (en) | 2021-05-07 | 2021-05-07 | Task processing method, device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113076186B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113590216A (en) * | 2021-07-19 | 2021-11-02 | 上海淇玥信息技术有限公司 | Timing task centralized management method and device and electronic equipment |
| CN117252309A (en) * | 2023-11-15 | 2023-12-19 | 青岛海信信息科技股份有限公司 | Automatic timing execution method for office business process |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1057303A2 (en) * | 1998-12-16 | 2000-12-06 | Koninklijke Philips Electronics N.V. | Fairness scheme for a serial interface |
| WO2007113543A1 (en) * | 2006-04-03 | 2007-10-11 | British Telecommunications Public Limited Company | Conflict handler |
| US20100333109A1 (en) * | 2009-06-30 | 2010-12-30 | Sap Ag | System and method for ordering tasks with complex interrelationships |
| WO2014101487A1 (en) * | 2012-12-28 | 2014-07-03 | 中兴通讯股份有限公司 | Data acquisition method and device |
| CN106557360A (en) * | 2016-11-09 | 2017-04-05 | 青岛海信电器股份有限公司 | Task run method and device |
| CN107885609A (en) * | 2017-11-08 | 2018-04-06 | 泰康保险集团股份有限公司 | Service conflict processing method and processing device, storage medium and electronic equipment |
| CN108762911A (en) * | 2018-06-13 | 2018-11-06 | 平安科技（深圳）有限公司 | Timing task management method, apparatus, computer equipment and storage medium |
| CN110275780A (en) * | 2019-06-26 | 2019-09-24 | 北京百度网讯科技有限公司 | Method and apparatus for limiting flow |
| CN111679895A (en) * | 2020-04-27 | 2020-09-18 | 中国平安财产保险股份有限公司 | Execution method, device and equipment of distributed timing task and readable storage medium |
| US20200349415A1 (en) * | 2019-04-30 | 2020-11-05 | Clari Inc. | Method for capturing and storing contact information from a physical medium using machine learning |
| WO2020232878A1 (en) * | 2019-05-23 | 2020-11-26 | 平安科技（深圳）有限公司 | Spring mvc-based timed task processing method, apparatus and computer device |
| CN112163042A (en) * | 2020-09-24 | 2021-01-01 | 杭州安恒信息技术股份有限公司 | Method and device for synchronizing variable data, electronic device and storage medium |
-
2021
- 2021-05-07 CN CN202110493598.2A patent/CN113076186B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1057303A2 (en) * | 1998-12-16 | 2000-12-06 | Koninklijke Philips Electronics N.V. | Fairness scheme for a serial interface |
| WO2007113543A1 (en) * | 2006-04-03 | 2007-10-11 | British Telecommunications Public Limited Company | Conflict handler |
| US20100333109A1 (en) * | 2009-06-30 | 2010-12-30 | Sap Ag | System and method for ordering tasks with complex interrelationships |
| WO2014101487A1 (en) * | 2012-12-28 | 2014-07-03 | 中兴通讯股份有限公司 | Data acquisition method and device |
| CN106557360A (en) * | 2016-11-09 | 2017-04-05 | 青岛海信电器股份有限公司 | Task run method and device |
| CN107885609A (en) * | 2017-11-08 | 2018-04-06 | 泰康保险集团股份有限公司 | Service conflict processing method and processing device, storage medium and electronic equipment |
| CN108762911A (en) * | 2018-06-13 | 2018-11-06 | 平安科技（深圳）有限公司 | Timing task management method, apparatus, computer equipment and storage medium |
| US20200349415A1 (en) * | 2019-04-30 | 2020-11-05 | Clari Inc. | Method for capturing and storing contact information from a physical medium using machine learning |
| WO2020232878A1 (en) * | 2019-05-23 | 2020-11-26 | 平安科技（深圳）有限公司 | Spring mvc-based timed task processing method, apparatus and computer device |
| CN110275780A (en) * | 2019-06-26 | 2019-09-24 | 北京百度网讯科技有限公司 | Method and apparatus for limiting flow |
| CN111679895A (en) * | 2020-04-27 | 2020-09-18 | 中国平安财产保险股份有限公司 | Execution method, device and equipment of distributed timing task and readable storage medium |
| CN112163042A (en) * | 2020-09-24 | 2021-01-01 | 杭州安恒信息技术股份有限公司 | Method and device for synchronizing variable data, electronic device and storage medium |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113590216A (en) * | 2021-07-19 | 2021-11-02 | 上海淇玥信息技术有限公司 | Timing task centralized management method and device and electronic equipment |
| CN113590216B (en) * | 2021-07-19 | 2024-03-19 | 上海淇玥信息技术有限公司 | Timing task centralized management method and device and electronic equipment |
| CN117252309A (en) * | 2023-11-15 | 2023-12-19 | 青岛海信信息科技股份有限公司 | Automatic timing execution method for office business process |
| CN117252309B (en) * | 2023-11-15 | 2024-02-13 | 青岛海信信息科技股份有限公司 | Automatic timing execution method for office business process |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113076186B (en) | 2023-07-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2019237586A1 (en) | Method and apparatus for managing scheduled tasks, computer device and storage medium | |
| CN113076186B (en) | Task processing method, device, electronic equipment and storage medium | |
| CN113760488B (en) | Method, apparatus, device and computer readable medium for scheduling tasks | |
| CN112669110A (en) | Server label management method and related equipment | |
| CN108874828A (en) | The method and apparatus of Data Migration | |
| CN113900561B (en) | Form processing method, form processing device, electronic equipment, medium and program product | |
| JP2019121285A (en) | Configuration change management device, configuration change management method, and program | |
| CN110377416A (en) | Distributed subregion method for scheduling task and device | |
| CN109492200A (en) | Cooperated documents restoring method, device, storage medium and electronic equipment | |
| CN112947918A (en) | Data display method and device | |
| WO2024160121A1 (en) | Data production method and apparatus, and medium and electronic device | |
| CN111159207B (en) | Information processing method and device | |
| CN109271224B (en) | Method and apparatus for determining position | |
| CN111143408A (en) | Event processing method and device based on business rules | |
| CN110362297B (en) | Element ordering method and device | |
| CN113360689B (en) | Image retrieval system, method, related device and computer program product | |
| CN115543423A (en) | Method, device and equipment for generating benchmarks and storage medium | |
| CN115860877A (en) | Product marketing method, device, equipment and medium | |
| CN115454971A (en) | Data migration method and device, electronic equipment and storage medium | |
| CN115309558A (en) | Resource scheduling management system, method, computer equipment and storage medium | |
| CN115061947A (en) | Resource management method, device, equipment and storage medium | |
| CN110968334B (en) | Application resource updating method, resource package manufacturing method, device, medium and equipment | |
| CN113312900A (en) | Data verification method and device | |
| CN115086333B (en) | Service request distribution method, device and storage medium | |
| CN115904720A (en) | Resource group generation method, device, equipment 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |