Data aggregation isochronous synchronization method and system applied to distributed system

Through the data convergence isochronous synchronization method, the clock deviation and network delay compensation technology are used to improve the synchronization accuracy of the distributed system, solve the problem of low synchronization accuracy in traditional technology, and achieve high-precision and fault-tolerant synchronization effects.

CN120639230APending Publication Date: 2025-09-12THREE GORGES INTELLIGENT CONTROL TECHNOLOGY CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202510887681.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2025-06-27
Publication Date
2025-09-12

AI Technical Summary

Technical Problem

Traditional distributed system time synchronization technology has low accuracy. Network delays and clock drift lead to the accumulation of time errors at each node, making it difficult to meet high-precision synchronization requirements.

Method used

A data convergence isochronous synchronization method is adopted to perform time alignment between the master node and the slave node through clock deviation compensation and network delay compensation. The time base difference algorithm and high-precision clock source are used to improve the synchronization accuracy, and a dynamic refresh flag is introduced to optimize the data interaction efficiency.

Benefits of technology

It achieves high-precision synchronization at the microsecond level, has strong fault tolerance and low resource consumption, and meets the real-time requirements of scenarios such as industrial automation.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN120639230A_ABST
    Figure CN120639230A_ABST
Patent Text Reader

Abstract

The invention relates to the technical field of distributed system time synchronization, in particular to a data aggregation isochronous synchronization method and system applied to a distributed system, and the method comprises the steps: selecting a synchronization algorithm to carry out synchronization optimization, and the synchronization optimization comprises the following steps: broadcasting time information to each slave node through a master node to carry out clock synchronization; each slave node performs parallel data acquisition and aggregates the data to the master node; performing time alignment between the master node and the slave node through clock skew compensation and network delay compensation, and performing isochronous synchronous data fusion to obtain synchronized data; judging whether the synchronization precision of the synchronized data reaches the standard or not; if not, an error is fed back to the synchronization algorithm, clock synchronization parameters are adjusted again, and synchronization optimization is circularly carried out; and if the standard is reached, outputting the synchronized data. According to the invention, synchronization optimization is carried out, time alignment is carried out through clock skew compensation and network delay compensation, and the clock synchronization precision of each node in the distributed system is improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of distributed system time synchronization, and in particular to a data convergence isochronous synchronization method and system applied to a distributed system. Background Art

[0002] The statements in this section merely provide background information related to the present invention and do not necessarily constitute prior art.

[0003] Traditional distributed system time synchronization technologies often use centralized clock synchronization solutions, relying on a single master clock node to broadcast time information to other nodes. This approach suffers from low synchronization accuracy, as network latency and clock drift lead to cumulative time errors across nodes, making it difficult to meet high-precision synchronization requirements.

[0004] In view of the above-mentioned defects, the present invention has made improvements. Summary of the Invention

[0005] In order to overcome the shortcomings of the background technology, the present invention provides a data convergence isochronous synchronization method and system applied to a distributed system, which performs time alignment between the master node and the slave node through clock deviation compensation and network delay compensation, thereby improving the clock synchronization accuracy of each node in the distributed system.

[0006] To achieve the above object, the present invention provides the following technical solutions:

[0007] In a first aspect, a data convergence isochronous synchronization method applied to a distributed system is provided, the method comprising:

[0008] Selecting a synchronization algorithm for synchronization optimization, which includes: broadcasting time information from the master node to each slave node for clock synchronization; each slave node performing parallel data acquisition and aggregating the data to the master node; aligning the time between the master node and the slave nodes through clock deviation compensation and network delay compensation, and performing isochronous synchronization data fusion to obtain synchronized data;

[0009] Determine whether the synchronization accuracy of the synchronized data meets the requirements;

[0010] If the target is not met, the error is fed back to the synchronization algorithm, the clock synchronization parameters are readjusted, and synchronization optimization is repeated in a cycle;

[0011] If the standard is met, the synchronized data is output.

[0012] Further,

[0013] The clock deviation compensation includes:

[0014] The slave node dynamically adjusts the local clock according to the time base difference.

[0015] Further,

[0016] The time base difference is obtained from the clock of the slave node and the clock of the master node through the request-response mode. The calculation formula used is:

[0017]

[0018] Among them, ΔT represents the time base difference, T 发送 Indicates the local time when the request is sent from the node, T 接收 Indicates the local time when the master node receives the request, T 主站请求 Indicates the local time when the master node sends the response, T 主站响应 Indicates the local time when the response was received from the node.

[0019] Further,

[0020] The network delay compensation includes:

[0021] Based on the minimum interaction time of each slave node in the distributed system, network delay is recorded and compensated, and a high-precision clock source is deployed.

[0022] Further,

[0023] Parallel data collection from nodes, including:

[0024] The slave nodes collect data according to their local clocks and add local timestamps to the data.

[0025] Further,

[0026] In each communication cycle, the slave node collects the local data timestamp, compares it with the time sent by the master node, and calculates the time difference to determine whether an update is needed;

[0027] If an update is required, an update flag is generated;

[0028] If no update is required, a no-update flag is generated;

[0029] The data interaction process between the master node and the slave node is triggered only when the flag is updated, otherwise the refresh of the current communication cycle is skipped.

[0030] Furthermore, the method further comprises:

[0031] The master time process obtains the reference time from the master node clock, compares it with the local data timestamp from the slave node, and calculates the local time difference of each slave node;

[0032] Send adjustment instructions to the slave nodes based on the local time difference of the slave nodes;

[0033] After receiving the adjustment instruction, the slave node aligns the time between the master node and the slave node through clock deviation compensation and network delay compensation, and feeds back the adjustment result to the master node.

[0034] Further,

[0035] Before selecting the synchronization algorithm to perform synchronization optimization, the method further includes:

[0036] Distributed systems perform system initialization;

[0037] Configure each node in the distributed system;

[0038] Each node initializes its local clock.

[0039] Further,

[0040] The synchronization algorithm is a PTP synchronization algorithm or an NTP synchronization algorithm.

[0041] In a second aspect, a data convergence isochronous synchronization system for a distributed system is also provided, the system comprising a synchronization optimization module and a judgment processing module, the synchronization optimization module comprising a clock synchronization submodule, a data acquisition and convergence submodule, and a time alignment submodule;

[0042] The synchronization optimization module is used to select a synchronization algorithm for synchronization optimization; wherein:

[0043] The clock synchronization submodule is used to broadcast time information to each slave node through the master node to perform clock synchronization;

[0044] The data collection and aggregation submodule is used to collect data in parallel at each slave node and aggregate the data to the master node;

[0045] The time alignment submodule is used to perform time alignment between the master node and the slave node through clock deviation compensation and network delay compensation, and perform isochronous synchronization data fusion to obtain synchronized data;

[0046] The judgment processing module is used to judge whether the synchronization accuracy of the synchronized data meets the standard. If not, the error is fed back to the synchronization algorithm of the synchronization optimization module, the clock synchronization parameters are readjusted, and cyclic synchronization optimization is performed. If it meets the standard, the synchronized data is output.

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

[0048] 1. The use of a time base difference algorithm (i.e., clock deviation compensation based on time base difference) and a delay compensation mechanism (i.e., network delay compensation) can control synchronization errors to the microsecond level, enabling high-precision synchronization.

[0049] 2. The distributed architecture avoids single point of failure and has strong fault tolerance;

[0050] 3. The introduction of dynamic refresh flags (i.e., "update" flag or "do not update" flag) optimizes data interaction efficiency, effectively reduces redundant data transmission, and has the characteristics of low resource consumption;

[0051] 4. The use of minimum interaction time control optimizes network load, improves real-time performance, and can better meet the needs of scenarios such as industrial automation.

[0052] Other features and advantages of the present invention will be described in the following description, and in part will become apparent from the description, or will be understood by practicing the present invention. The purpose and other advantages of the present invention can be realized and obtained by the structures pointed out in the description, claims and drawings.

[0053] The present invention will be further described below with reference to the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0054] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the following briefly introduces the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0055] Figure 1 A schematic diagram of a flow chart of a data convergence isochronous synchronization method applied to a distributed system according to an embodiment of the present invention;

[0056] Figure 2 A schematic diagram of the interaction between a master station and each slave station according to an embodiment of the present invention;

[0057] Figure 3 This is a schematic diagram of the overall process of a data convergence isochronous synchronization method applied to a distributed system according to an embodiment of the present invention;

[0058] Figure 4 The figure is a schematic diagram of the structure of a data convergence isochronous synchronization system applied to a distributed system according to an embodiment of the present invention. DETAILED DESCRIPTION

[0059] To make the objectives, technical solutions, and advantages of the present invention more clear, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of them. All other embodiments obtained by ordinary technicians in this field based on the embodiments of the present invention without making any creative efforts shall fall within the scope of protection of the present invention.

[0060] like Figure 1 As shown, the first embodiment of the present invention provides a data convergence isochronous synchronization method applied to a distributed system, the method comprising:

[0061] Selecting a synchronization algorithm for synchronization optimization, which includes: broadcasting time information from the master node to each slave node for clock synchronization; each slave node performing parallel data acquisition and aggregating the data to the master node; aligning the time between the master node and the slave nodes through clock deviation compensation and network delay compensation, and performing isochronous synchronization data fusion to obtain synchronized data;

[0062] Determine whether the synchronization accuracy of the synchronized data meets the requirements;

[0063] If the target is not met, the error is fed back to the synchronization algorithm, the clock synchronization parameters are readjusted, and synchronization optimization is repeated in a cycle;

[0064] If the standard is met, the synchronized data is output.

[0065] The above technical solution performs synchronization optimization based on distributed clocks and synchronization algorithms. The synchronization optimization process includes clock synchronization, data collection and aggregation, and time alignment. After each synchronization optimization is completed, it is judged whether the synchronization accuracy of the synchronized data meets the standard for the next step of processing. Among them, clock deviation compensation and network delay compensation can well align the time between the master node and the slave node, effectively improving the clock synchronization accuracy of each node in the distributed system, which can better meet the actual application needs.

[0066] In some embodiments, clock synchronization by broadcasting time information from the master node to each slave node includes: the master node broadcasting a timestamp; the slave node receiving the timestamp, calculating time deviation and delay, and adjusting the local clock of the slave node.

[0067] As a preferred technical solution, the clock deviation compensation includes: dynamically adjusting the local clock of the slave node according to the time base difference. Furthermore, the time base difference is obtained by the slave node's own clock and the master node clock through a request-response mode, and the calculation formula used is:

[0068]

[0069] Among them, ΔT represents the time base difference, T 发送 Indicates the local time when the request is sent from the node, T 接收 Indicates the local time when the master node receives the request, T 主站请求 Indicates the local time when the master node sends the response, T 主站响应 Indicates the local time when the slave node receives the response. In this embodiment, the master station is the master node, the slave station is the slave node, and T 接收 It can also be expressed as T 接受 .

[0070] like Figure 2 As shown, the embodiment of the present invention also provides a schematic diagram of interaction between the master station and each slave station.

[0071] The core process of calculating the time base difference using the above-mentioned time base difference calculation formula lies in the four-stage handshake and timestamp exchange. This embodiment of the present invention adopts a two-way communication mechanism similar to PTP (IEEE 1588), realizes the time base difference calculation through four timestamp collections, and performs dynamic adjustment and error correction.

[0072] In this embodiment, clock deviation compensation is an effective distributed clock synchronization mechanism. Each node's own clock obtains a timing difference from the master station's clock through a request-response mode. The timing difference calculation formula shown above is provided. The node dynamically adjusts its local clock based on the timing difference to ensure that the timestamp is consistent with the master station (i.e., the master node). Specifically, the slave node adjusts the local clock frequency or phase based on ΔT (the timing difference) and dynamically tracks the timing difference through multiple handshakes (e.g., every 100ms) to avoid the accumulation of crystal oscillator drift errors.

[0073] The time base difference refers to the time deviation between the local clock of each node in a distributed system and the master station clock (i.e., the master node clock), which is usually manifested as the absolute difference in timestamps or the cumulative error caused by frequency drift.

[0074] In the embodiment of the present invention, the core meanings of the time base difference value include:

[0075] 1. Initial deviation: The time difference between the local clock and the master clock when the node is initialized (for example, if the initial time of node A is 10:00:00 and the master clock is 10:00:05, the initial time base deviation is +5 seconds).

[0076] 2. Dynamic Drift: Due to variations in crystal oscillator accuracy, the relative frequency deviation between the node clock and the master clock causes a time difference to accumulate over time (for example, if the node crystal oscillator frequency is 1 ppm faster than the master clock, the cumulative deviation is 3.6 milliseconds per hour). "1 ppm" is a unit of accuracy or error, meaning "one part per million."

[0077] 3. Pseudo-bias introduced by network delay: During data transmission, network delay can cause the time difference recorded by the timestamp to be not the true clock deviation (for example, the interval between the master sending the timestamp T1 and the node receiving the timestamp T2 includes transmission delay, which needs to be removed by the algorithm).

[0078] As a preferred technical solution, the network delay compensation includes: recording and compensating network delay according to the minimum interaction time of each slave node in the distributed system, and deploying a high-precision clock source.

[0079] This embodiment performs minimum interaction time control. Specifically, according to the minimum interaction time T*N (where N represents the number of substations) of each node in the network, the network delay is recorded and compensated, and a high-precision clock source (such as GPS / atomic clock, which can be implemented using a clock chip) is deployed to improve synchronization accuracy. This embodiment uses minimum interaction time control to optimize network load, improve real-time performance, and better meet the needs of scenarios such as industrial automation. During specific implementation, a network delay compensation algorithm can be combined to compensate for network delays, thereby improving synchronization accuracy. Specifically, with the time difference, the status of different submodules (i.e., substations) at different times can be judged, and after issuing a unified time schedule, all modules (substations) can be made to act at a unified time, and the synchronization accuracy can be very high.

[0080] In specific implementation, time alignment preprocessing can be added before performing time alignment between the master node and the slave node through clock deviation compensation and network delay compensation. The time alignment preprocessing can facilitate the next step of time alignment.

[0081] The clock source of this embodiment has high accuracy, and the algorithm processing time difference has high accuracy. Therefore, the time base difference algorithm of this embodiment (i.e., clock deviation compensation based on time base difference, also written as timestamp calibration) and the delay compensation mechanism (i.e., network delay compensation, such as interpolation / filtering) can control the synchronization error to the microsecond level, and can achieve high-precision synchronization.

[0082] As a preferred technical solution, slave nodes perform parallel data collection, including: the slave nodes collect data according to their local clocks and add local timestamps to the data. Furthermore, during each communication cycle, the slave nodes collect local data timestamps, compare them with the master node's transmission time, and calculate the time difference to determine whether an update is required. If an update is required, an "update" flag is generated; otherwise, a "no update" flag is generated. The data exchange process between the master and slave nodes is triggered only when the "update" flag is set; otherwise, the update of the current communication cycle is skipped.

[0083] This embodiment dynamically manages data interaction by introducing a dynamic data refresh flag (i.e., an "update" flag or a "no update" flag). Specifically, during each communication cycle, nodes collect local data timestamps, exchange and compare them, and generate an "update / no update" flag. The data interaction process is triggered only when the flag is "update," otherwise the current cycle refresh is skipped. The introduction of a dynamic refresh flag in this embodiment optimizes data interaction efficiency, effectively reduces redundant data transmission, and reduces resource consumption.

[0084] Simply put, this embodiment of the present invention compares the master station's transmission time with the clock of the slave station's local clock source to calculate the time difference, thereby determining whether an update is needed. The aforementioned data exchange process can be understood as a data exchange process from the master station to each slave station. New data is only reported to the master station after the slave station updates its data. If the slave station's data has not been updated, there is actually no need to report the current data, as the master station already has the current data. Since only updated data is reported, and unupdated data is not reported, only a portion of the updated data needs to be processed, effectively reducing redundant data transmission.

[0085] As a preferred technical solution, the method also includes: the master time process obtains the reference time from the master node clock, compares it with the local data timestamp from the slave node and calculates the local time difference of each slave node; sends an adjustment instruction to the slave node according to the local time difference of the slave node; after receiving the adjustment instruction, the slave node aligns the time between the master node and the slave node through clock deviation compensation and network delay compensation, and feeds back the adjustment result to the master node.

[0086] This embodiment also employs master time process scheduling. Specifically, the master time process obtains time from a reference time source (i.e., the master node clock), calculates the local time difference of each node, and issues adjustment instructions (gradually or immediately). The nodes then feedback the adjustment results to achieve closed-loop control. Simply put, this process uses the difference in time between transmission and reception to align time within the master and slave stations.

[0087] As a preferred technical solution, before selecting the synchronization algorithm for synchronization optimization, the method further includes: initializing the distributed system; configuring each node in the distributed system; and initializing the local clock of each node.

[0088] In this embodiment, system initialization, node configuration, and local clock initialization are all preparatory work before synchronization optimization (cyclic synchronization optimization), which can facilitate better completion of the synchronization optimization process.

[0089] As a preferred technical solution, the synchronization algorithm is a PTP synchronization algorithm or an NTP synchronization algorithm.

[0090] During specific implementation, the synchronization algorithm used for synchronization optimization includes but is not limited to the PTP synchronization algorithm or the NTP synchronization algorithm.

[0091] The existing centralized clock synchronization solution (relying on a single master clock node to broadcast time information to other nodes) still has the disadvantage of poor fault tolerance. Failure of the master clock node will cause the synchronization of the entire system to fail. The embodiments of the present invention enhance the fault tolerance and stability of the system, making the distributed system highly fault-tolerant. The distributed architecture avoids single point failures (that is, a distributed time synchronization mechanism is adopted to avoid single point failures). When the master station fails, the nodes can autonomously elect a new master.

[0092] If the time of a single node is inaccurate, it will easily be reflected and separated in a large number of time comparisons; this part of the abnormal data can be discarded to ensure the normal operation of the distributed system. Therefore, the use of a distributed time synchronization mechanism can avoid single point failures.

[0093] In order to more clearly and intuitively demonstrate the entire process of the data convergence isochronous synchronization method applied to distributed systems, Figure 3 As shown, the embodiment of the present invention also provides an overall flow chart of a data convergence isochronous synchronization method.

[0094] like Figure 4 As shown, the second embodiment of the present invention further provides a data convergence isochronous synchronization system applied to a distributed system, the system comprising a synchronization optimization module and a judgment processing module, the synchronization optimization module comprising a clock synchronization submodule, a data acquisition and convergence submodule, and a time alignment submodule;

[0095] The synchronization optimization module is used to select a synchronization algorithm for synchronization optimization; wherein:

[0096] The clock synchronization submodule is used to broadcast time information to each slave node through the master node to perform clock synchronization;

[0097] The data collection and aggregation submodule is used to collect data in parallel at each slave node and aggregate the data to the master node;

[0098] The time alignment submodule is used to perform time alignment between the master node and the slave node through clock deviation compensation and network delay compensation, and perform isochronous synchronization data fusion to obtain synchronized data;

[0099] The judgment processing module is used to judge whether the synchronization accuracy of the synchronized data meets the standard. If not, the error is fed back to the synchronization algorithm of the synchronization optimization module, the clock synchronization parameters are readjusted, and cyclic synchronization optimization is performed. If it meets the standard, the synchronized data is output.

[0100] Regarding the system in the above embodiment, the specific manner in which each unit module (submodule) performs operations has been described in detail in the embodiment of the method, and will not be elaborated here.

[0101] In the several embodiments provided in this application, it should be understood that the disclosed systems and methods can be implemented in other ways. For example, the system embodiments described above are merely illustrative. For example, the division of the modules is merely a logical function division. In actual implementation, there may be other division methods, such as multiple modules or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of systems or modules, which can be electrical, mechanical or other forms.

[0102] The modules described as separate components may or may not be physically separate, and the components displayed as modules may or may not be physical modules, that is, they may be located in one place or distributed across multiple network modules. Some or all of the modules may be selected according to actual needs to achieve the purpose of the present embodiment. In addition, the functional modules in the various embodiments of the present invention may be integrated into a processing module, or each module may exist physically separately, or two or more modules may be integrated into a single module. The integrated modules may be implemented in the form of hardware or software functional modules.

[0103] If the integrated module is implemented in the form of a software functional module and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, or the part that contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, server, or network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0104] It should be noted that for the aforementioned method embodiments, for ease of description, they are all expressed as a series of action combinations. However, those skilled in the art should be aware that the present invention is not limited by the order of the actions described, because according to the present invention, certain steps can be performed in other orders or simultaneously. Secondly, those skilled in the art should also be aware that the embodiments described in this specification are all preferred embodiments, and the actions and modules involved are not necessarily required by the present invention.

[0105] In the above embodiments, the description of each embodiment has its own focus. For parts that are not described in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.

[0106] Parts not involved in the above embodiments are the same as the existing technology or can be implemented by using the existing technology, and will not be further explained here.

[0107] Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein; and these modifications or replacements do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A data convergence isochronous synchronization method applied to a distributed system, characterized in that: The method comprises: Selecting a synchronization algorithm for synchronization optimization, which includes: broadcasting time information from the master node to each slave node for clock synchronization; each slave node performing parallel data acquisition and aggregating the data to the master node; aligning the time between the master node and the slave nodes through clock deviation compensation and network delay compensation, and performing isochronous synchronization data fusion to obtain synchronized data; Determine whether the synchronization accuracy of the synchronized data meets the requirements; If the target is not met, the error is fed back to the synchronization algorithm, the clock synchronization parameters are readjusted, and synchronization optimization is repeated in a cycle; If the standard is met, the synchronized data is output.

2. The data convergence isochronous synchronization method applied to a distributed system according to claim 1, characterized in that: The clock deviation compensation includes: The slave node dynamically adjusts the local clock according to the time base difference.

3. The data convergence isochronous synchronization method applied to a distributed system according to claim 2, characterized in that: The time base difference is obtained from the clock of the slave node and the clock of the master node through the request-response mode. The calculation formula used is: Among them, ΔT represents the time base difference, T 发送 Indicates the local time when the request is sent from the node, T 接收 Indicates the local time when the master node receives the request, T 主站请求 Indicates the local time when the master node sends the response, T 主站响应 Indicates the local time when the response was received from the node.

4. The data convergence isochronous synchronization method applied to a distributed system according to claim 1, characterized in that: The network delay compensation includes: Based on the minimum interaction time of each slave node in the distributed system, network delay is recorded and compensated, and a high-precision clock source is deployed.

5. The data convergence isochronous synchronization method applied to a distributed system according to claim 1, characterized in that: Parallel data collection from nodes, including: The slave nodes collect data according to their local clocks and add local timestamps to the data.

6. The data convergence isochronous synchronization method applied to a distributed system according to claim 5, characterized in that: In each communication cycle, the slave node collects the local data timestamp, compares it with the time sent by the master node, and calculates the time difference to determine whether an update is needed; If an update is required, an update flag is generated; If no update is required, a no-update flag is generated; The data interaction process between the master node and the slave node is triggered only when the flag is updated, otherwise the refresh of the current communication cycle is skipped.

7. The data convergence isochronous synchronization method applied to a distributed system according to claim 1, characterized in that: The method further comprises: The master time process obtains the reference time from the master node clock, compares it with the local data timestamp from the slave node, and calculates the local time difference of each slave node; Send adjustment instructions to the slave nodes based on the local time difference of the slave nodes; After receiving the adjustment instruction, the slave node aligns the time between the master node and the slave node through clock deviation compensation and network delay compensation, and feeds back the adjustment result to the master node.

8. The data convergence isochronous synchronization method applied to a distributed system according to claim 1, characterized in that: Before selecting the synchronization algorithm to perform synchronization optimization, the method further includes: Distributed systems perform system initialization; Configure each node in the distributed system; Each node initializes its local clock.

9. The data convergence isochronous synchronization method applied to a distributed system according to claim 1, characterized in that: The synchronization algorithm is a PTP synchronization algorithm or an NTP synchronization algorithm.

10. A data convergence isochronous synchronization system applied to a distributed system, characterized in that: The system includes a synchronization optimization module and a judgment processing module, wherein the synchronization optimization module includes a clock synchronization submodule, a data acquisition and aggregation submodule, and a time alignment submodule; The synchronization optimization module is used to select a synchronization algorithm for synchronization optimization; wherein: The clock synchronization submodule is used to broadcast time information to each slave node through the master node to perform clock synchronization; The data collection and aggregation submodule is used to collect data in parallel at each slave node and aggregate the data to the master node; The time alignment submodule is used to perform time alignment between the master node and the slave node through clock deviation compensation and network delay compensation, and perform isochronous synchronization data fusion to obtain synchronized data; The judgment processing module is used to judge whether the synchronization accuracy of the synchronized data meets the standard. If not, the error is fed back to the synchronization algorithm of the synchronization optimization module, the clock synchronization parameters are readjusted, and cyclic synchronization optimization is performed. If it meets the standard, the synchronized data is output.