High speed processing system and method based on dynamic redundancy

Abstract

The application provides a high-speed processing system and method based on dynamic redundancy, comprising a routing system, a processor cluster and a coordination center; the processor cluster comprises a main processor and multiple backup processors; wherein: the routing system is used for receiving data sent by an upstream subsystem and forwarding the received data to each processor in the processor cluster; the coordination center is used for recording the task processing progress of each processor in the processor cluster; each processor in the processor cluster is used for independently processing a task after loading the data required for processing into the memory, and sending the task processing result of each processor to a downstream subsystem by the main processor and sequentially writing the task processing result into a file by the backup processor after the task processing is completed; and the coordination center is further used for promoting the backup processor to the main processor when the main processor fails. Thus, the system robustness can be improved and the system data consistency can be ensured.

Description

Technical Field

[0001] This invention relates to the field of information processing technology, and more specifically, to a high-speed processing system and method based on dynamic redundancy. Background Technology

[0002] Large-scale application systems are often composed of multiple different subsystems. Each subsystem receives the output of the upstream system as input and sends the processed result to the downstream system for further processing. Its structure is as follows: Figure 1 As shown.

[0003] When a subsystem processes tasks, it needs to rely on external systems to jointly process input requests. The subsystem's state data is typically persisted through a database. To accelerate system response, some frequently accessed data is loaded into a cache to improve system processing performance. Additionally, it may access file storage devices to persist large datasets such as images and documents.

[0004] However, under high concurrency, such systems rely on network or I / O interfaces to access external components, resulting in significant network / system overhead. When the external system fails, it can indirectly cause the main system to crash, reducing its stability and reliability. Summary of the Invention

[0005] In view of the deficiencies in the prior art, the purpose of this invention is to provide a high-speed processing system and method based on dynamic redundancy.

[0006] In a first aspect, embodiments of this application provide a high-speed processing system based on dynamic redundancy, comprising: a routing system, a processor cluster, and a coordination center; the processor cluster includes a main processor and multiple backup processors; wherein:

[0007] The routing system is used to receive data sent by the upstream subsystem and forward the received data to each processor in the processor cluster;

[0008] The coordination center is used to record the task processing progress of each processor in the processor cluster;

[0009] Each processor in the processor cluster is used to independently process tasks after loading the data required for processing into memory. After the task processing is completed, the main processor sends the task processing results of each processor to the downstream subsystem, and the backup processor writes the task processing results sequentially into a file.

[0010] The coordination center is also used to promote a backup processor to the main processor when the main processor fails.

[0011] Optionally, the routing system is further configured to, upon receiving a request from an upstream subsystem, increment the task processing number and forward the request from the upstream subsystem to each processor in the processor cluster.

[0012] Optionally, when a backup processor is promoted to the primary processor, if the task processing progress X1 of the original primary processor is less than the task processing progress X2 of the new primary processor, a task compensation process is executed for tasks with task processing numbers between (X1, X2); where:

[0013] The task compensation process includes: replaying requests that failed to be executed, carrying a unique task processing number during replay, and having the backup processor query the processing result file based on the task processing number and send the historical processing results to the downstream subsystem.

[0014] If the task processing progress X1 of the original main processor is greater than the task processing progress X2 of the new main processor, the new main processor will handle the tasks with task processing numbers between (X2, X1) locally, without sending messages to the coordination center or sending the processing results to downstream subsystems.

[0015] Optionally, the routing system is also used to provide an interface for querying the task processing number based on the request information. When the upstream subsystem replays a request that failed to be executed, it queries the corresponding task processing number from the routing system based on the request information and carries the corresponding task processing number when replaying the request.

[0016] The routing system is also used to randomly route a request carrying a task processing number to a backup processor upon receiving the request.

[0017] Optionally, the backup processor is also configured to periodically map all state data in memory, as well as the task processing number corresponding to the state, to disk for persistence.

[0018] Optionally, the backup processor is further configured to periodically synchronize the task processing results to the coordination center in a batch processing manner; wherein, each processor in the processor cluster independently uses a queue mode to receive and cache external requests, and sequentially retrieves and consumes messages from the queue.

[0019] Optionally, the main processor is further configured to send the result of whether the task was successfully processed to the coordination center after the task is completed, and to execute the next action after receiving feedback from the coordination center.

[0020] The backup processor is also used to write the input request from the routing system, the task processing number, and the complete response to the task to a file after the task processing is completed.

[0021] Optionally, the coordination center is also used to select the backup processor with the fastest task processing progress as the main processor after the main processor fails.

[0022] Optionally, the coordination center is further configured to, when adding a standby processor to the processor cluster, select the standby processor with the fastest current processing progress as the target processor, obtain the full state data persisted by the target processor, and the corresponding task processing number X3; load the full state data from the target processor by the newly added standby processor, and receive and cache requests from the routing system by the newly added standby processor, recording the starting number of the cached task as X4; synchronize the processing result file from the target processor by the newly added standby processor, and sequentially parse the task processing number and the input request corresponding to the task processing number in the processing result file, and stop the synchronization from the target processor after obtaining all requests between the numbers (X3, X4).

[0023] Secondly, embodiments of this application provide a high-speed processing method based on dynamic redundancy, which uses the high-speed processing system based on dynamic redundancy as described in the first aspect to coordinate the processing of tasks distributed by the upstream subsystem through the routing system and send the task processing results to the downstream subsystem.

[0024] Thirdly, embodiments of this application provide a high-speed processing device based on dynamic redundancy, comprising: a processor and a memory, wherein the memory stores executable program instructions, and when the processor invokes the program instructions in the memory, the processor is used to:

[0025] Perform the steps of the high-speed processing method based on dynamic redundancy as described in any one of the second aspects.

[0026] Fourthly, embodiments of this application provide a computer-readable storage medium for storing a program, which, when executed, implements the steps of the high-speed processing method based on dynamic redundancy as described in any one of the second aspects.

[0027] Compared with the prior art, the present invention has the following beneficial effects:

[0028] This application constructs a high-speed processing system comprising a routing system, a processor cluster, and a coordination center. The processor cluster includes a master processor and multiple backup processors. The routing system is responsible for uniformly receiving and forwarding data from upstream subsystems. The coordination center records the task processing progress of each processor. Upon receiving a request from an upstream subsystem, the routing system increments the task processing number and routes the request to all processors. Each processor loads all the necessary data into memory and processes requests independently, allowing the processing program to directly read and operate on data in memory. This avoids system bottlenecks caused by frequent external overhead and improves the system's concurrent processing performance. By managing all system-dependent data uniformly in memory, without relying on external nodes or services, system processing will not fail due to the unavailability of external services, improving the overall robustness of the system. The master processor sends the task processing results to downstream subsystems, and the backup processors sequentially write the task processing results to files. In the event of a master processor failure, the coordination center promotes a backup processor to master, achieving seamless failover. This ensures seamless switching to backup processor nodes after a master processor failure, guaranteeing system data consistency. In this embodiment, the backup processor and the main processor execute the same business logic, ensuring that the data states of the main processor and the backup processor are consistent; the routing system assigns a processing number to each request, which can ensure that the processing order of all processors is consistent, thereby ensuring that the final data states of all processors are consistent; by recording the actual processing progress of each processor through the coordination center, it can be ensured that the request will only be processed once on a single processor, and there will be no problems caused by repeated processing; thus, the robustness of the system can be improved and the system data consistency can be ensured. Attached Figure Description

[0029] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are merely embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on the provided drawings without creative effort. Other features, objects, and advantages of the present invention will become more apparent by reading the following detailed description of non-limiting embodiments with reference to the accompanying drawings:

[0030] Figure 1 This is a schematic diagram of the structure of an existing large-scale application system;

[0031] Figure 2 A schematic diagram of the structure of a high-speed processing system based on dynamic redundancy provided in an embodiment of this application;

[0032] Figure 3 This is a schematic diagram of the main task processing flow provided in the embodiments of this application;

[0033] Figure 4 This is a schematic diagram of the task compensation process provided in an embodiment of this application;

[0034] Figure 5 This is a schematic diagram of the switching process provided in an embodiment of this application;

[0035] Figure 6 This is a schematic diagram illustrating the process of adding a backup processor as provided in an embodiment of this application. Detailed Implementation

[0036] To make the objectives, technical solutions, and advantages of the embodiments of this application clearer, the technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0037] It should be noted that when a component is said to be "fixed" to another component, it can be directly on the other component or it can be in a middle component. When a component is said to be "connected" to another component, it can be directly connected to the other component or it may be in a middle component.

[0038] Unless otherwise defined, 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. The terminology used herein in the specification of this application is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. The term "and / or" as used herein includes any and all combinations of one or more of the associated listed items.

[0039] The terms “first,” “second,” “third,” “fourth,” etc. (if present) in the specification, claims, and accompanying drawings of this invention are used to distinguish similar objects and are not necessarily used to describe a particular order or sequence. It should be understood that such data can be interchanged where appropriate so that embodiments of the invention described herein can be implemented, for example, in orders other than those illustrated or described herein. Furthermore, the terms “comprising” and “having,” and any variations thereof, are intended to cover a non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.

[0040] The technical solutions of the present invention and how they solve the above-mentioned technical problems are described in detail below with specific embodiments. These specific embodiments can be combined with each other, and the same or similar concepts or processes may not be described again in some embodiments.

[0041] The following detailed description of some embodiments of this application is provided in conjunction with the accompanying drawings. Unless otherwise specified, the following embodiments and features can be combined with each other.

[0042] For example, Figure 2 This is a schematic diagram of the structure of a high-speed processing system based on dynamic redundancy provided in an embodiment of this application, as shown below. Figure 2 As shown, the system may include a routing system, a processor cluster, and a coordination center. The processor cluster includes a master processor and multiple backup processors (e.g., backup processor 1, backup processor 2, ..., backup processor N). The routing system receives data from upstream subsystems and forwards the received data to each processor (master processor and backup processors) in the processor cluster. The coordination center records the task processing progress of each processor in the processor cluster. Each processor in the processor cluster independently processes tasks after loading the required data into memory. After task processing is completed, the master processor sends the task processing results to downstream subsystems, and the backup processors sequentially write the task processing results to files. The coordination center also promotes a backup processor to master processor when the master processor fails.

[0043] In this embodiment, after receiving a request from an upstream subsystem, the routing system increments the task processing number and routes the request to all processors. Each processor loads all the data required for processing into memory, and the processing program directly reads the data in memory for operation, avoiding system bottlenecks caused by frequent external overhead. Each processor processes the request independently. The primary processor sends the task processing results to the downstream subsystem, and the backup processors sequentially write the task processing results to files. If the primary processor fails, the coordination center promotes a backup processor to the primary processor. The new primary processor can seamlessly switch based on the task processing progress and the recorded files, ensuring system data consistency.

[0044] For example, the routing system is further configured to, upon receiving a request from an upstream subsystem, increment the task processing number and forward the request from the upstream subsystem to each processor in the processor cluster.

[0045] For example, when a backup processor is promoted to the primary processor, if the task processing progress X1 of the original primary processor is less than the task processing progress X2 of the new primary processor, a task compensation process is executed for tasks with task processing numbers between (X1, X2). The task compensation process includes: replaying requests that failed to execute, carrying a unique task processing number during replay; the backup processor then queries the processing result file based on the task processing number and sends the historical processing results to the downstream subsystem. If the task processing progress X1 of the original primary processor is greater than the task processing progress X2 of the new primary processor, the new primary processor locally processes tasks with task processing numbers between (X2, X1), without sending messages to the coordination center or sending the processing results to the downstream subsystem.

[0046] For example, the routing system is further configured to provide an interface for querying the task processing number based on the request information. When the upstream subsystem replays a request that failed to execute, it queries the corresponding task processing number from the routing system based on the request information and carries the corresponding task processing number when replaying the request. The routing system is also configured to randomly route the request to a backup processor after receiving a request carrying the task processing number.

[0047] For example, the backup processor is also used to periodically map the full amount of state data in memory, as well as the task processing number corresponding to the state, to the disk for persistence.

[0048] For example, the backup processor is further configured to periodically synchronize the task processing results to the coordination center in a batch processing manner; wherein, each processor in the processor cluster independently uses a queue mode to receive and cache external requests, and sequentially retrieves and consumes messages from the queue.

[0049] For example, the main processor is further configured to send the result of whether the task was successfully processed to the coordination center after the task is completed, and to perform the next action after receiving feedback from the coordination center; the backup processor is further configured to write the input request of the routing system, the task processing number, and the complete response to the task to a file after the task is completed.

[0050] For example, the coordination center is also used to select the backup processor with the fastest task processing progress as the main processor after the main processor fails.

[0051] For example, the coordination center is further configured to, when adding a standby processor to the processor cluster, select the standby processor with the fastest current processing progress as the target processor, obtain the full state data persisted by the target processor, and the corresponding task processing number X3; load the full state data in the target processor by the newly added standby processor, and receive and cache requests from the routing system by the newly added standby processor, and record the starting number of the cached task as X4; synchronize the processing result file from the target processor by the newly added standby processor, and parse the task processing number and the input request corresponding to the task processing number in the processing result file in sequence, and stop the synchronization from the target processor after obtaining all requests between the numbers (X3, X4).

[0052] For example, embodiments of this application also provide a high-speed processing method based on dynamic redundancy, applied as follows: Figure 2 The high-speed processing system based on dynamic redundancy shown coordinates the processing of tasks distributed by the upstream subsystem through the routing system and sends the task processing results to the downstream subsystem.

[0053] In this embodiment, the system interacts with data according to the following conventions:

[0054] 1) A processor cluster designates one processor as the master processor. After processing a request, the master processor routes it to the downstream subsystem.

[0055] 2) Each processor independently uses queue mode to receive and cache external requests, retrieves messages from the queue sequentially, and consumes them.

[0056] 3) When the routing system forwards a request to the processor, it will add a task processing number field, which is an integer and increments sequentially.

[0057] For example, such as Figure 3 As shown, the main task processing flow mainly includes the following steps:

[0058] Step S11: The routing system receives a request from the upstream subsystem.

[0059] Step S12: The routing system generates an incremental and unique task processing number X and routes the received request to all processors.

[0060] Step S13: Each processor processes the request independently. After the main processor completes the task processing, it sends the result of whether task X was successfully processed to the coordination center (it only needs to mark whether X was successfully processed, and does not need to send the actual processing result message; the purpose is to mark the current task progress of the main processor). After receiving feedback from the coordination center, it proceeds to the next step.

[0061] Step S14: The main processor sends the processing result to the downstream subsystem.

[0062] Step S15: The standby processor sequentially writes the task processing results to file Y. The results include the input task request from the routing system, the task processing number, and the complete response to the task. (The system's response speed is only related to the main processor; the standby processor's writing of the file does not affect the overall system's response speed.)

[0063] Step S16: The backup processor uses batch processing to periodically synchronize the processing results to the coordination center.

[0064] For example, the backup processor's periodic process mainly includes the following steps:

[0065] The backup processor periodically maps all state data in memory, along with the task processing number corresponding to that state, to disk for persistence.

[0066] For example, the task compensation process may include the following steps:

[0067] After the main processor sends the task processing progress to the coordination center, it may fail to send the message to the downstream subsystems due to network jitter, instability of the downstream subsystems, or processor switching issues. In this case, a task compensation process needs to be executed. For example... Figure 4 As shown, the task compensation process includes the following steps:

[0068] Step S21: Replay requests that failed to execute, carrying a unique task processing number X during replay. During replay, the upstream subsystem detects that its corresponding business data was not processed correctly. Based on the specific request information, the upstream subsystem can find the corresponding task processing number through the routing system (the routing system can obtain this number from the data recorded by the backup processor). The routing system provides query capabilities; the upstream subsystem can query the task processing number corresponding to the input request and then replay the data.

[0069] Step S22: After receiving a request carrying a task number, the routing system randomly routes the request to a backup processor.

[0070] Step S23: The backup processor queries the processing result file Y according to the task processing number X and sends the historical processing results to the downstream subsystem.

[0071] For example, the main processor failover process may include the following steps:

[0072] If the primary processor fails, the backup processor needs to be promoted to primary to ensure system availability. This includes, for example... Figure 5 As shown, the main steps of the switching process are as follows:

[0073] Step S31: Select the standby processor with the fastest task processing progress from the coordination center as the main processor C_new.

[0074] Step S32: Assume that the task processing progress of the original main processor C_old is denoted as X1, and the local task processing progress of the new main processor is denoted as X2.

[0075] Step S33: When X1 > X2:

[0076] Step S331: C_new locally processes tasks with task processing numbers between (X2, X1], without sending any messages to the coordination center and without sending the processing results to the downstream subsystem.

[0077] Step S332: For tasks received with numbers greater than X1, process them according to the main task process. Tasks with numbers greater than X1 start to be processed sequentially after Step S331 is completed.

[0078] Step S34: When X1 < X2:

[0079] Step S341: Mark the task progress of the current C_new processor as X2 in the coordination center.

[0080] Step S342: C_new executes a compensation process for tasks between (X1, X2].

[0081] Step S343: For tasks received with numbers greater than X2, process them according to the main task process.

[0082] Exemplarily, over time, due to reasons such as a standby processor being promoted to the main processor or a standby processor failing and going offline, new standby processors need to be added to ensure that the number of standby processors remains at the specified level. Among them, as Figure 6 shown, the processing steps for adding standby processors are as follows:

[0083] Step S41: Select the standby processor D with the fastest current processing progress, and obtain the full amount of persistent state data of D and the corresponding task processing number X3.

[0084] Step S42: The newly added standby processor E loads the full amount of state data in D.

[0085] Step S43: The newly added standby processor E goes online to receive and cache requests from the routing system, and the starting number of the cached tasks is denoted as X4.

[0086] Step S44: Synchronize the processing result file Y from the standby processor D, and sequentially parse the task numbers and the input requests corresponding to the task numbers therein. After obtaining all requests between the numbers (X3, X4), stop synchronizing from the processor D.

[0087] Step S45: The newly added standby processor E executes the tasks numbered (X3, X4) in sequence.

[0088] Step S46: Add a backup processor E to process the tasks starting from number X4 in sequence.

[0089] The methods described in the above embodiments enable the backup processor to execute the same business logic as the main processor, ensuring data consistency between the main and backup processors. The routing system assigns a processing number to each request, guaranteeing consistent processing order across all processors and ensuring consistent final data states. By recording the actual processing progress of each processor through a coordination center, it ensures that each request is processed only once on a single processor, preventing issues caused by duplicate processing. By loading all the data required for system processing into memory, the processing program directly reads and operates on the data in memory, avoiding system bottlenecks caused by frequent external overhead and improving system concurrent processing performance. Since the system's dependent data is uniformly managed in memory and does not depend on external nodes or services, system processing will not fail due to the unavailability of external services, improving the overall robustness of the system.

[0090] In this embodiment, a multi-processor redundancy deployment mode is adopted. All processors process data independently based on the same algorithm. After the main processor fails, it can seamlessly switch to the backup processor node to ensure system data consistency.

[0091] Furthermore, this application embodiment also provides a high-speed processing device based on dynamic redundancy, including: a processor and a memory, wherein the memory stores executable program instructions, and when the processor calls the program instructions in the memory, the processor is used to: execute the steps of the above-described high-speed processing method based on dynamic redundancy.

[0092] Fourthly, embodiments of this application provide a computer-readable storage medium for storing a program, which, when executed, implements the steps of the high-speed processing method based on dynamic redundancy described above.

[0093] It should be noted that those skilled in the art will understand that various aspects of the present invention can be implemented as systems, methods, or program products. Therefore, various aspects of the present invention can be specifically implemented in the following forms: a completely hardware implementation, a completely software implementation (including firmware, microcode, etc.), or a combination of hardware and software implementations, collectively referred to herein as a "circuit," "module," or "platform."

[0094] Furthermore, embodiments of this application also provide a computer-readable storage medium storing computer-executable instructions. When at least one processor of a user device executes these computer-executable instructions, the user device performs the various possible methods described above. The computer-readable medium includes a computer storage medium and a communication medium, wherein the communication medium includes any medium that facilitates the transfer of a computer program from one location to another. The storage medium can be any available medium accessible to a general-purpose or special-purpose computer. An exemplary storage medium is coupled to a processor, enabling the processor to read information from and write information to the storage medium. Of course, the storage medium can also be a component of the processor. The processor and storage medium can reside in an ASIC. Additionally, the ASIC can reside in the user device. Alternatively, the processor and storage medium can exist as discrete components in a communication device.

[0095] This application also provides a program product including a computer program stored in a readable storage medium. At least one processor of the server can read the computer program from the readable storage medium, and the at least one processor executes the computer program to cause the server to implement any of the methods described in the embodiments of the present invention.

[0096] The program product may employ any combination of one or more readable media. A 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 electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples (a non-exhaustive list) of readable storage media include: electrical connections having one or more wires, portable disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof.

[0097] The specific embodiments of the present invention have been described above. It should be understood that the present invention is not limited to the specific embodiments described above, and those skilled in the art can make various modifications or variations within the scope of the claims, which do not affect the essence of the present invention.

Claims

1. A high-speed processing system based on dynamic redundancy, characterized in that, include: The system includes a routing system, a processor cluster, and a coordination center; the processor cluster comprises a main processor and multiple backup processors; wherein: The routing system is used to receive data sent by the upstream subsystem and forward the received data to each processor in the processor cluster; after receiving a request from the upstream subsystem, it increments the task processing number and forwards the request from the upstream subsystem to each processor in the processor cluster. The coordination center is used to record the task processing progress of each processor in the processor cluster; Each processor in the processor cluster is used to independently process tasks after loading the data required for processing into memory. After the task processing is completed, the main processor sends the task processing results of each processor to the downstream subsystem, and the backup processor sequentially writes the task processing results into a file. Each processor loads all the data required for processing into the file, and the processing program directly reads the data in memory for operation. The coordination center is also used to promote the backup processor to the main processor when the main processor fails; when the backup processor is promoted to the main processor, if the task processing progress X1 of the original main processor is less than the task processing progress X2 of the new main processor, a task compensation process is executed for the tasks with task processing numbers between (X1, X2).

2. The high-speed processing system based on dynamic redundancy according to claim 1, characterized in that, The task compensation process includes: replaying requests that failed to be executed, carrying a unique task processing number during replay, and having the backup processor query the processing result file based on the task processing number and send the historical processing results to the downstream subsystem. If the task processing progress X1 of the original main processor is greater than the task processing progress X2 of the new main processor, the new main processor will handle the tasks with task processing numbers between (X2, X1) locally, without sending messages to the coordination center or sending the processing results to downstream subsystems.

3. The high-speed processing system based on dynamic redundancy according to claim 2, characterized in that, The routing system is also used to provide an interface for querying the task processing number based on the request information. When the upstream subsystem replays a request that failed to be executed, it queries the corresponding task processing number from the routing system based on the request information and carries the corresponding task processing number when replaying the request. The routing system is also used to randomly route a request carrying a task processing number to a backup processor upon receiving the request.

4. The high-speed processing system based on dynamic redundancy according to any one of claims 1-3, characterized in that, The backup processor is also used to periodically map all the state data in memory, as well as the task processing number corresponding to the state, to the disk for persistence.

5. The high-speed processing system based on dynamic redundancy according to any one of claims 1-3, characterized in that, The backup processor is also used to periodically synchronize the task processing results to the coordination center in a batch processing manner; wherein, each processor in the processor cluster independently uses a queue mode to receive and cache external requests, and sequentially retrieves and consumes messages from the queue.

6. The high-speed processing system based on dynamic redundancy according to any one of claims 1-3, characterized in that, The main processor is also used to send the result of whether the task was successfully processed to the coordination center after the task is completed, and to execute the next action after receiving feedback from the coordination center. The backup processor is also used to write the input request from the routing system, the task processing number, and the complete response to the task to a file after the task processing is completed.

7. The high-speed processing system based on dynamic redundancy according to any one of claims 1-3, characterized in that, The coordination center is also used to select the backup processor with the fastest task processing progress as the main processor after the main processor fails.

8. The high-speed processing system based on dynamic redundancy according to any one of claims 1-3, characterized in that, The coordination center is also used to select the backup processor with the fastest current processing progress as the target processor when adding a backup processor in the processor cluster, obtain the full state data of the target processor that is persisted, and the corresponding task processing number X3; load the full state data of the target processor by the newly added backup processor, and receive and cache requests from the routing system by the newly added backup processor, and record the starting number of the cached task as X4. The newly added standby processor synchronously processes the result file from the target processor, and sequentially parses the task processing number and the input request corresponding to the task processing number in the result file. After obtaining all requests between the numbers (X3, X4), the synchronization from the target processor is stopped.

9. A high-speed processing method based on dynamic redundancy, characterized in that, The high-speed processing system based on dynamic redundancy as described in any one of claims 1-8 is used to coordinate the processing of tasks distributed by the upstream subsystem through the routing system and to send the task processing results to the downstream subsystem.

Images