High-speed acquired data caching and distributing method, equipment, medium and product

Abstract

The invention discloses a caching and distributing method and device for high-speed collected data, a medium and a product, and relates to the field of data caching and distributing, and the method comprises the steps: obtaining the high-speed collected data; analyzing the high-speed collected data to obtain analyzed collected data; caching the analyzed collected data into a circular queue corresponding to each data point; the capacity of the circular queue is determined according to the maximum access period, the minimum access period and the minimum time interval; a head pointer and a tail pointer are arranged in the circular queue; the head pointer points to the data cached first; the tail pointer points to the last cached data; sampling data combination information is acquired from a head pointer of the circular queue until the head pointer points to a tail pointer, and data acquisition is completed; and distributing the acquired sampling data combination information. According to the invention, the stability of the special instrument control system of the nuclear power plant in a high-load operation state is improved.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of data caching and distribution, and in particular to a caching and distribution method, device, medium and product for high-speed collected data. BACKGROUND

[0002] In a dedicated I&C system (such as a test data acquisition system, a test instrument system, a transient record and analysis / accident sequence record, etc.) of a nuclear power plant, high-precision data acquisition is required, and the time precision of analog data can reach 25 ms, and the time precision of switching data can reach 1 ms. A layer controller regularly acquires data collected by a high-speed IO card and sends the data to a second layer software system for processing and storage. A second layer communication service parses and caches the received data, and a data distribution service sends the data to other services and interfaces for business processing and display.

[0003] Because the period of data sent by the controller is different from the period of data acquired by other services, in order to ensure that data is not lost, the communication service creates a variable-capacity container such as a list for each data point to cache data, the communication service is responsible for adding new data to the tail of the container, and the data distribution service takes data from the head of the container. In order to ensure data consistency, both parties need to acquire an update lock of the container first, and then update the data in the container.

[0004] Under normal conditions and stable network conditions, the above scheme has no problem, and the storage and retrieval of cached data can be performed in order. However, under avalanche conditions or busy conditions, on the one hand, the frequent changes in container capacity will cause frequent allocation and release of memory, increasing system load; on the other hand, in the case of high system load, the waiting time for the update lock may be extended, causing the processing flow to be stuck. SUMMARY

[0005] The purpose of the present application is to provide a caching and distribution method, device, medium and product for high-speed collected data, to improve the stability of a dedicated I&C system of a nuclear power plant under high-load operating conditions.

[0006] To achieve the above purpose, the present application provides the following solutions:

[0007] In a first aspect, the present application provides a caching and distribution method for high-speed collected data, comprising:

[0008] acquiring high-speed collected data; the high-speed collected data is data collected by a high-speed IO card; and the high-speed collected data includes a timestamp of a starting sampling time of each data point, point values arranged in sampling order, and data quality bits.

[0009] The high-speed acquisition data is parsed to obtain parsed acquisition data; the parsed acquisition data includes sampling data combination information of each data point at each sampling time; the sampling data combination information includes a timestamp, a point value, and a data quality bit;

[0010] The parsed acquisition data is cached in a circular queue corresponding to each data point; a capacity of the circular queue is determined according to a maximum access period, a minimum access period, and a minimum time interval; a head pointer and a tail pointer are arranged in the circular queue; the head pointer points to the first cached data; and the tail pointer points to the last cached data;

[0011] The sampling data combination information is obtained from the head pointer of the circular queue until the head pointer points to the tail pointer, and data acquisition is completed;

[0012] The obtained sampling data combination information is distributed.

[0013] Optionally, the high-speed acquisition data is parsed to obtain parsed acquisition data, and specifically includes:

[0014] According to a sampling period and a starting sampling time, a timestamp corresponding to each point value is determined to obtain the parsed acquisition data.

[0015] Optionally, according to the sampling period and the starting sampling time, the timestamp corresponding to each point value is determined, and specifically includes:

[0016] The timestamp corresponding to each point value is determined by using a formula t k = t0 + k × T, where t k is the timestamp corresponding to the point value, t0 is a starting time, k is a point value index, and T is the sampling period.

[0017] Optionally, the parsed acquisition data is cached in a circular queue corresponding to each data point, and specifically includes:

[0018] For any data point:

[0019] The sampling data combination information of all sampling times of the current data point is sequentially covered in the corresponding position in the corresponding circular queue, and the tail pointer is moved once for each sampling data combination information.

[0020] Optionally, the sampling data combination information is obtained from the head pointer of the circular queue until the head pointer points to the tail pointer, and data acquisition is completed, and specifically includes:

[0021] A data point to be updated is determined;

[0022] Copy the sampling data combination information from the head pointer position of the circular queue corresponding to the data point to be updated, starting from the current position of the head pointer, moving the head pointer once for each sampling data combination information, until the head pointer points to the tail pointer, and the data acquisition is completed.

[0023] In a second aspect, the application provides a cache method for high-speed collected data, comprising:

[0024] Acquiring high-speed collected data; the high-speed collected data is data collected by a high-speed IO card; the high-speed collected data comprises a timestamp of a starting sampling time of each data point, point values arranged in a sampling order, and data quality bits;

[0025] Analyzing the high-speed collected data to obtain analyzed collected data; the analyzed collected data comprises sampling data combination information of each data point at each sampling time; the sampling data combination information comprises a timestamp, a point value, and data quality bits;

[0026] Caching the analyzed collected data in a circular queue corresponding to each data point; the capacity of the circular queue is determined according to a maximum access period, a minimum access period, and a minimum time interval; the circular queue is provided with a head pointer and a tail pointer; the head pointer points to the first cached data; and the tail pointer points to the last cached data.

[0027] In a third aspect, the application provides a distribution method for high-speed collected data, comprising:

[0028] Starting from the head pointer of the circular queue of the data point to be updated, acquiring sampling data combination information until the head pointer points to the tail pointer, and the data acquisition is completed; the circular queue caches sampling data combination information of multiple sampling times; the sampling data combination information comprises a timestamp, a point value, and data quality bits; the capacity of the circular queue is determined according to a maximum access period, a minimum access period, and a minimum time interval; the circular queue is provided with a head pointer and a tail pointer; the head pointer points to the first cached data; and the tail pointer points to the last cached data.

[0029] Distributing the acquired sampling data combination information.

[0030] In a fourth aspect, the application provides a computer device, comprising a memory, a processor, a computer program stored in the memory and executable on the processor, and the processor executes the computer program to implement the cache and distribution methods for high-speed collected data according to any one of the above aspects.

[0031] In a fifth aspect, the present application provides a computer readable storage medium, having stored thereon a computer program, which, when executed by a processor, implements the cache and distribution method of high-speed collected data according to any one of the preceding aspects.

[0032] In a sixth aspect, the present application provides a computer program product comprising a computer program which, when executed by a processor, implements the cache and distribution method of high-speed collected data according to any one of the preceding aspects.

[0033] According to the embodiments provided in the present application, the present application has the following technical effects:

[0034] The present application provides a cache and distribution method, device, medium and product of high-speed collected data, acquires high-speed collected data, analyzes the high-speed collected data to obtain analyzed collected data, caches the analyzed collected data into a circular queue corresponding to each data point, the capacity of the circular queue is determined according to a maximum access period, a minimum access period and a minimum time interval, a head pointer and a tail pointer are set in the circular queue, the head pointer points to the first cached data, the tail pointer points to the last cached data, the sampling data combination information is acquired from the head pointer of the circular queue until the head pointer points to the tail pointer, and the data acquisition is completed, and the acquired sampling data combination information is distributed. In the present application, the circular queue sets the capacity according to the maximum access period, the data will not be cyclically overwritten, and the data loss can be ensured. At the same time, the capacity of the circular queue is fixed, and the problem of repeatedly applying and releasing memory caused by the change of the queue capacity will not occur, and the system load will not be increased. The data is cached in the circular queue, and the communication service and other services write and read data according to the tail pointer and the head pointer respectively, so that even in the case of heavy system load such as busy working condition and avalanche working condition, the data access of one party will not be affected due to the slow processing of the other party, and the data reading and writing conflict caused by the cache data will not occur, thereby improving the stability of the system in the high-load running state. BRIEF DESCRIPTION OF DRAWINGS

[0035] In order to more clearly illustrate the technical solutions in the embodiments of the present application or the prior art, the drawings needed in the embodiments will be briefly introduced below. Obviously, the drawings in the following description are only some embodiments of the present application, and other drawings can be obtained by those skilled in the art without creative labor.

[0036] Figure 1 A flowchart of a cache and distribution method of high-speed collected data provided by an embodiment of the present application is shown in the figure.

[0037] Figure 2 A high-speed collected data flow direction schematic diagram is shown in the figure.

[0038] Figure 3 Flowchart for accessing a circular queue;

[0039] Figure 4 Flowchart for a circular queue;

[0040] Figure 5 Structure schematic diagram of a computer device provided by an embodiment of the present application. DETAILED DESCRIPTION

[0041] The technical solutions in the embodiments of the present application will be described clearly and completely below with reference to the drawings in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, rather than all the embodiments of the present application. Based on the embodiments in the present application, all other embodiments obtained by those skilled in the art without creative work fall within the scope of protection of the present application.

[0042] The above objects, characteristics and advantages of the present application will be more apparent and understandable, and the present application will be further described in detail below with reference to the drawings and specific embodiments.

[0043] To solve the problems in the related art, the present application improves the data caching mechanism of a communication service, and adopts a circular queue to cache data. The circular queue pre-allocates sufficient memory, and no memory is re-applied during system operation. Meanwhile, the updating lock mechanism is cancelled, and the circular queue sets a head pointer and a tail pointer, which respectively point to the position of data extraction and the position of data insertion.

[0044] In an exemplary embodiment, as shown in Figure 1 a caching and distributing method of high-speed acquisition data is provided, including the following steps:

[0045] S1: obtaining high-speed acquisition data; the high-speed acquisition data is data collected by a high-speed IO card; the high-speed acquisition data includes a timestamp of a starting sampling moment of each data point, point values arranged in a sampling order, and data quality bits.

[0046] S2: analyzing the high-speed acquisition data to obtain analyzed acquisition data; the analyzed acquisition data includes sampling data combination information of each data point at each sampling moment; the sampling data combination information includes a timestamp, a point value, and data quality bits.

[0047] As an optional implementation, analyzing the high-speed acquisition data to obtain analyzed acquisition data specifically includes:

[0048] According to a sampling period and a starting sampling moment, determining a timestamp corresponding to each point value to obtain analyzed acquisition data.

[0049] Specifically, the time stamp corresponding to each point value is determined by using a formula t k = t0+k x T, wherein t k is the time stamp corresponding to the point value, t0 is a start time, k is a point value index, and T is a sampling period.

[0050] S3: cache the parsed collection data into a circular queue corresponding to each data point; the capacity of the circular queue is determined according to a maximum access period, a minimum access period, and a minimum time interval; a head pointer and a tail pointer are set in the circular queue; the head pointer points to the first cached data; and the tail pointer points to the last cached data.

[0051] As an optional implementation, S3 specifically includes:

[0052] For any data point:

[0053] The sampling data combination information of all sampling instants of the current data point is sequentially overwritten into the corresponding position in the corresponding circular queue, starting from the current position of the tail pointer, and the tail pointer moves once for each added sampling data combination information.

[0054] In actual application, the communication service creates an array-based circular queue, and each data point corresponds to a circular queue. The circular queue saves the data sampled from the data point, including a time stamp, a point value, and a data quality bit. The size of the circular queue is determined according to the data cache amount of the maximum access period. For example, if the maximum access period of cache access is 2 seconds and the minimum time interval of data is 25 milliseconds, the capacity of the circular queue is at least 80 data. In order to ensure that the queue space is sufficient, a number of data of the minimum access period can be appropriately increased. For example, if the minimum access period of cache access is 200 milliseconds, the capacity of the circular queue is set to 88 data, which is sufficient. The circular queue sets a head pointer and a tail pointer, and both initially point to the start position of the array.

[0055] As shown in FIG. 1, Figure 2 The high-speed collection data collected by the controller or other data collection module is uploaded to the communication service according to a fixed transmission period. The data packet of the high-speed collection data contains all the data sampled at a sampling period of 25 ms for each data point. In order to save transmission bandwidth, only the time stamp of the start sampling instant and the point value and data quality bit arranged in sequence are provided in the data packet. After receiving the data, the communication service parses the data packet, calculates the time stamp corresponding to each point value according to the start time and the sampling period, and caches the parsed collection data, i.e., the collection data combination information of the time stamp, the point value, and the data quality bit, into the circular queue corresponding to each data point. The data distribution service periodically obtains data from the circular queue according to the refresh period of the data point, and then the data is distributed to the historical server and other services and human-computer interaction interfaces.

[0056] After the communication service parses a controller-uploaded data packet (high-speed acquisition data), the data is overwritten into the array starting from the tail pointer of the circular queue in chronological order. If the number of data is greater than the offset from the tail pointer to the end of the array, the remaining data is overwritten from the start of the array after the data is overwritten to the end of the array, and the tail pointer is moved one bit backward for each data overwritten.

[0057] As shown in Figure 3 , the access process of the circular queue includes a process in which the communication service writes data into the circular queue, and the writing process includes the following steps:

[0058] Step 1: When the communication service starts, a circular queue is created for each data point.

[0059] Step 2: After the communication service receives high-speed acquisition data, the data is parsed, and the timestamp corresponding to each point value is calculated according to the starting sampling time and the sampling period. The calculation method is as follows:

[0060] t k = t0+ k × T.

[0061] For example, if the starting sampling time of a certain segment of high-speed acquisition data is 2024 / 10 / 18 14:19:03.010, and the sampling period is 25 ms, then the timestamp corresponding to the point value with index 2 is 2024 / 10 / 18 14:19:03.085.

[0062] Then, each data point is processed in a loop, and all data of the data point is overwritten into the circular queue to avoid frequent application of new memory. Starting from the current position of the tail pointer, the tail pointer is moved once for each data added, and the moving position of the tail pointer is calculated according to the following formula to realize the circulation of the tail pointer.

[0063] The moving position of the tail pointer = (the current position of the tail pointer + 1) % the total capacity of the circular queue.

[0064] S4: Start from the head pointer of the circular queue to obtain the sampling data combination information until the head pointer points to the tail pointer, and the data acquisition is completed.

[0065] As an optional implementation, S4 specifically includes:

[0066] determining a data point to be updated;

[0067] copying the sampling data combination information from the head pointer position of the circular queue corresponding to the data point to be updated, starting from the current position of the head pointer, moving the head pointer once for each sampling data combination information copied, until the head pointer points to the tail pointer, and the data acquisition is completed.

[0068] As Figure 3 shown in FIG. 1, the access process of the circular queue also includes a process in which the data distribution service periodically reads data from the circular queue. The process of reading data includes the following steps:

[0069] Step 1: Wait for the update period to arrive, and collect the data points that need to be updated this time.

[0070] Step 2: Process each data point in a loop, starting from the head pointer position to copy data. After the data is copied, no memory cleaning is performed to avoid frequent memory recovery. Starting from the current position of the head pointer, the head pointer moves once for each data copied. The moving position of the head pointer is calculated according to the following formula, and the loop of the head pointer is realized until the head pointer points to the tail pointer, indicating that all cached data has been obtained.

[0071] Moving position of head pointer = (head pointer current position + 1) % total capacity of queue.

[0072] In actual application, when the data distribution service obtains data, the number of cached data is obtained according to the offset of the head pointer to the tail pointer.

[0073] S5: Distribute the obtained sampling data combination information.

[0074] After the data is obtained, subsequent distribution processing is performed.

[0075] Taking data writing as an example, as Figure 4 shown in FIG. 2, Figure 4 the moving mode of the tail pointer of the circular queue is given.

[0076] Case 1 represents the initial state of the array of the circular queue, or all data in the queue has been taken out, at this time the head pointer and the tail pointer point to the same position. After data insertion, the tail pointer moves backward to point to the position of the next data insertion.

[0077] Case 2 represents that during the use of the circular queue, a part of data has been written but not taken out, at this time the offset between the head pointer and the tail pointer is the data that has been written. After data insertion, the tail pointer continues to move backward to point to the position of the next data insertion.

[0078] Case 3 represents that during the use of the circular queue, the tail pointer has approached the tail of the array, and the offset from the tail pointer to the tail of the array is not enough for all data to be cached at once. When data is inserted, the tail pointer moves to the tail of the array and starts again from the head of the array after data insertion is completed. The tail pointer points to the position of the next data insertion.

[0079] In an exemplary embodiment, a cache method for high-speed data acquisition is provided, comprising:

[0080] The high-speed acquisition data is acquired by a high-speed IO card; and the high-speed acquisition data includes a timestamp of a starting sampling moment of each data point, point values arranged in a sampling order, and data quality bits.

[0081] The high-speed acquisition data is parsed to obtain parsed acquisition data; the parsed acquisition data includes sampling data combination information of each data point at each sampling moment; and the sampling data combination information includes a timestamp, a point value, and data quality bits.

[0082] The parsed acquisition data is cached in a circular queue corresponding to each data point; a capacity of the circular queue is determined according to a maximum access period, a minimum access period, and a minimum time interval; a head pointer and a tail pointer are arranged in the circular queue; the head pointer points to the first cached data; and the tail pointer points to the last cached data.

[0083] In an exemplary embodiment, a method for distributing high-speed acquisition data is provided, including:

[0084] The sampling data combination information is acquired from the head pointer of the circular queue of the data point to be updated until the head pointer points to the tail pointer, and the data acquisition is completed; the circular queue caches sampling data combination information of multiple sampling moments; the sampling data combination information includes a timestamp, a point value, and data quality bits; the capacity of the circular queue is determined according to a maximum access period, a minimum access period, and a minimum time interval; a head pointer and a tail pointer are arranged in the circular queue; the head pointer points to the first cached data; and the tail pointer points to the last cached data.

[0085] The acquired sampling data combination information is distributed.

[0086] Compared with related art, the present application has the following advantages:

[0087] The circular queue has a capacity determined according to a maximum access period, and data is not cyclically overwritten, so that data loss is avoided. Meanwhile, the capacity of the circular queue is fixed, so that repeated application and release of memory caused by changes in the capacity of the queue are avoided, and system load is not increased.

[0088] Data is cached in a circular queue, and communication services and other services write and read data according to the tail pointer and the head pointer, respectively. Even in a busy working condition, an avalanche working condition, or the like, system load is large, and one party processing is slow, the data access of the other party is not affected, and data read-write conflict does not cause a stall, so that the stability of the system in a high-load running state is improved.

[0089] In an exemplary embodiment, a computer device is provided, comprising a memory and a processor, the memory storing a computer program, and the processor implementing the above-mentioned method for caching and distributing high-speed collected data when executing the computer program.

[0090] In an exemplary embodiment, a computer readable storage medium is provided, storing a computer program, and the computer program implementing the above-mentioned method for caching and distributing high-speed collected data when executed by a processor.

[0091] In an exemplary embodiment, a computer program product is provided, comprising a computer program, and the computer program implementing the above-mentioned method for caching and distributing high-speed collected data when executed by a processor.

[0092] In an exemplary embodiment, a computer device is provided, which can be a server or a terminal, and its internal structure diagram can be as shown in Figure 5 The computer device comprises a processor, a memory, an input / output interface (I / O) and a communication interface. The processor, the memory and the input / output interface are connected through a system bus, and the communication interface is connected to the system bus through the input / output interface. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device comprises a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operating system and the computer program in the non-volatile storage medium to run. The input / output interface of the computer device is used to exchange information between the processor and external devices. The communication interface of the computer device is used to communicate with external terminals through network connection. The computer program is executed by the processor to implement a method for caching and distributing high-speed collected data.

[0093] Those skilled in the art can understand that Figure 5 The structure shown in the above-mentioned figure is only a block diagram of part of the structure related to the scheme of the present application, and does not constitute a limitation on the computer device to which the scheme of the present application is applied. The specific computer device can comprise more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0094] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data for analysis, stored data, displayed data, etc.) involved in the present application are all information and data authorized by the user or authorized by all parties, and the collection, use and processing of related data need to comply with relevant regulations.

[0095] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through a computer program. The computer program can be stored in a non-volatile computer readable storage medium, and when the computer program is executed, the processes of the above-mentioned embodiments of the methods can be included. Any reference to memory, databases or other media used in the embodiments provided in the present application can include at least one of non-volatile and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical storage, high-density embedded non-volatile memory, resistive memory (ReRAM), magnetoresistive random access memory (MRAM), ferroelectric memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. As an illustration but not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM), etc.

[0096] The database involved in the embodiments provided in the present application can include at least one of a relational database and a non-relational database. The non-relational database can include a distributed database based on a blockchain, etc., without being limited thereto. The processor involved in the embodiments provided in the present application can be a general-purpose processor, a central processing unit, a graphics processing unit, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, etc., without being limited thereto.

[0097] The technical features of the above embodiments can be combined arbitrarily. In order to make the description concise, all possible combinations of the technical features in the above embodiments are not described, but as long as the combinations of the technical features do not exist, they should be considered as the scope of the present application.

[0098] The principles and implementation modes of the present application are described by applying specific examples herein. The above description of the embodiments is only used to help understand the method and its core idea of the present application; meanwhile, for those skilled in the art, according to the idea of the present application, the specific implementation mode and application range can be changed. In conclusion, the content of the present application should not be understood as a limitation.

Claims

1. A method for caching and distributing high-speed acquired data, characterized in that, include: Acquire high-speed data; the high-speed data is acquired through a high-speed I / O card; the high-speed data includes the timestamp of the start sampling time of each data point, the point values ​​arranged in the sampling order, and the data quality bits; The high-speed acquired data is parsed to obtain parsed acquired data; the parsed acquired data includes the sampled data combination information of each data point at each sampling time; the sampled data combination information includes timestamp, point value, and data quality bits; The parsed collected data is cached in a circular queue corresponding to each data point; The capacity of the circular queue is determined based on the maximum access cycle, the minimum access cycle, and the minimum time interval; the circular queue is equipped with a head pointer and a tail pointer; the head pointer points to the first cached data; the tail pointer points to the last cached data. The sampling data combination information is acquired starting from the head pointer of the circular queue until the head pointer points to the tail pointer, at which point the data acquisition is complete. The acquired sampled data combination information is then distributed.

2. The method for caching and distributing high-speed acquired data according to claim 1, characterized in that, The high-speed acquired data is parsed to obtain parsed acquired data, specifically including: Based on the sampling period and the start sampling time, the timestamp corresponding to each point value is determined, and the parsed collected data is obtained.

3. The method for caching and distributing high-speed acquired data according to claim 2, characterized in that, Based on the sampling period and the start sampling time, determine the timestamp corresponding to each point value, specifically including: Using formula t k =t0 + k × T, determining the timestamp corresponding to each point value; where t k t0 is the timestamp corresponding to the point value; t0 is the start time; k is the point value index; T is the sampling period.

4. The method for caching and distributing high-speed acquired data according to claim 1, characterized in that, The parsed collected data is cached in a circular queue corresponding to each data point, specifically including: For any given data point: The sampling data combination information of all sampling times of the current data point is sequentially overwritten to the corresponding positions in the corresponding circular queue. Starting from the current position of the tail pointer, the tail pointer moves once for each additional sampling data combination information.

5. The method for caching and distributing high-speed acquired data according to claim 1, characterized in that, The process begins by acquiring sampled data combination information from the head pointer of the circular queue until the head pointer points to the tail pointer, at which point data acquisition is complete. Specifically, this includes: Identify the data points to be updated; Starting from the head pointer position in the circular queue corresponding to the data point to be updated, copy the sampled data combination information. With the current position of the head pointer as the starting point, move the head pointer once for each sampled data combination information copied, until the head pointer points to the tail pointer, and the data acquisition is complete.

6. A method for caching high-speed acquired data, characterized in that, include: Acquire high-speed data; The high-speed acquisition data is acquired through a high-speed I / O card; the high-speed acquisition data includes the timestamp of the start sampling time of each data point, the point values ​​arranged in the sampling order, and the data quality bits; The high-speed acquired data is parsed to obtain parsed acquired data; the parsed acquired data includes the sampled data combination information of each data point at each sampling time; the sampled data combination information includes timestamp, point value, and data quality bits; The parsed collected data is cached in a circular queue corresponding to each data point; The capacity of the circular queue is determined based on the maximum access cycle, the minimum access cycle, and the minimum time interval; the circular queue is equipped with a head pointer and a tail pointer; the head pointer points to the first cached data; and the tail pointer points to the last cached data.

7. A method for distributing high-speed acquired data, characterized in that, include: The sampling data combination information is obtained starting from the head pointer of the circular queue of data points to be updated, until the head pointer points to the tail pointer, at which point the data acquisition is complete; The circular queue caches combined sampling data information from multiple sampling times; the combined sampling data information includes timestamps, point values, and data quality bits; the capacity of the circular queue is determined based on the maximum access period, minimum access period, and minimum time interval; the circular queue is equipped with a head pointer and a tail pointer; the head pointer points to the first cached data; the tail pointer points to the last cached data. The acquired sampled data combination information is then distributed.

8. A computer device, comprising: A memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that the processor executes the computer program to implement the method for caching and distributing high-speed acquired data according to any one of claims 1-5.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that, When executed by a processor, the computer program implements the method for caching and distributing high-speed acquired data as described in any one of claims 1-5.

10. A computer program product, comprising a computer program, characterized in that, When executed by a processor, the computer program implements the method for caching and distributing high-speed acquired data as described in any one of claims 1-5.

Images