CN110807048A - Automatic task processing method and device, computer storage medium and electronic equipment - Google Patents
Automatic task processing method and device, computer storage medium and electronic equipment Download PDFInfo
- Publication number
- CN110807048A CN110807048A CN201911046834.5A CN201911046834A CN110807048A CN 110807048 A CN110807048 A CN 110807048A CN 201911046834 A CN201911046834 A CN 201911046834A CN 110807048 A CN110807048 A CN 110807048A
- Authority
- CN
- China
- Prior art keywords
- task
- data acquisition
- acquisition task
- data
- execution state
- 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
- 238000003672 processing method Methods 0.000 title claims abstract description 35
- 238000012545 processing Methods 0.000 claims abstract description 33
- 238000000034 method Methods 0.000 claims abstract description 32
- 238000012544 monitoring process Methods 0.000 claims abstract description 27
- 238000004590 computer program Methods 0.000 claims description 2
- 230000008676 import Effects 0.000 description 38
- 238000010586 diagram Methods 0.000 description 8
- 230000008569 process Effects 0.000 description 7
- 230000009191 jumping Effects 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 3
- 230000003111 delayed effect Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 239000013307 optical fiber Substances 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 230000008092 positive effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 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/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
- G06F16/24568—Data stream processing; Continuous queries
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Stored Programmes (AREA)
Abstract
The disclosure relates to the technical field of data processing, and provides an automatic task processing method, an automatic task processing device, a computer readable medium and an electronic device, wherein the method comprises the following steps: monitoring the execution state of a first data acquisition task at preset time intervals; when the execution state is successful, generating a first identifier corresponding to the first data acquisition task; acquiring the calling times of a second data acquisition task, wherein the priority of the first data acquisition task is higher than that of the second data acquisition task; and when the calling times meet a preset condition, acquiring the first identifier and starting the second data acquisition task. According to the method and the device, the situation that problems are found out by manual monitoring and untimely can be avoided by automatically monitoring the execution state of the task, and the task processing efficiency is improved.
Description
Technical Field
The present disclosure relates to the field of data processing technologies, and in particular, to an automatic task processing method, an automatic task processing apparatus, a computer-readable storage medium, and an electronic device.
Background
With the advent of the big data age, more and more information exists in the form of data, and the data is processed and sometimes needs to be processed according to a certain sequence. For example, in the current relational database model, it is generally required to acquire a high-priority data stream and a low-priority data stream, and collect the high-priority data stream and the low-priority data stream into the same data pool according to the priority, and use the full data as a basis for statistics and analysis by a user, which requires that the high-priority data stream and the low-priority data stream are sequentially collected into the data pool according to the priority order.
In the prior art, a high-priority data stream is generally acquired first, the high-priority data stream is merged into a data pool, a preset completion time is set according to the estimated processing time of the high-priority data stream, and when the preset completion time is reached, a low-priority data stream is acquired again, and the low-priority data stream is merged into the data pool. However, if a delay or failure occurs while processing a high priority data stream, human intervention is required to manually perform the entire flow.
In view of the above, there is a need in the art to develop a new automatic task processing method and apparatus.
It is to be noted that the information disclosed in the above background section is only for enhancement of understanding of the background of the present disclosure, and thus may include information that does not constitute prior art known to those of ordinary skill in the art.
Disclosure of Invention
The present disclosure is directed to an automatic task processing method, an automatic task processing apparatus, a computer-readable storage medium, and an electronic device, so as to at least improve a problem that the prior art cannot automatically process tasks according to a priority order.
Additional features and advantages of the disclosure will be set forth in the detailed description which follows, or in part will be obvious from the description, or may be learned by practice of the disclosure.
According to an aspect of the present disclosure, there is provided an automatic task processing method, the method including: monitoring the execution state of a first data acquisition task at preset time intervals; when the execution state is successful, generating a first identifier corresponding to the first data acquisition task; acquiring the calling times of a second data acquisition task, wherein the priority of the first data acquisition task is higher than that of the second data acquisition task; and when the calling times meet a preset condition, acquiring the first identifier and starting the second data acquisition task.
In some exemplary embodiments of the present disclosure, listening for an execution status of a first data acquisition task at a preset time interval includes: and acquiring a return value related to the execution state of the first data acquisition task within the preset time interval, and judging the execution state according to the return value.
In some exemplary embodiments of the present disclosure, after determining the execution state according to the return value, the method further comprises: and if the execution state is complete but not successful, restarting the first data acquisition task.
In some exemplary embodiments of the present disclosure, after determining the execution state according to the return value, the method further comprises: and if the execution state is running, continuing to monitor the execution state of the first data acquisition task.
In some exemplary embodiments of the present disclosure, after obtaining the number of calls of the second data obtaining task, the method further comprises: when the calling times are zero, acquiring the first identifier and starting the second data acquisition task; and monitoring the second data acquisition task when the calling times are non-zero times.
In some exemplary embodiments of the present disclosure, the method further comprises: and deleting the first identifier and generating a second identifier corresponding to the second data acquisition task while starting the second data acquisition task.
In some exemplary embodiments of the present disclosure, obtaining the number of times the second data obtaining task is invoked includes: judging whether an identifier corresponding to the second data acquisition task exists or not; if the second data acquisition task does not exist, judging that the calling frequency of the second data acquisition task is zero; and if so, judging that the calling times of the second data acquisition task are non-zero times, and acquiring the calling times.
According to an aspect of the present disclosure, there is provided an automatic task processing device including: the monitoring module is used for monitoring the execution state of the first data acquisition task at preset time intervals; the identification module is used for generating a first identification corresponding to the first data acquisition task when the execution state is successfully completed; the acquisition module is used for acquiring the calling times of a second data acquisition task, wherein the priority of the first data acquisition task is higher than that of the second data acquisition task; and the starting module is used for acquiring the first identifier and starting the second data acquisition task when the calling times meet a preset condition.
According to an aspect of the present disclosure, there is provided a computer readable medium having stored thereon a computer program which, when executed by a processor, implements the automatic task processing method as described in the above embodiments.
According to an aspect of the present disclosure, there is provided an electronic device including: one or more processors; a storage device for storing one or more programs which, when executed by the one or more processors, cause the one or more processors to implement the automatic task processing method as described in the above embodiments.
As can be seen from the foregoing technical solutions, the automatic task processing method and apparatus, the computer-readable storage medium, and the electronic device in the exemplary embodiments of the present disclosure have at least the following advantages and positive effects:
the automatic task processing method comprises the steps of monitoring the execution state of a first data acquisition task, generating a first identifier corresponding to the first data acquisition task when the first data acquisition task is successfully completed, acquiring the calling frequency of a second data acquisition task, acquiring the first identifier when the calling frequency meets a preset condition, and starting the second data acquisition task, wherein the priority of the first data acquisition task is higher than that of the second data acquisition task. On one hand, the automatic task processing method can automatically monitor and control the execution sequence of the first data acquisition task and the second data acquisition task, so that the problems found in the manual monitoring process are avoided being untimely and the whole task needs to be manually controlled, and the task processing efficiency is improved; on the other hand, the system can replace manpower to complete task processing with sequential requirements in an automatic local mode in time and completely, reduces time for finding problems and error rate caused by manual control, and reduces labor cost for task processing.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and together with the description, serve to explain the principles of the disclosure. It is to be understood that the drawings in the following description are merely exemplary of the disclosure, and that other drawings may be derived from those drawings by one of ordinary skill in the art without the exercise of inventive faculty.
FIG. 1 schematically shows a flow diagram of a task processing method according to an embodiment of the present disclosure;
FIG. 2 schematically illustrates a flow diagram of an automated task processing method according to an embodiment of the present disclosure;
FIG. 3 schematically illustrates a detailed flow diagram of an automated task processing method according to an embodiment of the present disclosure;
FIG. 4 is a schematic flow chart diagram illustrating a method for automatic task processing in an application scenario, according to an embodiment of the present disclosure;
FIG. 5 schematically illustrates a block diagram of an automated task processing apparatus according to an embodiment of the present disclosure;
FIG. 6 schematically shows a block schematic of an electronic device according to an embodiment of the present disclosure;
fig. 7 schematically shows a program product schematic according to an embodiment of the present disclosure.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art.
Furthermore, the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a thorough understanding of embodiments of the disclosure. One skilled in the relevant art will recognize, however, that the subject matter of the present disclosure can be practiced without one or more of the specific details, or with other methods, components, devices, steps, and so forth. In other instances, well-known methods, devices, implementations, or operations have not been shown or described in detail to avoid obscuring aspects of the disclosure.
The block diagrams shown in the figures are functional entities only and do not necessarily correspond to physically separate entities. I.e. these functional entities may be implemented in the form of software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor means and/or microcontroller means.
The flow charts shown in the drawings are merely illustrative and do not necessarily include all of the contents and operations/steps, nor do they necessarily have to be performed in the order described. For example, some operations/steps may be decomposed, and some operations/steps may be combined or partially combined, so that the actual execution sequence may be changed according to the actual situation.
In the related technology in the field, a high-priority data acquisition task and a low-priority data acquisition task are sequentially processed according to the priority, so that the high-priority data acquisition task and the low-priority data acquisition task are sequentially processed to avoid mutual conflict caused by simultaneous processing, and the high-priority data acquisition task can be automatically restarted after the high-priority data acquisition task is delayed or failed to ensure the timeliness and the integrity of task processing. A task processing method in the related art is shown in fig. 1, and the specific flow is as follows:
in step S110, a high-priority data acquisition task is started, and the completion time of the high-priority data acquisition task is preset;
in step S120, when the completion time is reached, a low-priority data acquisition task is started;
in the above flow, if the high-priority data acquisition task is delayed or fails to complete, the whole program still needs to be manually executed again according to the priority order by human intervention, and the method cannot ensure the timeliness of task processing.
Based on the problems in the related art, an embodiment of the present disclosure provides an automatic task processing method, where an execution main body of the automatic task processing method may be a terminal device (one or more of a smart phone, a tablet computer, and a portable computer), or may also be a server, and the size of the server is not limited, and may be a single-process service, or may be a large server cluster, which is not specifically limited by the present disclosure. Fig. 2 shows a flow diagram of an automatic task processing method, which, as shown in fig. 2, comprises at least the following steps:
step S210: monitoring the execution state of a first data acquisition task at preset time intervals;
step S220: when the execution state is successful, generating a first identifier corresponding to the first data acquisition task;
step S230: acquiring the calling times of a second data acquisition task, wherein the priority of the first data acquisition task is higher than that of the second data acquisition task;
step S240: and when the calling times meet a preset condition, acquiring the first identifier and starting a second data acquisition task of the first identifier.
On one hand, the automatic task processing method in the embodiment of the disclosure can automatically monitor and control the execution sequence of the first data acquisition task and the second data acquisition task, thereby avoiding that problems are found out untimely in the manual monitoring process and the whole task needs to be manually controlled, and improving the processing efficiency; on the other hand, the system can replace manpower to complete task processing with sequential requirements in an automatic local mode in time and completely, thereby reducing the time for finding problems, reducing the error rate caused by manual control and reducing the labor cost for task processing.
In order to make the technical solution of the present disclosure clearer, each step of the automatic task processing method is explained next.
In step S210, the execution status of the first data acquisition task is monitored at preset time intervals.
In an exemplary embodiment of the present disclosure, the first data acquisition task may be a high priority data acquisition task, and the high priority data acquisition task may be to extract high priority data from a source service system and to pool the high priority data into a data pool for a user to query, analyze and use. Correspondingly, a second data acquisition task exists, wherein the second data acquisition task can be a low-priority data acquisition task, and the low-priority data acquisition task can be used for extracting low-priority data from the source service system and gathering the low-priority data into a data pool for a user to inquire, analyze and use. Specifically, when the attendance data is acquired and processed, the high-priority data may be attendance data of the current day, and the low-priority data may be attendance data of the current day.
In an exemplary embodiment of the present disclosure, listening to the execution status of the first data acquisition task at preset time intervals includes: and acquiring a return value related to the execution state of the first data acquisition task within the preset time interval, and judging the execution state of the first data acquisition task according to the return value. The preset time interval may be set according to actual needs, and specifically refers to a time difference between two monitoring tasks, for example, monitoring a task to be monitored every 20 minutes, where 20 minutes is the preset time interval, and certainly, monitoring every 5 minutes, 10 minutes, and 30 minutes is also possible, which is not specifically limited by the present disclosure. In addition, the execution status of the first data acquisition task may include one or more of successful completion, completion but unsuccessful and ongoing of the data acquisition task, which is not specifically limited by the present disclosure.
In an exemplary embodiment of the present disclosure, the execution state of the first data obtaining task depends on the content specifically executed by the first data obtaining task, and if the first data obtaining task is to process attendance data not on this day, the first data obtaining task may be determined according to a return value of the task program, for example, if the return value is 0, the execution state is in operation; if the return value is 1, the execution state is successful completion; if the return value is 2, the execution status is complete but not successful. In addition, the execution state of the first data acquisition task may also be determined according to the check data amount, which is not specifically limited by the present disclosure.
In step S220, when the execution status is successful, a first identifier corresponding to the first data acquiring task is generated.
In an exemplary embodiment of the present disclosure, after the execution state of the first data acquisition task is determined, different operations are performed according to the execution state of the first data acquisition task. Specifically, if the execution state is in operation, the execution state of the first data acquisition task is monitored continuously until the first data acquisition task is completed successfully; if the execution state is complete but not successful, restarting the first data acquisition task, where restarting the first data acquisition task may include executing the first data acquisition task from the beginning, or may include identifying a node at which the first data acquisition task executed incorrectly, and starting to execute the first data acquisition task again from the node at which the error occurred until the first data acquisition task was successfully completed, which is not specifically limited by the disclosure; and if the execution state is successful, generating a first identifier corresponding to the first data acquisition task. The first identifier may include a task number of the first data obtaining task, and may also include a timestamp corresponding to a time when the first data obtaining task is successfully completed, which is not specifically limited by the present disclosure.
In step S230, the number of calls of a second data obtaining task is obtained, wherein the priority of the first data obtaining task is higher than the priority of the second data obtaining task.
In the exemplary embodiment of the disclosure, since the second data obtaining task is executed according to the own frequency after being started, in order not to interfere with the execution of the second data obtaining task according to the own frequency, before determining whether to start the second data obtaining task, the number of calls of the second data obtaining task needs to be obtained first, and the number of calls may be determined according to whether the identifier corresponding to the second data obtaining task exists. Specifically, whether an identifier corresponding to the second data acquisition task exists is judged, if the identifier does not exist, the calling frequency is judged to be zero, and the second data acquisition task is not called; if the identifier exists, the calling times are judged to be non-zero times, and the second data acquisition task is called. The number of times of calling the second data acquisition task may also be determined according to the number of identifiers corresponding to the acquired second data acquisition task, for example, acquiring an identifier corresponding to the second data acquisition task and determining the number of the identifiers, and if the identifier is not acquired, that is, if the number of the identifiers is zero, determining that the number of times of calling is zero; and if the number of the acquired identifiers is one, judging that the calling times is one. Of course, the number of calls may also be determined according to the number of timestamps corresponding to the identifier, which is not limited in this disclosure.
In step S240, when the number of times of call satisfies a preset condition, the first identifier is acquired, and the second data acquisition task is started.
In an exemplary embodiment of the present disclosure, after obtaining the number of times of invocation of a second data obtaining task, the number of times of invocation of the second data obtaining task is determined, and when the number of times of invocation satisfies a preset condition, the second data obtaining task is started. Wherein the preset condition may be as follows: when the calling times are zero, judging that the second data acquisition task is not started, and starting the second data acquisition task; when the number of times of calling is non-zero, it is determined that the second data acquisition task is started, and the second data acquisition task is executing according to its own frequency, the second data acquisition task may be monitored, but no operation is performed on the execution process of the second data acquisition task, and the monitored task may also be terminated. It should be noted that when the number of calls satisfies a preset condition, a first identifier corresponding to the first data obtaining task needs to be obtained, where the purpose of obtaining the first identifier is to prompt that the second data obtaining task may start to call for the first time.
In an exemplary embodiment of the disclosure, the first identifier may be deleted while the second data acquisition task is started to prevent the first identifier from being acquired again, and the second data acquisition task is restarted to interfere with the execution of the second data acquisition task. In addition, after deleting the first identifier, a second identifier corresponding to the second data obtaining task may be generated, where the second identifier includes a number of the second data obtaining task, and may further include a timestamp when the second data obtaining task is called.
In an exemplary embodiment of the present disclosure, fig. 3 shows a specific flowchart of the automatic task processing method, as shown in fig. 3, in step S310, a first data acquisition task is started; in step S320, monitoring an execution status of the first data acquisition task at a preset time interval; in step S330, determining whether the first data obtaining task is successfully completed according to the execution status; in step S340, when the first data obtaining task is running, jumping to step S320, when the first data obtaining task is completed but not successfully completed, jumping to step S310, and when the first data obtaining task is successfully completed, generating a first identifier corresponding to the first data obtaining task; in step S350, the number of times of calling the second data obtaining task is obtained; in step S360, it is determined whether the number of calls satisfies a preset condition; in step S370, when the number of times of invocation does not satisfy the preset condition, monitoring an execution state of the second data obtaining task; in step S380, when the number of times of call satisfies a preset condition, acquiring a first identifier, and starting the second data acquisition task; in step S390, a second flag corresponding to the second data acquisition task is generated, and the first flag is deleted.
The following describes the automatic task processing method in the exemplary embodiment with reference to the specific scenario shown in fig. 4, taking the example of automatically processing attendance data with different priorities.
In the specific application scenario, the non-daily attendance data has a higher priority, the daily attendance data has a lower priority, and when the attendance data is automatically processed, the non-daily attendance data needs to be imported into the data pool before the non-daily attendance data is imported into the data pool. Fig. 4 is a flowchart illustrating the application of the automatic task processing method to the specific scenario, and as shown in fig. 4, the specific steps of the flowchart are as follows:
in step S410, a non-daily attendance data import task is started;
in the specific application scenario, the non-current-day attendance data import task has a higher priority, the non-current-day attendance data import task needs to be started first, the current-day attendance data import task has a lower priority, and the current-day attendance data import task is kept waiting for starting until the non-current-day attendance data import task is not completed successfully.
In step S420, monitoring the execution state of the non-daily attendance data import task at preset time intervals;
when the non-daily attendance data import task is started, the monitoring task also starts working at the same time, monitors the execution state of the non-daily attendance data import task at preset time intervals, and specifically judges the execution state of the import task according to a return value in a non-daily attendance data import task program.
In step S430, according to the execution state, whether the non-daily attendance data import task is successfully completed is determined;
the return value in the attendance data import task program on the non-current day corresponds to the execution state of the import task, for example, if the return value is 0, the execution state is in operation; if the return value is 1, the execution state is successful completion; if the return value is 2, the execution state is complete but unsuccessful, so as to judge whether the attendance data import task on the non-current day is successfully completed. Of course, other return values may be used for determination, and the disclosure is not limited thereto.
In step S440, when the import of the non-current day attendance data is running, jumping to step S420; when the import of the attendance data on the non-current day is completed but is not successful, jumping to the step S410; after the non-current-day attendance data are successfully imported into the data pool, generating a first identifier corresponding to the non-current-day attendance data import task;
in the specific application scenario, if the attendance data importing task on the non-current day is not successfully completed, the attendance data importing task on the non-current day is restarted or monitored continuously, and if the attendance data importing task on the non-current day is successfully completed, a first identifier corresponding to the attendance data importing task on the non-current day is generated. The first identification comprises a task number corresponding to non-current-day attendance data, and the time stamp when the non-current-day attendance data is successfully imported into the data pool is included.
In step S450, the number of calls corresponding to the work of importing attendance data on the current day is obtained;
in this specific application scenario, in order to prevent the problem that the normal execution of the attendance data import task on the present day is disturbed due to the fact that the attendance data import task on the present day is called for many times, the number of times of calling corresponding to the attendance data import task on the present day is first acquired.
In step S460, determining whether the number of calls satisfies a predetermined condition;
in the specific application scene, judging whether an identifier corresponding to the attendance data import task of the current day exists, if so, judging that the current calling frequency is nonzero, and if not, starting the attendance data import task of the current day and executing the attendance data import task of the current day; if the identification does not exist, the current calling frequency is judged to be zero, the current time is the first time for calling the attendance data import task of the current day, and the attendance data import task of the current day is not started yet.
In step S470, when the number of times of call does not satisfy the preset condition, monitoring an execution state of the attendance data of the current day;
in the specific application scenario, if the current call does not call the attendance data import task of the current day for the first time, the attendance data import task of the current day can be monitored continuously, the monitoring task can also be terminated, and no operation is generated on the execution of the attendance data of the current day, so that the attendance data import task of the current day executes the import task according to the self-set frequency.
In step S480, when the number of times of call satisfies a preset condition, acquiring a first identifier, and starting the attendance data check-in task on the current day;
in the specific application scenario, if the current call is the first call of the attendance data import task of the current day, the first identifier is obtained, and the attendance data import task of the current day is started by taking the first identifier as the indication information.
In step S490, a second flag corresponding to the attendance data import job on the current day is generated, and the first flag is deleted.
In the specific application scenario, after the attendance data import task of the current day is started, a second identifier corresponding to the attendance data import task of the current day is generated, and the second identifier is used for judging the calling times of the attendance data import task of the current day. And deleting the first identifier while generating the second identifier to prevent the first identifier from being acquired again, restarting the attendance data import task of the current day and interfering the execution of the attendance data import task of the current day
The following describes embodiments of the apparatus of the present disclosure, which may be used to perform the automatic task processing method of the present disclosure. For details that are not disclosed in the embodiments of the apparatus of the present disclosure, refer to the embodiments of the monitoring method described above in the present disclosure.
FIG. 5 schematically shows a block diagram of an automated task processing apparatus according to one embodiment of the present disclosure.
Referring to fig. 5, an automatic task processing apparatus 500 according to an embodiment of the present disclosure, the automatic task processing apparatus 500 includes: a monitoring module 501, an identification module 502, an acquisition module 503 and a starting module 504. Specifically, the method comprises the following steps:
a monitoring module 501, configured to monitor an execution state of a first data acquisition task at preset time intervals;
an identification module 502, configured to generate a first identification corresponding to the first data obtaining task when the execution state is successful;
an obtaining module 503, configured to obtain the number of times of invoking a second data obtaining task, where a priority of the first data obtaining task is higher than a priority of the second data obtaining task;
a starting module 504, configured to obtain the first identifier and start the second data obtaining task when the number of times of invocation satisfies a preset condition.
The specific details of each automatic task processing device are already described in detail in the corresponding automatic task processing method, and therefore, the details are not described herein again.
It should be noted that although in the above detailed description several modules or units of the apparatus for performing are mentioned, such a division is not mandatory. Indeed, the features and functionality of two or more modules or units described above may be embodied in one module or unit, according to embodiments of the present disclosure. Conversely, the features and functions of one module or unit described above may be further divided into embodiments by a plurality of modules or units.
In an exemplary embodiment of the present disclosure, an electronic device capable of implementing the above method is also provided.
As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or program product. Thus, various aspects of the invention may be embodied in the form of: an entirely hardware embodiment, an entirely software embodiment (including firmware, microcode, etc.) or an embodiment combining hardware and software aspects that may all generally be referred to herein as a "circuit," module "or" system.
An electronic device 600 according to this embodiment of the invention is described below with reference to fig. 6. The electronic device 600 shown in fig. 6 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.
As shown in fig. 6, the electronic device 600 is embodied in the form of a general purpose computing device. The components of the electronic device 600 may include, but are not limited to: the at least one processing unit 610, the at least one memory unit 620, a bus 630 connecting different system components (including the memory unit 620 and the processing unit 610), and a display unit 640.
Wherein the storage unit stores program code that is executable by the processing unit 610 to cause the processing unit 610 to perform steps according to various exemplary embodiments of the present invention as described in the above section "exemplary methods" of the present specification. For example, the processing unit 610 may execute step S210 as shown in fig. 2, and listen to the execution status of the first data acquisition task at preset time intervals; step S220, when the execution state is successful, generating a first identifier corresponding to the first data acquisition task; step S230, acquiring the number of times of calling a second data acquisition task, wherein the priority of the first data acquisition task is higher than the priority of the second data acquisition task; step S240, when the number of times of calling satisfies a preset condition, acquiring the first identifier, and starting the second data acquisition task.
The storage unit 620 may include readable media in the form of volatile memory units, such as a random access memory unit (RAM)6201 and/or a cache memory unit 6202, and may further include a read-only memory unit (ROM) 6203.
The memory unit 620 may also include a program/utility 6204 having a set (at least one) of program modules 6205, such program modules 6205 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which, or some combination thereof, may comprise an implementation of a network environment.
The electronic device 600 may also communicate with one or more external devices 800 (e.g., keyboard, pointing device, bluetooth device, etc.), with one or more devices that enable a viewer to interact with the electronic device 600, and/or with any devices (e.g., router, modem, etc.) that enable the electronic device 600 to communicate with one or more other computing devices. Such communication may occur via an input/output (I/O) interface 650. Also, the electronic device 600 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network such as the Internet) via the network adapter 660. As shown, the network adapter 660 communicates with the other modules of the electronic device 600 over the bus 630. It should be appreciated that although not shown in the figures, other hardware and/or software modules may be used in conjunction with the electronic device 600, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, among others.
Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which may be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the embodiments of the present disclosure.
In an exemplary embodiment of the present disclosure, there is also provided a computer-readable storage medium having stored thereon a program product capable of implementing the above-described method of the present specification. In some possible embodiments, aspects of the invention may also be implemented in the form of a program product comprising program code means for causing a terminal device to carry out the steps according to various exemplary embodiments of the invention described in the above section "exemplary methods" of the present description, when said program product is run on the terminal device.
Referring to fig. 7, a program product 700 for implementing the above method according to an embodiment of the present invention is described, which may employ a portable compact disc read only memory (CD-ROM) and include program code, and may be run on a terminal device, such as a personal computer. However, the program product of the present invention is not limited in this regard and, in the present document, a 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.
The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A 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 (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, 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.
A computer readable signal medium may include a propagated data signal with 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 readable signal medium may also be any readable medium that is not a 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 readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., through the internet using an internet service provider).
Furthermore, the above-described figures are merely schematic illustrations of processes involved in methods according to exemplary embodiments of the invention, and are not intended to be limiting. It will be readily understood that the processes shown in the above figures are not intended to indicate or limit the chronological order of the processes. In addition, it is also readily understood that these processes may be performed synchronously or asynchronously, e.g., in multiple modules.
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This application is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
It will be understood that the present disclosure is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the present disclosure is to be limited only by the terms of the appended claims.
Claims (10)
1. An automatic task processing method, comprising:
monitoring the execution state of a first data acquisition task at preset time intervals;
when the execution state is successful, generating a first identifier corresponding to the first data acquisition task;
acquiring the calling times of a second data acquisition task, wherein the priority of the first data acquisition task is higher than that of the second data acquisition task;
and when the calling times meet a preset condition, acquiring the first identifier and starting the second data acquisition task.
2. The automated task processing method of claim 1, wherein listening for the execution status of the first data acquisition task at a preset time interval comprises:
and acquiring a return value related to the execution state of the first data acquisition task within the preset time interval, and judging the execution state according to the return value.
3. The automated task processing method according to claim 2, wherein after determining the execution state from the return value, the method further comprises:
and if the execution state is complete but not successful, restarting the first data acquisition task.
4. The automated task processing method according to claim 2, wherein after determining the execution state from the return value, the method further comprises:
and if the execution state is running, continuing to monitor the execution state of the first data acquisition task.
5. The automated task processing method of claim 1, wherein after obtaining the number of calls for the second data obtaining task, the method further comprises:
when the calling times are zero, acquiring the first identifier and starting the second data acquisition task;
and monitoring the second data acquisition task when the calling times are non-zero times.
6. The automated task processing method according to claim 1, further comprising:
and deleting the first identifier and generating a second identifier corresponding to the second data acquisition task while starting the second data acquisition task.
7. The automatic task processing method of claim 1, wherein obtaining the number of calls of the second data obtaining task comprises:
judging whether an identifier corresponding to the second data acquisition task exists or not;
if the second data acquisition task does not exist, judging that the calling frequency of the second data acquisition task is zero;
and if so, judging that the calling times of the second data acquisition task are non-zero times, and acquiring the calling times.
8. An automatic task processing apparatus, comprising:
the monitoring module is used for monitoring the execution state of the first data acquisition task at preset time intervals;
the identification module is used for generating a first identification corresponding to the first data acquisition task when the execution state is successfully completed;
the acquisition module is used for acquiring the calling times of a second data acquisition task, wherein the priority of the first data acquisition task is higher than that of the second data acquisition task;
and the starting module is used for acquiring the first identifier and starting the second data acquisition task when the calling times meet a preset condition.
9. A computer-readable storage medium on which a computer program is stored, the program, when being executed by a processor, implementing an automatic task processing method according to any one of claims 1 to 7.
10. An electronic device, comprising:
one or more processors;
storage means for storing one or more programs which, when executed by the one or more processors, cause the one or more processors to implement the automatic task processing method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911046834.5A CN110807048A (en) | 2019-10-30 | 2019-10-30 | Automatic task processing method and device, computer storage medium and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911046834.5A CN110807048A (en) | 2019-10-30 | 2019-10-30 | Automatic task processing method and device, computer storage medium and electronic equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110807048A true CN110807048A (en) | 2020-02-18 |
Family
ID=69489589
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911046834.5A Pending CN110807048A (en) | 2019-10-30 | 2019-10-30 | Automatic task processing method and device, computer storage medium and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110807048A (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104407848A (en) * | 2014-10-29 | 2015-03-11 | 中国建设银行股份有限公司 | Data processing method and device |
| CN106528275A (en) * | 2015-09-10 | 2017-03-22 | 网易（杭州）网络有限公司 | Processing method of data tasks and task scheduler |
| WO2017114141A1 (en) * | 2015-12-30 | 2017-07-06 | Sengled Optoelectronics Co., Ltd | Distributed task system and service processing method based on internet of things |
-
2019
- 2019-10-30 CN CN201911046834.5A patent/CN110807048A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104407848A (en) * | 2014-10-29 | 2015-03-11 | 中国建设银行股份有限公司 | Data processing method and device |
| CN106528275A (en) * | 2015-09-10 | 2017-03-22 | 网易（杭州）网络有限公司 | Processing method of data tasks and task scheduler |
| WO2017114141A1 (en) * | 2015-12-30 | 2017-07-06 | Sengled Optoelectronics Co., Ltd | Distributed task system and service processing method based on internet of things |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107908494B (en) | Abnormal event processing method and device, electronic equipment and storage medium | |
| US10838838B2 (en) | Method and apparatus for dealing with abnormality of application program and storage medium | |
| CN106802826B (en) | Service processing method and device based on thread pool | |
| CN108804215B (en) | Task processing method and device and electronic equipment | |
| CN107453960B (en) | Method, device and system for processing test data in service test | |
| CN110427252B (en) | Task scheduling method, device and storage medium based on task dependency relationship | |
| US10545807B2 (en) | Method and system for acquiring parameter sets at a preset time interval and matching parameters to obtain a fault scenario type | |
| CN107016480B (en) | Task scheduling method, device and system | |
| CN112200505B (en) | Cross-business system process monitoring device and method, corresponding equipment and storage medium | |
| CN110609755A (en) | Message processing method, device, equipment and medium for cross-block chain node | |
| CN108616668B (en) | Method for monitoring dialing task, electronic device and computer readable storage medium | |
| CN111381940B (en) | Distributed data processing method and device | |
| CN110851324A (en) | Log-based routing inspection processing method and device, electronic equipment and storage medium | |
| WO2020253045A1 (en) | Configured supplementary processing method and device for data of which forwarding has abnormality, and readable storage medium | |
| CN111459629A (en) | Azkaban-based project operation method and device and terminal equipment | |
| CN110881224B (en) | Network long connection method, device, equipment and storage medium | |
| CN113515369B (en) | Data processing method, system, terminal and storage medium | |
| CN108595178B (en) | Hook-based data acquisition method, device and equipment | |
| CN106911784B (en) | Method and device for executing asynchronous event | |
| CN110807048A (en) | Automatic task processing method and device, computer storage medium and electronic equipment | |
| CN110941658A (en) | Data export method, device, server and storage medium | |
| CN113297149A (en) | Method and device for monitoring data processing request | |
| CN112818204A (en) | Service processing method, device, equipment and storage medium | |
| CN105933368A (en) | User behavior data uploading method and device | |
| CN112732728A (en) | Data synchronization method and system |
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 |
Application publication date: 20200218 |
|
| RJ01 | Rejection of invention patent application after publication |