CN116954871A - Asynchronous distribution task data chain management method and system - Google Patents
Asynchronous distribution task data chain management method and system Download PDFInfo
- Publication number
- CN116954871A CN116954871A CN202311211409.3A CN202311211409A CN116954871A CN 116954871 A CN116954871 A CN 116954871A CN 202311211409 A CN202311211409 A CN 202311211409A CN 116954871 A CN116954871 A CN 116954871A
- Authority
- CN
- China
- Prior art keywords
- task
- execution
- subtask
- manager
- data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000007726 management method Methods 0.000 title claims description 21
- 238000000034 method Methods 0.000 claims abstract description 28
- 230000004044 response Effects 0.000 claims description 11
- 238000003745 diagnosis Methods 0.000 abstract description 3
- 230000008569 process Effects 0.000 description 14
- 238000012544 monitoring process Methods 0.000 description 6
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000007547 defect Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000003672 processing method Methods 0.000 description 1
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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/50—Indexing scheme relating to G06F9/50
- G06F2209/5017—Task decomposition
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Debugging And Monitoring (AREA)
Abstract
The application relates to a method and a system for managing an asynchronous distribution task data chain, belonging to the technical field of task distribution, wherein the method comprises the following steps: generating a corresponding task execution plan according to the task characteristics; splitting a task to be executed into a main task and a plurality of subtasks, respectively executing the main task and the tasks according to a task execution plan, acquiring main task execution result data and subtask execution result data, and defining a subtask receipt data structure for the subtask execution result data; and providing subtask receipt data based on the subtask receipt data structure, combining the subtask receipt data with the same task identification by the task manager, and orderly connecting the combined result with the main task execution result in series to generate an asynchronous task execution data chain. The method and the system provided by the application can improve the speed of problem diagnosis by full-link tracking, reduce the cost by using more flexible resources, and solve the problem that task progress cannot be effectively managed by asynchronous task distribution.
Description
Technical Field
The application relates to the technical field of task distribution, in particular to a method and a system for asynchronously distributing task data chain management.
Background
In the prior art, the application which is generally constructed can encounter unpredictable situations such as slow response speed of dependent service, a small amount of requests and large consumption of CPU and memory resources, or sudden traffic peaks, and the like, so that the response of an application system is slow. In order to increase the response speed of the application and to cost less, computing resources are generally reserved in advance, but these resources are idle for most of the time, which undoubtedly increases the cost; it is relatively better to decouple the logic consuming a lot of resources from the main program, and the logic is asynchronously executed by the elastically extensible system, which not only can increase the response speed, but also can save the cost.
In the process of uploading the video or the picture, the process of generating the compressed video or the thumbnail can be asynchronously processed when the video or the picture is successfully uploaded, but if the asynchronous process of generating the compressed video or the thumbnail fails, the page cannot look up the uploaded video or the picture; or when the offline large file is acquired, the processing process of the large file is time-consuming, the processing process is stripped off and is executed asynchronously, and the file content still cannot be effectively acquired due to failure in the processing process of the large file executed asynchronously.
Therefore, the existing asynchronous task processing method strips logic with long time delay and large resource consumption from the main program, reduces service time delay, improves user experience, and is executed asynchronously by an elastically extensible system, so that resources are allocated reasonably, and cost is reduced. However, in the existing asynchronous branch task execution process, although the client can collect the task execution state, the client cannot effectively master the whole flow condition of the asynchronous branch task execution, and under different service scenes, the asynchronous service processing result difference greatly affects complex factors, so that the difficulty is increased for subsequent effective processing.
Disclosure of Invention
The application aims to provide a method and a system for managing an asynchronous distribution task data chain, which are used for solving the defects in the prior art.
The application provides an asynchronous distribution task data chain management method, which comprises the following steps:
the task manager forms a corresponding mark based on the task characteristics and sends the mark to the client, the client uses the mark as a task mark of a task to be executed, a user adopts the client to send the task to be executed with the task mark to the task manager, and the task manager matches the task characteristics based on the received task mark and generates a corresponding task execution plan;
the task manager splits the task to be executed into a main task and a plurality of subtasks, executes the main task according to a task execution plan, acquires execution result data of the main task, sends all the subtasks to the task execution module for asynchronous execution, acquires execution result data of the subtasks, and defines a subtask receipt data structure for the execution result data of the subtasks;
the task execution module is used for providing subtask receipt data to the task manager based on the subtask receipt data structure, the task manager is used for merging the subtask receipt data with the same task identification, and the merging result is orderly connected with the main task in series to generate an asynchronous task execution data chain.
In the above scheme, the task manager receives the task characteristics, first judges whether the task characteristics are successfully registered, and stores the task characteristics in a task registration set in the task manager after judging that the task characteristics are successfully registered.
In the above scheme, the task manager matches the received task identifier with the task characteristics in the task registration set.
In the above-mentioned scheme, the content of the task execution plan includes: task execution step, task distribution policy, subtask execution scope, subtask execution failure policy and main task execution failure policy.
In the above scheme, before the task manager sends each subtask to the task execution module, judging whether a subtask execution start condition is satisfied, where the subtask execution start condition includes: the task execution module finishes the execution of all the subtasks to be executed in the previous step or finishes the execution of at least one subtask in the subtasks to be executed by the task execution module.
In the above scheme, when the execution start condition of the subtask is met, the task manager distributes the subtask to the execution node within the appointed range of the task execution module according to the execution range of the subtask, monitors and acquires the content of the task to be executed through the message middleware of the execution node or monitors and acquires the content of the task to be executed through the interface based on the execution node by calling the interface provided by the subtask, and performs asynchronous execution on each subtask.
In the above scheme, in the process of splitting the task to be executed into a plurality of main tasks and sub-tasks, the task manager sends the task identification of the task to be executed to the main task and each sub-task.
In the above scheme, the task manager performs the following steps according to the judging result of the main task execution and the sub task execution:
when the execution result of the main task and the execution result of the subtask are successful, the task manager marks that the execution result of the main task and each subtask is successful, and judges that the execution corresponding to the task to be executed in the next step can be carried out;
when the subtask execution result is failure, the task manager re-initiates a new execution request to an execution node corresponding to the subtask;
and when the execution result of the main task is failure, the task manager executes the main task again.
In the above scheme, the subtask response piece data includes: task identification of a main task, task identification of a subtask, execution result state of the subtask and execution result description of the subtask.
The application provides an asynchronous distribution task data chain management system, which adopts the asynchronous distribution task data chain management method to form an asynchronous distribution task data chain, and comprises the following steps: the system comprises a client, a task manager and a task execution module, wherein the task manager interacts with the client and the task execution module respectively.
The embodiment of the application has the following advantages:
according to the asynchronous distribution task data chain management method and system provided by the embodiment of the application, the corresponding task execution plan is generated based on the task characteristics obtained through matching, the task to be executed is split into the main task and the plurality of sub-tasks, the main task and the plurality of sub-tasks are respectively executed according to the task execution plan, the sub-task receipt data are acquired, the sub-task receipt data with the same task identification are combined, the combined result and the main task execution result are orderly connected in series, an asynchronous task execution data chain capable of providing task data chain inquiry capability to the outside is generated, and the asynchronous task execution data chain can be executed again when the main task or the sub-task fails to execute, so that the system has better fault tolerance capability, the problem diagnosis speed of full-link tracking and lifting is improved, more flexible use resources are reduced, the problem that the task asynchronous distribution cannot track and control the task execution process is solved, and therefore the asynchronous distribution method has wide application prospect, the management problem in the task asynchronous distribution process can be solved, and the problem diagnosis speed and the resource utilization efficiency are improved.
Drawings
FIG. 1 is a flow chart of a method of asynchronously distributing task data chain management in one embodiment of the application;
FIG. 2 is a schematic diagram of the components of an asynchronous distribution task data chain management system in one embodiment of the application.
Detailed Description
It should be noted that, without conflict, the embodiments of the present application and features of the embodiments may be combined with each other. The application will be described in detail below with reference to the drawings in connection with embodiments.
As shown in fig. 1, the present application provides a method for asynchronously distributing task data chain management, which includes:
step S1: the method comprises the steps that a user registers task characteristics in a task manager through an interface by adopting a client, the task manager receives the task characteristics, firstly judges whether the task characteristics are successfully registered, stores the task characteristics in a task registration set in the task manager after judging that the task characteristics are successfully registered, returns a unique identifier corresponding to the task characteristics to the client through the interface, and sends the unique identifier serving as a task identifier of a task to be executed on the client to the task manager through the interface by adopting the client, the task manager matches the received task identifier with the task characteristics in the task registration set, and a corresponding task execution plan is generated based on the task characteristics obtained through matching.
Specifically, in one embodiment of the present application, the task identifier may be represented as a unique identifier of "8B50028C-6746-4EBA-3364-20697055837C", or may be any non-repeating character, which is merely an example.
Specifically, the task manager matches the characteristics of the task according to the received task identifier, and makes a corresponding execution plan to ensure that the task can be carried out according to expectations and achieve a required execution result, and the contents of the task execution plan include: task execution step, task distribution policy, subtask execution scope, subtask execution failure policy, and main task execution failure policy, so that a complete task execution plan and the like can be formed based on the above.
The sub-task execution starting conditions in the task execution step are divided into at least one task execution completion condition in the tasks executed before the previous step and the sub-task execution completion condition.
The task distribution strategy mainly comprises two types, namely a message middleware of a subtask execution node is called, the execution node monitors and acquires task content from the message middleware, and an interface externally provided by the subtask is called, and the execution node monitors and acquires the task content through the interface.
The subtasks are distributed to the execution nodes according to the designated scope and executed, and the scope is determined by the subtask execution scope designated by the subtasks.
The task execution failure strategy is divided into a subtask failure retry strategy and a main task failure retry strategy according to different task failure main bodies, and specifically, the subtask failure retry strategy is as follows: the subtask is successfully executed, an execution result is sent to a task manager, if the subtask execution result fails, the task manager re-initiates a new execution request to a node with the subtask execution failure according to a strategy, and specifically, the main task failure re-try strategy is as follows: after the sub-tasks are executed according to the strategies, if the execution results of the main tasks fail, the task manager executes the main tasks again according to the strategies.
Step S2: the task manager splits the task to be executed into a main task and a plurality of subtasks according to a task splitting rule, the main task is executed through the task manager, the task manager judges whether the execution starting condition of the subtasks is met, when the execution of all the subtasks to be executed in the previous step is finished by the task execution module or at least one of the subtasks to be executed by the task execution module is finished, the task manager distributes the subtasks to an execution node in a designated range of the task execution module according to a subtask execution range, monitors and acquires the content of the task to be executed through a message middleware of the execution node or monitors and acquires the content of the task to be executed through an interface provided by the subtask, performs asynchronous execution on each subtask based on the content of the task to be executed through the interface, and after the execution of each subtask is finished, receives the subtask execution result data sent by the task execution module through the task manager, reports the main task execution result data and the subtask execution result data to the client, and defines a subtask response piece data structure of the received subtask execution result data.
Specifically, in the process of splitting the task to be executed into a plurality of main tasks and sub-tasks, the task manager sends the task identification of the task to be executed to the main task and each sub-task, so as to ensure that the main task and each sub-task correspond to the same task identification.
Specifically, in performing each sub-task, the sub-tasks may be performed by one or more task execution modules.
Step S3: the task execution module provides subtask receipt data based on a subtask receipt data structure defined by a task manager and sends the subtask receipt data to the task manager, the subtask receipt data with the same task identification is combined, the combined result and a main task execution result are orderly connected in series, a complete asynchronous task execution data chain is generated, the asynchronous task execution data chain provides task data chain inquiry capability outwards, the task receipt data comprises a task identification of the main task, a task identification of the subtask, a subtask execution result state and a subtask execution result description, therefore, the subtask receipt data structure can ensure that each main task execution result data and the subtask execution result data can be combined into a task execution real-time result, the task execution real-time result is an asynchronous task execution data chain, the task execution progress can be provided for a task party to inquire the execution progress of a certain task in real time, a user can adopt a client to inquire the execution progress of the task to be executed uploaded by the client through the task identification, and the task manager sends the real-time progress of the task to be executed to the client.
Specifically, if the execution result of the main task and the execution result of the subtask are successful, the task execution module sends the execution result state of each subtask in the subtask receipt data to the task manager, the user can adopt the asynchronous task which is queried by the client through the interface to execute the state of the main task and each subtask on the data chain, the task manager marks the execution result of the main task and each subtask as successful, and the task manager judges that the execution corresponding to the next task to be executed can be carried out; if the subtask execution result is failure, the task execution module sends the subtask execution result state to the task manager, wherein the subtask execution result state in the subtask receipt data sent by the task manager is failure, the user can adopt the state of the subtask on an asynchronous task execution data chain queried by the client through an interface to be failure, and the task manager re-initiates a new execution request to an execution node corresponding to the subtask; if the execution result of the main task is failure, the user can adopt the state of the main task on the asynchronous task execution data chain queried by the client through the interface to be failure, and the task manager executes the main task again.
As shown in fig. 2, the application provides an asynchronous distribution task data chain management system, which comprises a client, a task manager and a task execution module, wherein the task manager interacts with the task execution module respectively, the execution plan content can be flexibly modified and the capacity of the task manager can be flexibly expanded in the whole interaction process, and the task manager comprises a storage unit, a calculation unit, a configuration unit and a monitoring unit, and the storage unit, the calculation unit, the configuration unit and the monitoring unit independently operate, so that the high availability of services is ensured.
Specifically, a user adopts a client to register task characteristics in a task manager through an interface, receives a unique identifier corresponding to the task characteristics generated by the task manager, uses the unique identifier as a task identifier of a task to be executed on the client, sends the task to be executed with the task identifier to the task manager, receives main task execution result data and sub task execution result data sent by the task manager, and inquires the execution progress of the task to be executed uploaded by the user through the task identifier.
The task manager is used for receiving task characteristics, firstly judging whether the task characteristics are successfully registered, after judging that the task characteristics are successfully registered, storing the task characteristics in a task registration set in the task manager, returning unique identifiers corresponding to the task characteristics to the client through an interface, receiving a task to be executed, which is sent by the client and provided with the task identifiers, by a user, matching the received task identifiers with the task characteristics in the task registration set, generating a corresponding task execution plan based on the task characteristics obtained through matching, splitting the task to be executed into a main task and a plurality of subtasks, executing the main task, distributing the subtasks to a task execution module according to the subtask execution range when judging that the subtask execution starting conditions are met, sending subtask execution result data by the task execution module after the task execution module completes execution of each subtask, reporting the main task execution result data and the subtask execution result data to the client, defining a subtask response piece data structure of the received subtask execution result data, merging the subtask response piece data with the same task identifiers, and carrying out main response piece data and merging the subtask response piece data with the same task identification, and carrying out complete serial connection with the task execution result data, and generating asynchronous task execution complete serial connection data.
Specifically, the storage unit in the task manager is used for storing the data sent by the client and the task manager; the computing unit in the task manager is used for defining a subtask receipt data structure of the received subtask execution result data, combining the subtask receipt data with the same task identification, orderly connecting the combined result with the main task in series, and generating a complete asynchronous task execution data chain; the configuration unit in the task manager is used for matching the received task identification with the task characteristics in the task registration set, generating a corresponding task execution plan based on the task characteristics obtained through matching, and the monitoring unit in the task manager is used for monitoring the execution results of the main task and the plurality of subtasks on the generated asynchronous task execution data chain.
The task execution module is used for monitoring and acquiring the content of a task to be executed through a message middleware of an execution node or calling an interface externally provided by a subtask, asynchronously executing each subtask based on the content of the task to be executed acquired through the interface monitoring by the execution node, transmitting the execution result data of the subtask to a task manager after the execution of each subtask is completed, providing subtask receipt data based on a subtask receipt data structure defined by the task manager, and transmitting the subtask receipt data to the task manager.
It should be noted that the foregoing detailed description is exemplary and is intended to provide further explanation of the application. Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs.
It is noted that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of exemplary embodiments according to the present application. As used herein, the singular is intended to include the plural unless the context clearly indicates otherwise. Furthermore, it will be further understood that the terms "comprises" and/or "comprising," when used in this specification, specify the presence of stated features, steps, operations, devices, components, and/or groups thereof.
It should be noted that the terms "first," "second," and the like in the description and the claims of the present application and the above figures are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the terms so used are interchangeable under appropriate circumstances such that the embodiments of the application described herein are capable of operation in sequences other than those illustrated or otherwise described herein.
Furthermore, the terms "comprise" and "have," as well as any variations thereof, are intended to cover a non-exclusive inclusion. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those elements but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
Spatially relative terms, such as "above … …," "above … …," "upper surface at … …," "above," and the like, may be used herein for ease of description to describe one device or feature's spatial location relative to another device or feature as illustrated in the figures. It will be understood that the spatially relative terms are intended to encompass different orientations in use or operation in addition to the orientation depicted in the figures. For example, if the device in the figures is turned over, elements described as "above" or "over" other devices or structures would then be oriented "below" or "beneath" the other devices or structures. Thus, the exemplary term "above … …" may include both orientations of "above … …" and "below … …". The device may also be positioned in other different ways, such as rotated 90 degrees or at other orientations, and the spatially relative descriptors used herein interpreted accordingly.
In the above detailed description, reference is made to the accompanying drawings, which form a part hereof. In the drawings, like numerals typically identify like components unless context indicates otherwise. The illustrated embodiments described in the detailed description, drawings, and claims are not meant to be limiting. Other embodiments may be utilized, and other changes may be made, without departing from the spirit or scope of the subject matter presented herein.
The above description is only of the preferred embodiments of the present application and is not intended to limit the present application, but various modifications and variations can be made to the present application by those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the protection scope of the present application.
Claims (10)
1. A method for asynchronously distributing task data chains, the method comprising:
the task manager forms a corresponding mark based on the task characteristics and sends the mark to the client, the client uses the mark as a task mark of a task to be executed, a user adopts the client to send the task to be executed with the task mark to the task manager, and the task manager matches the task characteristics based on the received task mark and generates a corresponding task execution plan;
the task manager splits the task to be executed into a main task and a plurality of subtasks, executes the main task according to a task execution plan, acquires execution result data of the main task, sends all the subtasks to the task execution module for asynchronous execution, acquires execution result data of the subtasks, and defines a subtask receipt data structure for the execution result data of the subtasks;
the task execution module is used for providing subtask receipt data for the task manager based on the subtask receipt data structure, the task manager is used for merging the subtask receipt data with the same task identification, and the merging result and the main task execution result are orderly connected in series to generate an asynchronous task execution data chain.
2. The method for managing an asynchronous distribution task data chain according to claim 1, wherein the task manager receives the task characteristics, first judges whether the task characteristics are successfully registered, and after the task characteristics are judged to be successfully registered, stores the task characteristics in a task registration set in the task manager.
3. The asynchronous distribution task data chain management method according to claim 2, wherein the task manager matches the received task identification with task characteristics in the task registration set.
4. The asynchronous distribution task data link management method according to claim 1, wherein the contents of the task execution plan include: task execution step, task distribution policy, subtask execution scope, subtask execution failure policy and main task execution failure policy.
5. The asynchronous distribution task data chain management method according to claim 1, wherein before the task manager sends each sub-task to the task execution module, determining whether a sub-task execution start condition is satisfied, the sub-task execution start condition comprising: the task execution module finishes the execution of all the subtasks to be executed in the previous step or finishes the execution of at least one subtask in the subtasks to be executed by the task execution module.
6. The asynchronous distribution task data link management method according to claim 5, wherein when a subtask execution start condition is satisfied, the task manager distributes the subtasks to execution nodes within a task execution module designated range according to the subtask execution range, monitors and acquires contents of the tasks to be executed through message middleware of the execution nodes or monitors and acquires the contents of the tasks to be executed through interfaces based on the execution nodes by calling interfaces provided externally by the subtasks, and performs asynchronous execution on each subtask.
7. The asynchronous distribution task data chain management method according to claim 1, wherein the task manager distributes task identifications of the tasks to be executed to the main task and each of the sub-tasks in splitting the tasks to be executed into a plurality of main tasks and sub-tasks.
8. The asynchronous distribution task data link management method according to claim 1, wherein the task manager performs the following steps according to judging a main task execution result and a sub task execution result:
when the execution result of the main task and the execution result of the subtask are successful, the task manager marks that the execution result of the main task and each subtask is successful, and judges that the execution corresponding to the task to be executed in the next step can be carried out;
when the subtask execution result is failure, the task manager re-initiates a new execution request to an execution node corresponding to the subtask;
and when the execution result of the main task is failure, the task manager executes the main task again.
9. The asynchronous distribution task data chain management method according to claim 1, wherein the subtask response piece data includes: task identification of a main task, task identification of a subtask, execution result state of the subtask and execution result description of the subtask.
10. An asynchronous distribution task data chain management system, which forms an asynchronous distribution task data chain by using the asynchronous distribution task data chain management method according to any one of claims 1 to 9, wherein the system comprises: the system comprises a client, a task manager and a task execution module, wherein the task manager interacts with the client and the task execution module respectively.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311211409.3A CN116954871B (en) | 2023-09-20 | 2023-09-20 | Asynchronous distribution task data chain management method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311211409.3A CN116954871B (en) | 2023-09-20 | 2023-09-20 | Asynchronous distribution task data chain management method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116954871A true CN116954871A (en) | 2023-10-27 |
| CN116954871B CN116954871B (en) | 2024-02-27 |
Family
ID=88442870
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311211409.3A Active CN116954871B (en) | 2023-09-20 | 2023-09-20 | Asynchronous distribution task data chain management method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116954871B (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6148323A (en) * | 1995-12-29 | 2000-11-14 | Hewlett-Packard Company | System and method for managing the execution of system management |
| CN110472876A (en) * | 2019-08-19 | 2019-11-19 | 北京首都在线科技股份有限公司 | A kind of method for scheduling task, device and computer readable storage medium |
| CN110908793A (en) * | 2019-09-30 | 2020-03-24 | 北京辰森世纪科技股份有限公司 | Long-time task execution method, device, equipment and readable storage medium |
| CN113010306A (en) * | 2021-02-24 | 2021-06-22 | 金蝶软件（中国）有限公司 | Service data processing method and device, computer equipment and storage medium |
| CN113962229A (en) * | 2021-09-27 | 2022-01-21 | 北京百度网讯科技有限公司 | Asynchronous translation system, method, apparatus and storage medium |
| CN115373820A (en) * | 2022-08-26 | 2022-11-22 | 中银金融科技有限公司 | Asynchronous task execution method, device, equipment and storage medium |
| CN115437754A (en) * | 2021-06-01 | 2022-12-06 | 深圳市口袋网络科技有限公司 | Task distribution method, device, equipment and computer readable storage medium |
| CN115629951A (en) * | 2022-12-20 | 2023-01-20 | 北京蔚领时代科技有限公司 | Task full-link tracking method, first node, link system and medium |
| CN116382844A (en) * | 2023-03-10 | 2023-07-04 | 天翼云科技有限公司 | Dynamic control method and system for distributed storage multi-asynchronous task |
| US11714732B1 (en) * | 2020-09-30 | 2023-08-01 | Amazon Technologies, Inc. | Granular tracking of replication consistency using subsets of asynchronous replication tasks |
-
2023
- 2023-09-20 CN CN202311211409.3A patent/CN116954871B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6148323A (en) * | 1995-12-29 | 2000-11-14 | Hewlett-Packard Company | System and method for managing the execution of system management |
| CN110472876A (en) * | 2019-08-19 | 2019-11-19 | 北京首都在线科技股份有限公司 | A kind of method for scheduling task, device and computer readable storage medium |
| CN110908793A (en) * | 2019-09-30 | 2020-03-24 | 北京辰森世纪科技股份有限公司 | Long-time task execution method, device, equipment and readable storage medium |
| US11714732B1 (en) * | 2020-09-30 | 2023-08-01 | Amazon Technologies, Inc. | Granular tracking of replication consistency using subsets of asynchronous replication tasks |
| CN113010306A (en) * | 2021-02-24 | 2021-06-22 | 金蝶软件（中国）有限公司 | Service data processing method and device, computer equipment and storage medium |
| CN115437754A (en) * | 2021-06-01 | 2022-12-06 | 深圳市口袋网络科技有限公司 | Task distribution method, device, equipment and computer readable storage medium |
| CN113962229A (en) * | 2021-09-27 | 2022-01-21 | 北京百度网讯科技有限公司 | Asynchronous translation system, method, apparatus and storage medium |
| CN115373820A (en) * | 2022-08-26 | 2022-11-22 | 中银金融科技有限公司 | Asynchronous task execution method, device, equipment and storage medium |
| CN115629951A (en) * | 2022-12-20 | 2023-01-20 | 北京蔚领时代科技有限公司 | Task full-link tracking method, first node, link system and medium |
| CN116382844A (en) * | 2023-03-10 | 2023-07-04 | 天翼云科技有限公司 | Dynamic control method and system for distributed storage multi-asynchronous task |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116954871B (en) | 2024-02-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3522013B1 (en) | Method and system for migration of containers in a container orchestration platform between compute nodes | |
| CN115328663B (en) | Method, device, equipment and storage medium for scheduling resources based on PaaS platform | |
| CN108958920A (en) | A kind of distributed task dispatching method and system | |
| CN108829512B (en) | Cloud center hardware accelerated computing power distribution method and system and cloud center | |
| CN111858054B (en) | Resource scheduling system and method based on edge computing in heterogeneous environment | |
| CA2533737A1 (en) | Fast application notification in a clustered computing system | |
| CN108737560A (en) | Cloud computing task intelligent dispatching method and system, readable storage medium storing program for executing, terminal | |
| CN102385536B (en) | Method and system for realization of parallel computing | |
| CN110958311A (en) | YARN-based shared cluster elastic expansion system and method | |
| US20030135617A1 (en) | Intelligent system control agent | |
| WO2022141727A1 (en) | Resource deployment system and method based on cloud cost | |
| CN109117244B (en) | Method for implementing virtual machine resource application queuing mechanism | |
| CN108228274B (en) | Method for realizing airborne distributed task dynamic allocation and dynamic construction technology | |
| CN111124640A (en) | Task allocation method and system, storage medium and electronic device | |
| CN109587024B (en) | Resource processing method and related device | |
| CN113434283B (en) | Service scheduling method and device, server and computer readable storage medium | |
| CN105260244A (en) | Task scheduling method and device for distributed system | |
| US10785102B2 (en) | Modifying distributed application based on cloud diagnostic data | |
| CN116954871B (en) | Asynchronous distribution task data chain management method and system | |
| CN111240824A (en) | CPU resource scheduling method and electronic equipment | |
| CN111049900B (en) | Internet of things flow calculation scheduling method and device and electronic equipment | |
| CN110134533B (en) | System and method capable of scheduling data in batches | |
| CN112231223A (en) | Distributed automatic software testing method and system based on MQTT | |
| CN115964152A (en) | GPU resource scheduling method, equipment and storage medium | |
| CN109634749B (en) | Distributed unified scheduling method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |