CN112199168A - Task processing method, device and system and task state interaction method - Google Patents

Task processing method, device and system and task state interaction method Download PDF

Info

Publication number
CN112199168A
CN112199168A CN201910610327.3A CN201910610327A CN112199168A CN 112199168 A CN112199168 A CN 112199168A CN 201910610327 A CN201910610327 A CN 201910610327A CN 112199168 A CN112199168 A CN 112199168A
Authority
CN
China
Prior art keywords
subtask
task
state
node
processing
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
Application number
CN201910610327.3A
Other languages
Chinese (zh)
Inventor
秦隆
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Alibaba Group Holding Ltd
Original Assignee
Alibaba Group Holding Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Alibaba Group Holding Ltd filed Critical Alibaba Group Holding Ltd
Priority to CN201910610327.3A priority Critical patent/CN112199168A/en
Publication of CN112199168A publication Critical patent/CN112199168A/en
Pending legal-status Critical Current

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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/30—Monitoring
    • G06F11/3003—Monitoring arrangements specially adapted to the computing system or computing system component being monitored
    • G06F11/3017—Monitoring arrangements specially adapted to the computing system or computing system component being monitored where the computing system is implementing multitasking

Abstract

The application discloses a task processing method, a device and a system and a task state interaction method, wherein the task processing method comprises the following steps: acquiring a received task number of a first task to be executed, and splitting the first task into at least two subtasks; acquiring subtask numbers of subtasks included in the received first task; and acquiring and recording the state of each subtask according to the subtask number, and updating the state of the first task according to the state of the subtask. Through the method and the device, the task execution efficiency is improved, and the success rate of task execution is guaranteed.

Description

Task processing method, device and system and task state interaction method
Technical Field
The present application relates to, but not limited to, computer technology, and in particular, to a task processing method, device, and system, and a task state interaction method.
Background
The process of performing an operation on a resource or a batch of resources is referred to as a task. Tasks are submitted externally and processed in the system, which is often time consuming. The tasks are independent, and no relationship exists between the tasks, so that the tasks are not suitable for processing the next task after one task is processed.
For a scenario where there are bulk tasks for resource operations, for example, creating a resource in bulk, i.e., a received task, includes: create resource 1, create resource 2.. create resource n, here, the task that creates resource 1 is called subtask 1, the task that creates resource 2 is called subtask 2.. the task that creates resource n is called subtask n, that is, the task is naturally divided into subtasks corresponding to different resources according to the different resources of the batch task batch processing. One of task processing methods in the related art is a serial execution method, i.e., a resource and a resource are created, and obviously, the task processing method can cause a task operation time to be too long; alternatively, the creation of resources is performed in parallel, but this approach is not transparent to user operations and the task processing state cannot be conveniently monitored, i.e., the state of the resource creation process is not transparent to the user. The states may include, for example, a pending state, an in-process state, a successful process state, a failed process state, a terminated state, and the like, where the pending state and the in-process state are unstable states and transition to other states along with task processing, and the successful process state, the failed process state, and the terminated state are stable states, and the states do not change any more without external participation.
In view of the task processing method provided by the related art, it is either inefficient, or the user cannot know how much of the operation on the resource is successful and how much of the operation is failed due to the opacity of the task state, so that the task cannot be retried, that is, the success rate of the task execution is not guaranteed.
Disclosure of Invention
The application provides a task processing method, a task processing device, a task processing system and a task state interaction method, which can improve task execution efficiency and ensure the success rate of task execution.
The embodiment of the invention provides a task processing method, which comprises the following steps:
acquiring a task number of a received first task to be executed, and splitting the first task into at least two subtasks;
acquiring subtask numbers of subtasks included in the received first task;
and acquiring and recording the state of each subtask according to the subtask number, and updating the state of the first task according to the state of the subtask.
In one illustrative example, the method further comprises:
and controlling the processing of the subtasks, and in the processing process of the subtasks, when the processing time of the subtasks exceeds the preset processing time, ending the execution of the subtasks and marking the state of the subtasks as a failure state.
In one illustrative example, the method further comprises:
and returning to the step of controlling the processing of the subtask for the subtask of which the completion time state of the subtask is the failure state.
In one illustrative example, the method further comprises:
and judging that the subtask with the state of failure when the subtask is completed is a subtask with the characteristic of unreleasable entry, and marking the state of the subtask as termination.
In one illustrative example, the control subtask processing includes:
the concurrent execution of the subtasks is realized by controlling multiple processes or multiple threads; alternatively, the first and second electrodes may be,
the concurrent execution of the subtasks is achieved by a distributed system.
In an exemplary embodiment, the obtaining and recording the state of each subtask according to the subtask number includes:
and inquiring the state of the subtask at regular time according to the subtask number according to a preset inquiry period, and recording the obtained real-time state of the subtask.
In an exemplary embodiment, the obtaining and recording the state of each subtask according to the subtask number includes:
and receiving the reported state of the subtask, and recording the obtained real-time state of the subtask according to the subtask number.
In an exemplary instance, the updating the state of the first task according to the state of the subtask includes:
and when the states of all the subtasks included in the first task are in a stable state, marking the state of the first task as a completion state or a partial failure state.
The application also provides a computer-readable storage medium storing computer-executable instructions for performing any one of the above task processing methods.
The application further provides a device for realizing task processing, which comprises a memory and a processor, wherein the memory stores the following instructions which can be executed by the processor: for performing the steps of the task processing method of any of the above.
The present application further provides a task processing system, including: the system comprises a first node and a plurality of second nodes connected with the first node; wherein the content of the first and second substances,
the first node is used for acquiring a received task number of a first task and splitting the first task into at least two subtasks; acquiring subtask numbers of subtasks included in the received first task; issuing each subtask included in the first task to the second node; in the subtask processing process, acquiring and recording the state of each subtask according to the subtask number, and updating the state of the first task according to the state of the subtask;
the second node is used for processing the received subtasks; during the processing of the subtasks, the status of the subtasks is provided.
In one illustrative example, the system further comprises: a third node;
and the third node is used for acquiring the state of the first task and/or the subtask through a human-computer interaction interface by using the task number and/or the subtask number.
In one illustrative example, the first node is further configured to:
when the subtask processing is issued, starting a timer with the timing duration being the preset processing duration, and when the timer is overtime, if the state of the subtask cannot reach the stable state, sending an instruction for ending the execution of the subtask to a second node where the subtask is located, and marking the state of the subtask as a failure state; accordingly, the number of the first and second electrodes,
the second node is further configured to: and receiving an instruction for finishing the execution of the subtask from the first node, and finishing the execution of the subtask.
In one illustrative example, the first node is further configured to: and reinitiating the processing for the subtask of which the completion time state of the subtask is the failure state.
In one illustrative example, the first node is further configured to: and judging that the subtask with the state of failure when the subtask is completed is a subtask with the characteristic of unreleasable entry, and marking the state of the subtask as termination.
In an exemplary embodiment, in the process of processing the subtasks in the first node, acquiring and recording the states of the subtasks according to the subtask numbers, including:
inquiring the state of the subtask to the second node at regular time according to the subtask number according to a preset inquiry period, and recording the obtained real-time state of the subtask; or receiving the state of the subtask reported by the second node, and recording the obtained real-time state of the subtask according to the subtask number.
In one illustrative example, providing the status of the subtask during processing of the subtask in the second node includes:
receiving an inquiry request for inquiring the state of the subtask from the first node, and returning the current state of the subtask to the first node; or when the status of the subtask changes or a preset reporting period comes, reporting the current execution status of the subtask to the first node through a reporting message.
The application further provides a task state interaction method, which includes:
receiving a request of a user for executing a first task, and allocating a task number to the first task; acquiring the subtask number and the corresponding task state of each subtask included in the first task;
and inquiring and displaying the state of the first task according to the serial number of the first task, wherein the state of the first task is determined by the state of the corresponding subtask.
In one illustrative example, the first task comprises: starting, stopping, creating and releasing the instance.
In one illustrative example, the state of the task includes: create, start, stop, restart, release.
The present application provides a method comprising: acquiring a received task number of a first task to be executed, and splitting the first task into at least two subtasks; acquiring subtask numbers of subtasks included in the received first task; and acquiring and recording the state of each subtask according to the subtask number, and updating the state of the first task according to the state of the subtask. Through the method and the device, the task execution efficiency is improved, and the success rate of task execution is guaranteed.
Additional features and advantages of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. The objectives and other advantages of the invention will be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.
Drawings
The accompanying drawings are included to provide a further understanding of the claimed subject matter and are incorporated in and constitute a part of this specification, illustrate embodiments of the subject matter and together with the description serve to explain the principles of the subject matter and not to limit the subject matter.
FIG. 1 is a flow chart of an embodiment of a task processing method of the present application;
FIG. 2 is a block diagram of a task processing system according to an embodiment of the present invention.
Detailed Description
To make the objects, technical solutions and advantages of the present application more apparent, embodiments of the present application will be described in detail below with reference to the accompanying drawings. It should be noted that the embodiments and features of the embodiments in the present application may be arbitrarily combined with each other without conflict.
In one exemplary configuration of the present application, a computing device includes one or more processors (CPUs), input/output interfaces, a network interface, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, computer readable media does not include non-transitory computer readable media (transient media), such as modulated data signals and carrier waves.
The steps illustrated in the flow charts of the figures may be performed in a computer system such as a set of computer-executable instructions. Also, while a logical order is shown in the flow diagrams, in some cases, the steps shown or described may be performed in an order different than here.
Fig. 1 is a flowchart of an embodiment of a task processing method of the present application, as shown in fig. 1, including:
step 100: the method comprises the steps of obtaining a received task number of a first task to be executed, and splitting the first task into at least two subtasks.
In one illustrative example, obtaining the first task number may include:
a task number corresponding to the first task can be preset; alternatively, when the first task is received, a task number corresponding to the first task may be generated according to a preset rule.
The task numbers are unique for different tasks, as long as different tasks can be distinguished. Such as: for task a, the task number may be a; for task B, the task number may be B, and so on.
Step 101: and acquiring the subtask number of each subtask included in the received first task.
In an exemplary embodiment, obtaining the subtask number may include:
the subtask numbers of the subtasks can be preset; alternatively, the subtask number of each subtask may be generated when the first task is received according to a preset rule.
For different subtasks, the subtask numbers are unique, so long as different subtasks belonging to a certain task can be distinguished. Such as: for task A, the task number may be A, task A includes subtask 1, subtask 2 … subtask n, then the subtask representation for subtask 1 may be A1, the subtask representation for subtask 2 may be An of the subtask representation for A2 … subtask n, and so on.
The task (namely the first task) and the subtasks included in the task are numbered, so that a search basis is provided for monitoring the subsequent task execution process.
Step 102: and acquiring and recording the state of each subtask according to the subtask number, and updating the state of the first task according to the task state of the subtask.
In one illustrative example, step 102 is preceded by: and controlling the sub-task processing, and recording the state of the received first task as being processed.
In one illustrative example, concurrent execution of subtasks may be achieved by controlling multiple processes or multiple threads.
In one illustrative example, concurrent execution of subtasks may be achieved through a distributed system. Such as: in the distributed system, a node (which may be referred to as a first node or a control node) serving as management control issues a subtask to a plurality of nodes (which may be referred to as second nodes or computing nodes) performing task processing, and the computing nodes perform parallel execution on the subtask.
In one illustrative example, the state of the first task is associated with a task number of the first task. Therefore, the real-time state of the first task can be conveniently obtained according to the task number.
In the step, the concurrent processing of the subtasks included in the first task improves the task execution efficiency.
In an exemplary embodiment, the obtaining and recording the state of each subtask according to the subtask number in this step may include:
and inquiring the state of the subtask at regular time according to the subtask number according to a preset inquiry period, and recording the obtained real-time state of the subtask.
For example, in an example of implementing concurrent execution of subtasks through a distributed system, a control node sends an inquiry request to a computing node according to a preset period, and the computing node feeds back a current state of a subtask corresponding to the inquiry request to the control node through, for example, an inquiry response. It should be noted that, for different subtasks, the same query period may be used, or different query periods may be used.
In an exemplary embodiment, the obtaining and recording the state of each subtask according to the subtask number in this step may include:
and receiving the reported state of the subtask, and recording the obtained real-time state of the subtask according to the subtask number.
For example, in an example of implementing concurrent execution of subtasks by using a distributed system, a computing node may report a current execution state of a subtask to a control node through a report message when a status of the subtask changes or a preset report period comes.
In an exemplary embodiment, the updating the state of the first task according to the state of the subtask in this step may include:
when the states of all the subtasks included in the first task are in a stable state, such as a completion state or a failure state, the state of the first task is marked as a completion state or a partial failure state.
In one illustrative example, the state of a subtask is associated with a subtask number of the subtask. Therefore, the real-time state of the subtask can be conveniently obtained according to the subtask number.
In this step, since the task state is transparent, the user knows how many times the operation on the resource is successful and how many times the operation is failed, and clearly knows how to retry the task, thereby ensuring the success rate of task execution.
In summary, the task processing method improves the task execution efficiency and ensures the success rate of task execution.
In the task processing method of the present application, numbers are generated for the first task and each subtask included in the task, and in the processing process of the first task, the real-time execution states of the task and each subtask are recorded, so the present application may further include:
by using the task number and/or the subtask number, the state of the task and/or the subtask can be easily obtained through the human-computer interaction interface. In other words, the task processing method is transparent to user operation, and convenient monitoring of the task processing state is achieved.
In an exemplary embodiment, the task processing method of the present application further includes:
in the process of processing the subtasks, if the preset processing time length is reached, the subtasks do not reach the stable state yet, that is, the processing time length of the subtasks exceeds the preset processing time length of the task type corresponding to the subtasks (each subtask has the maximum processing upper limit time length), then the execution of the subtasks is forcibly ended, and the state of the subtasks is marked as the failure state.
For example, in an example of implementing concurrent execution of subtasks by a distributed system, when a control node issues a subtask for parallel processing, a timer with a timing duration being a preset processing duration is started, and when the timer times out, the state of the subtask cannot reach a stable state such as a completion state or a failure state, then the control node may send an instruction for ending execution of the subtask to a computing node where the subtask is located, so as to forcibly end execution of the subtask, and mark the state of the subtask as a failure state.
It should be noted that the preset processing time lengths corresponding to different subtasks may be the same or different.
The task processing method further comprises the following steps:
and restarting concurrent processing for the subtask with the status of failure when the subtask is completed, and starting to continue executing the task processing method from the process of marking the status of the task as processing in the step 101.
The task processing method further comprises the following steps:
and if the subtask of which the completion state is the failure state is judged to be the subtask with the characteristic of unreleasable entry, marking the state of the subtask as the termination. In this way, such subtasks are not retried, saving unnecessary attempts and thus resources. The business characteristics of each subtask determine whether the subtask has the characteristics of being non-flushable. Such as: if the subtask fails due to some condition, the condition that the subtask cannot be retried (i.e. whether the subtask can be re-entered) is determined according to the current state of the resource, and if the user has a payment behavior, the failed subtask is set to be terminated so as to prevent the subtask from being started accidentally.
The present application also provides a computer-readable storage medium storing computer-executable instructions for performing any of the above task processing methods.
The present application further provides an apparatus for implementing task processing, including a memory and a processor, where the memory stores the following instructions executable by the processor: for performing the steps of the task processing method of any of the above.
The application also provides a task state interaction method, which at least comprises the following steps:
receiving a request of a user for executing a first task, and allocating a task number to the first task; acquiring the subtask number and the corresponding state of each subtask included in the first task;
and inquiring and displaying the state of the first task according to the serial number of the first task, wherein the state of the first task is determined by the state of the corresponding subtask.
In one illustrative example, the first task includes, but is not limited to: starting, stopping, creating and releasing the instance.
In one illustrative example, the state of the task includes, but is not limited to: create, start, stop, restart, release.
Fig. 2 is a schematic diagram of a composition architecture of an embodiment of a task processing system of the present application, as shown in fig. 2, which at least includes a first node and a plurality of second nodes connected to the first node; wherein the content of the first and second substances,
the first node is used for acquiring a received task number of a first task and splitting the first task into at least two subtasks; acquiring subtask numbers of subtasks included in the received first task; issuing each subtask included in the first task to the second node; in the subtask processing process, acquiring and recording the state of each subtask according to the subtask number, and updating the state of the first task according to the state of the subtask;
the second node is used for processing the received subtasks; during the processing of the subtasks, the status of the subtasks is provided.
The first node and the plurality of second nodes form a distributed system. The number of second nodes is related to the number of subtasks, such as: the number of second nodes is related to the task load of the second nodes, and if the resources such as computation required by a single subtask are high, more second nodes are required to share the processing pressure. Meanwhile, if the number of split tasks is too large, more nodes are needed to process the split tasks. For a real system, looking at the integrated system load, a high load is shared with more machines (i.e., a greater number of second nodes).
In an exemplary embodiment, in the process of processing the subtasks in the first node, acquiring the state of each subtask according to the subtask number and record, includes:
inquiring the state of the subtask from the second node at regular time according to the subtask number according to a preset inquiry period, and recording the obtained real-time state of the subtask; or receiving the state of the subtask reported by the second node, and recording the obtained real-time state of the subtask according to the subtask number.
In one illustrative example, providing the status of the subtask during processing of the subtask in the second node includes:
receiving an inquiry request for inquiring the state of the subtask from the first node, and returning the current state of the subtask to the first node; or when the status of the subtask changes or a preset reporting period comes, reporting the current execution status of the subtask to the first node through a reporting message.
The task processing system improves task execution efficiency and ensures the success rate of task execution.
In one illustrative example, the first node is further configured to:
when the subtask is issued for processing, starting a timer with the timing duration being the preset processing duration, when the timer is overtime, sending an instruction for finishing the execution of the subtask to a second node where the subtask is located, wherein the state of the subtask cannot reach a stable state such as a finished state or a failure state, and marking the state of the subtask as the failure state; accordingly, the number of the first and second electrodes,
the second node is further configured to: and receiving an instruction for ending the execution of the subtask from the first node, and forcibly ending the execution of the subtask.
In one illustrative example, the first node is further configured to: and re-initiating concurrent processing for the subtask whose state is the failure state when the task is completed.
In one illustrative example, the first node is further configured to: and if the subtask with the state of failure at the completion is judged to be a subtask with the characteristic of unreleasable entry, marking the state of the task with the completion state of partial failure as the termination.
In one illustrative example, the task processing system shown in FIG. 2 further includes: a third node;
and the third node is used for easily acquiring the states of the tasks and/or the subtasks through a human-computer interaction interface by utilizing the task numbers and/or the subtask numbers. That is to say, the task processing system of the application realizes convenient monitoring of the task processing state.
It should be noted that the third node may be the same node as the first node; the third node may also be an independent node which is convenient for the user to monitor, for example, a device arranged in the monitoring machine room, in which case, only the first node reports the state of the task and/or the subtask to the third node in real time. How to report can be realized in many ways, and the specific implementation is not used to limit the scope of the present application. It is emphasized here that with the implementation provided by the embodiments of the present application, the operation is transparent to the user, and convenient monitoring of the task processing state is achieved.
Although the embodiments disclosed in the present application are described above, the descriptions are only for the convenience of understanding the present application, and are not intended to limit the present application. It will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the disclosure as defined by the appended claims.

Claims (20)

1. A method of task processing, comprising:
acquiring a task number of a received first task to be executed, and splitting the first task into at least two subtasks;
acquiring subtask numbers of subtasks included in the received first task;
and acquiring and recording the state of each subtask according to the subtask number, and updating the state of the first task according to the state of the subtask.
2. The task processing method of claim 1, the method further comprising:
and controlling the processing of the subtasks, and in the processing process of the subtasks, when the processing time of the subtasks exceeds the preset processing time, ending the execution of the subtasks and marking the state of the subtasks as a failure state.
3. The task processing method of claim 2, the method further comprising:
and returning to the step of controlling the processing of the subtask for the subtask of which the completion time state of the subtask is the failure state.
4. The task processing method of claim 2, the method further comprising:
and judging that the subtask with the state of failure when the subtask is completed is a subtask with the characteristic of unreleasable entry, and marking the state of the subtask as termination.
5. The task processing method according to any one of claims 2 to 4, wherein the controlling of the subtask processing includes:
the concurrent execution of the subtasks is realized by controlling multiple processes or multiple threads; alternatively, the first and second electrodes may be,
the concurrent execution of the subtasks is achieved by a distributed system.
6. The task processing method according to any one of claims 1 to 4, wherein the acquiring and recording the state of each subtask according to the subtask number includes:
and inquiring the state of the subtask at regular time according to the subtask number according to a preset inquiry period, and recording the obtained real-time state of the subtask.
7. The task processing method according to any one of claims 1 to 4, wherein the acquiring and recording the state of each subtask according to the subtask number includes:
and receiving the reported state of the subtask, and recording the obtained real-time state of the subtask according to the subtask number.
8. The task processing method according to any one of claims 1 to 4, wherein the updating the state of the first task according to the state of the subtask comprises:
and when the states of all the subtasks included in the first task are in a stable state, marking the state of the first task as a completion state or a partial failure state.
9. A computer-readable storage medium storing computer-executable instructions for performing the task processing method of any one of claims 1 to 8.
10. An apparatus for implementing task processing, comprising a memory and a processor, wherein the memory has stored therein the following instructions executable by the processor: steps for performing the task processing method of any one of claims 1 to 8.
11. A task processing system comprising: the system comprises a first node and a plurality of second nodes connected with the first node; wherein the content of the first and second substances,
the first node is used for acquiring a received task number of a first task and splitting the first task into at least two subtasks; acquiring subtask numbers of subtasks included in the received first task; issuing each subtask included in the first task to the second node; in the subtask processing process, acquiring and recording the state of each subtask according to the subtask number, and updating the state of the first task according to the state of the subtask;
the second node is used for processing the received subtasks; during the processing of the subtasks, the status of the subtasks is provided.
12. The task processing system of claim 11, the system further comprising: a third node;
and the third node is used for acquiring the state of the first task and/or the subtask through a human-computer interaction interface by using the task number and/or the subtask number.
13. The task processing system of claim 11 or 12, the first node further to:
when the subtask processing is issued, starting a timer with the timing duration being the preset processing duration, and when the timer is overtime, if the state of the subtask cannot reach the stable state, sending an instruction for ending the execution of the subtask to a second node where the subtask is located, and marking the state of the subtask as a failure state; accordingly, the number of the first and second electrodes,
the second node is further configured to: and receiving an instruction for finishing the execution of the subtask from the first node, and finishing the execution of the subtask.
14. The task processing system of claim 11 or 12, the first node further to: and reinitiating the processing for the subtask of which the completion time state of the subtask is the failure state.
15. The task processing system of claim 11 or 12, the first node further to: and judging that the subtask with the state of failure when the subtask is completed is a subtask with the characteristic of unreleasable entry, and marking the state of the subtask as termination.
16. The task processing system according to claim 11 or 12, wherein, in the process of processing the subtasks in the first node, acquiring and recording the state of each subtask according to the subtask number includes:
inquiring the state of the subtask to the second node at regular time according to the subtask number according to a preset inquiry period, and recording the obtained real-time state of the subtask; or receiving the state of the subtask reported by the second node, and recording the obtained real-time state of the subtask according to the subtask number.
17. The task processing system according to claim 11 or 12, wherein providing the state of the subtask during processing of the subtask in the second node comprises:
receiving an inquiry request for inquiring the state of the subtask from the first node, and returning the current state of the subtask to the first node; or when the status of the subtask changes or a preset reporting period comes, reporting the current execution status of the subtask to the first node through a reporting message.
18. A task state interaction method comprises the following steps:
receiving a request of a user for executing a first task, and allocating a task number to the first task; acquiring the subtask number and the corresponding task state of each subtask included in the first task;
and inquiring and displaying the state of the first task according to the serial number of the first task, wherein the state of the first task is determined by the state of the corresponding subtask.
19. The task state interaction method of claim 18, wherein the first task comprises: starting, stopping, creating and releasing the instance.
20. The task state interaction method of claim 18, wherein the state of the task comprises: create, start, stop, restart, release.
CN201910610327.3A 2019-07-08 2019-07-08 Task processing method, device and system and task state interaction method Pending CN112199168A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910610327.3A CN112199168A (en) 2019-07-08 2019-07-08 Task processing method, device and system and task state interaction method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910610327.3A CN112199168A (en) 2019-07-08 2019-07-08 Task processing method, device and system and task state interaction method

Publications (1)

Publication Number Publication Date
CN112199168A true CN112199168A (en) 2021-01-08

Family

ID=74004551

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910610327.3A Pending CN112199168A (en) 2019-07-08 2019-07-08 Task processing method, device and system and task state interaction method

Country Status (1)

Country Link
CN (1) CN112199168A (en)

Similar Documents

Publication Publication Date Title
US20180218058A1 (en) Data synchronization method and system
CN108984652B (en) Configurable data cleaning system and method
CN104601696A (en) Service processing method and service invoking frame, device and architecture
CN107016016B (en) Data processing method and device
CN110471754B (en) Data display method, device, equipment and storage medium in job scheduling
CN106649000B (en) Fault recovery method of real-time processing engine and corresponding server
CN111309548A (en) Timeout monitoring method and device and computer readable storage medium
CN109697112B (en) Distributed intensive one-stop operating system and implementation method
CN108829498B (en) Service data access method and device
CN110968406B (en) Method, device, storage medium and processor for processing task
CN109684051B (en) Method and system for asynchronously submitting hybrid big data task
CN116842298A (en) Data read-write management method and device, storage medium and electronic equipment
CN112199168A (en) Task processing method, device and system and task state interaction method
US20230393782A1 (en) Io request pipeline processing device, method and system, and storage medium
CN114327835A (en) Distributed task scheduling method and device, processor and electronic equipment
CN114201284A (en) Timed task management method and system
CN114579303A (en) Industrial Internet service data processing method, equipment and medium
CN114327259A (en) Flash memory channel controller operation method, device, equipment and storage medium
CN108255820B (en) Method and device for data storage in distributed system and electronic equipment
CN110618863A (en) Operation scheduling method based on Raft algorithm
CN111857538A (en) Data processing method, device and storage medium
EP3933582B1 (en) Distributed storage method and device, electronic apparatus and computer-readable medium
CN110908821A (en) Method, device, equipment and storage medium for task failure management
CN110597603A (en) Scheduling method and system of distributed scheduling tasks
CN115576969B (en) Method, device, medium and equipment for executing database tasks in parallel

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