WO2016082594A1

WO2016082594A1 - Data update processing method and apparatus

Info

Publication number: WO2016082594A1
Application number: PCT/CN2015/087950
Authority: WO
Inventors: 朱明全; 毛坤伦; 孙兴强
Original assignee: 中兴通讯股份有限公司
Priority date: 2014-11-26
Filing date: 2015-08-24
Publication date: 2016-06-02
Also published as: CN105700962A

Abstract

Disclosed are a data update processing method and apparatus. The method comprises: updating data in shared memory; sending a complete message indicating that update of the data in the shared memory is completed to one or more threads; and providing, according to the complete message, the updated data in the shared memory to the one or more threads to perform service processing. By means of the present invention, a problem in the related art that when multiple processes use shared memory, a data change in the shared memory cannot be perceived in time is resolved, so that a status of the data in the shared memory can be known in time.

Description

Data update processing method and device

Technical field

The present invention relates to the field of communications, and in particular, to a data update processing method and apparatus.

Background technique

With the development of the Internet, the functions of routers are increasingly complex, and centralized control plane processing can no longer meet the needs of operators. The distributed and multi-process implementation of control planes has become a development trend of the devices. The openness, diversity, and various services of traditional telecommunications have been continually migrated to IP bearers, resulting in the rapid launch of various new IP protocols and new services. In order to support the cutting of the protocol function, independent release version, and independent upgrade, the multi-process implementation is implemented, and the process is divided very finely, and even each protocol runs in a separate process space. Support protocol distributed operation, different protocol processes can run in different protocol processing units. In addition, the multi-process implementation method also solves the problem that the software components fail to interact with each other, avoiding the difficulty of developing functions and the stability of the version, and the slow convergence of the faults as the software scales up.

Each protocol runs on a different process, but some data information is required by each process, such as port information. In the case of more and more protocol processes running, if each process saves a duplicate data, it is a waste of memory resources. As operators' requirements for communication devices continue to increase and performance requirements continue to increase, the types of ports that devices need to support are increasing. The memory resources of the system are becoming increasingly scarce (the memory consumption is based on the number of ports). Increase in the form of the product of the number of protocol processes). FIG. 1 is a schematic diagram of a data synchronization model in the related art. As shown in FIG. 1 , in a manner of using a message to perform inter-process data synchronization, each process space applies for a memory to store a piece of data.

If each process uses shared memory to share access to data, it can greatly reduce system memory consumption. However, the shared memory supported by the operating system only provides the process to actively read and write to the shared memory. When the data in the shared memory changes, the related process cannot be passively aware in time, and only the changed data can be obtained in the subsequent active query. At this time, it is impossible to know which specific information fields have changed, and what is the value before the change. . This method is difficult to meet the implementation needs of some scenarios. For example, after the IP address is configured on the port and the IP information is written to the shared memory, the routing protocol process needs to detect the IP add event on the port and recalculate the route. Insert the fiber into the PPP port and update the physical UP status of the PPP port. After the shared memory is used, the PPP process needs to be aware of the physical UP event and negotiate with the peer device to establish a link. If each protocol periodically polls and checks the change of data, if the timing period is too long, the timeliness cannot be guaranteed. If the timing period is too short, the system performance is greatly consumed, which affects the processing capability of the device for normal services. And through the polling method, after the data is repaired or deleted, it can be found that the data before or before the modification has not been obtained.

When the shared memory is used by multiple processes in the related art, the problem of data change in the shared memory cannot be sensed in time, and an effective solution has not been proposed yet.

Summary of the invention

The present invention provides a data update processing method and apparatus, so as to at least solve the problem that the multi-process uses the shared memory in the related art, and cannot sense the data change in the shared memory in time.

According to an embodiment of the present invention, a data update processing method is provided, including: updating data in a shared memory; transmitting a completion message to the one or more threads that the update of the data in the shared memory is completed; The completion message provides the updated data in the shared memory to the one or more threads for service processing.

In the embodiment of the present invention, before updating the data in the shared memory, the method further includes: sending an indication message to the one or more threads, wherein the indication message is used to indicate the one or more threads The data is in an updated state.

According to another embodiment of the present invention, a data update processing method is provided, including: receiving a completion message for completing update of data in a shared memory; and accessing the data after completion of updating in the shared memory according to the completion message.

In the embodiment of the present invention, before receiving the completion message of the data update completion in the shared memory, the method further includes: receiving an indication message indicating that the data in the shared memory is in an update state;

And establishing, according to the indication message, an identifier that the data is in an updated state;

The identification is deleted after receiving a completion message for the completion of the update of the data in the shared memory.

In the embodiment of the present invention, before the updating of the data in the shared memory according to the completion message, the method further includes at least one of the following: receiving the data when the data in the shared memory is updated to add data. An indication message of a keyword having the data, creating null data corresponding to the keyword of the data, deleting the null data after adding data to the shared memory, and updating the data in the shared memory to If the data is modified or deleted, the indication message carrying the keyword of the data is received, the old data before the update in the shared memory is obtained according to the keyword of the data, and the backup is performed, and the shared memory is modified or deleted. After the data is completed, deleting the old data; when updating the data in the shared memory to one or more threads newly joining or restarting, receiving an indication message carrying the keyword of the data, according to the data The keyword is marked as the whole synchronization phase. The data has been created. After all the data in the shared memory is created, the overall synchronization is completed. After the news, delete all the created mark; in the case of shared memory data update process for the Source restart, that creates an empty data from the shared memory access data; or, for the following marks on Continue to access the aging flag of the data in the shared memory.

According to another embodiment of the present invention, there is provided a data update processing apparatus comprising: an update module configured to update data in a shared memory; and a first sending module configured to send a pair to one or more threads a completion message of the data update completion in the memory; providing a sending module, configured to provide the updated data in the shared memory to the one or more threads for service processing according to the completion message.

In an embodiment of the present invention, the apparatus further includes: a second sending module, configured to send an indication message to the one or more threads, wherein the indication message is used to indicate the one or more threads The data is in an updated state.

According to another embodiment of the present invention, there is provided a data update processing apparatus, comprising: a first receiving module configured to receive a completion message of completion of data update in a shared memory; and an access module configured to be based on the completion message Access the data in the shared memory after the update is complete.

In the embodiment of the present invention, the device further includes: a second receiving module, configured to receive an indication message for indicating that the data in the shared memory is in an updated state; and an establishing module, configured to establish, according to the indication message The identifier is in an update state; the deletion module is configured to delete the identifier after receiving the completion message for completing the update of the data in the shared memory.

In an embodiment of the present invention, the apparatus further includes at least one of the following: a first processing module configured to receive an indication of a keyword carrying the data in a case where data in the shared memory is updated to add data a message, creating null data corresponding to the keyword of the data, deleting the null data after adding data to the shared memory is completed; and the second processing module is configured to update the data in the shared memory to be modified or When the data is deleted, the indication message carrying the keyword of the data is received, the old data before the update in the shared memory is acquired according to the keyword of the data, and the backup is performed, and the data is modified or deleted in the shared memory. After the old data is deleted, the third processing module is configured to receive an indication message carrying the keyword of the data when the data in the shared memory is updated to be newly added or restarted by one or more threads. The data is created according to the keyword tag of the data as the overall synchronization phase, and after all the data in the shared memory is created, After the volume synchronization completion message, all created tags are deleted; the fourth processing module is configured to create null data for prohibiting access to data from the shared memory when the data in the shared memory is updated to the Source process restart. Or, an aging flag on the tag to continue accessing the data in the shared memory.

By the present invention, updating data in the shared memory is used; sending a completion message to the one or more threads for updating the data in the shared memory; and updating the updated data in the memory according to the completion message Providing the one or more threads for service processing, and solving the problem that the multi-process uses the shared memory in the related technology, the data change in the shared memory cannot be sensed in time, so that the state of the data in the shared memory can be known in time.

DRAWINGS

The drawings described herein are intended to provide a further understanding of the invention, and are intended to be a part of the invention. In the drawing:

1 is a schematic diagram of a data synchronization model in the related art;

2 is a flowchart 1 of a data update processing method according to an embodiment of the present invention;

3 is a second flowchart of a data update processing method according to an embodiment of the present invention;

4 is a block diagram 1 of a data update processing apparatus according to an embodiment of the present invention;

Figure 5 is a block diagram 1 of a data update processing apparatus in accordance with a preferred embodiment of the present invention;

6 is a block diagram 2 of a data update processing apparatus according to an embodiment of the present invention;

Figure 7 is a block diagram 2 of a data update processing apparatus in accordance with a preferred embodiment of the present invention;

Figure 8 is a block diagram 3 of a data update processing apparatus in accordance with a preferred embodiment of the present invention;

9 is a schematic diagram of a data synchronization model according to an embodiment of the present invention;

FIG. 10 is a schematic diagram of data addition in data synchronization according to an embodiment of the present invention; FIG.

11 is a schematic diagram of data modification in data synchronization according to an embodiment of the present invention;

FIG. 12 is a schematic diagram of data deletion in data synchronization according to an embodiment of the present invention; FIG.

FIG. 13 is a schematic diagram of overall synchronization in data synchronization according to an embodiment of the present invention; FIG.

FIG. 14 is a first schematic diagram of a source restart in data synchronization according to an embodiment of the present invention; FIG.

FIG. 15 is a second schematic diagram of a source restart in data synchronization according to an embodiment of the present invention; FIG.

16 is a first schematic diagram of a data synchronization model deployment according to an embodiment of the present invention;

17 is a second schematic diagram of a data synchronization model deployment according to an embodiment of the present invention;

18 is a third schematic diagram of a data synchronization model deployment according to an embodiment of the present invention;

19 is a fourth schematic diagram of a data synchronization model deployment according to an embodiment of the present invention;

20 is a fifth diagram of a data synchronization model deployment in accordance with an embodiment of the present invention.

detailed description

The invention will be described in detail below with reference to the drawings in conjunction with the embodiments. It should be noted that the embodiments in the present application and the features in the embodiments may be combined with each other without conflict.

In the embodiment, a data update processing method is provided. FIG. 2 is a flowchart 1 of a data update processing method according to an embodiment of the present invention. As shown in FIG. 2, the flow includes the following steps:

Step S202, updating data in the shared memory;

Step S204, sending a completion message to the one or more threads that the update of the data in the shared memory is completed;

Step S206, the updated data in the shared memory is provided to the one or more threads for service processing according to the completion message.

Through the above steps, updating the data in the shared memory, sending a completion message to the one or more threads that the update of the data in the shared memory is completed, and providing the updated data in the shared memory to the one according to the completion message. Or multiple threads perform business processing, which solves the problem that the multi-process uses the shared memory in the related technology, and cannot sense the data change in the shared memory in time, so that the state of the data in the shared memory can be known in time.

In the embodiment of the present invention, before updating the data in the shared memory, the method further includes: sending an indication message to the one or more threads, wherein the indication message is used to indicate that the one or more threads are updated. status.

The embodiment of the present invention further provides a data update processing method. FIG. 3 is a second flowchart of a data update processing method according to an embodiment of the present invention. As shown in FIG. 3, the method includes:

Step S302, receiving a completion message for completing the update of the data in the shared memory;

Step S304, accessing the data after the update in the shared memory is completed according to the completion message.

Through the above steps, receiving the completion message of the update of the data in the shared memory, and accessing the data after the update is completed in the shared memory according to the completion message, which solves the problem that the multi-process uses the shared memory in the related technology, and cannot sense the shared memory in time. The problem of data changes, so that the status of the data in the shared memory can be known in time.

In order to better know the state of the data in the shared memory, in an optional embodiment, before receiving the completion message of the data update completion in the shared memory, receiving is used to indicate that the data in the shared memory is in an updated state. The indication message is established according to the indication message; after receiving the completion message for completing the update of the data in the shared memory, deleting the identifier, and then determining the updated data of the data bits in the shared memory.

Before the data after the completion of the update in the shared memory is accessed according to the completion message, at least one of the following may be included: receiving an indication of the keyword carrying the data if the data in the shared memory is updated to add data Message, creating null data corresponding to the keyword of the data, adding data to the shared memory After deleting the null data; when updating the data in the shared memory to modify or delete the data, receiving an indication message carrying the keyword of the data, and acquiring the pre-update in the shared memory according to the keyword of the data The old data is backed up, and after the shared memory is modified or deleted, the old data is deleted; when the data in the shared memory is updated to one or more threads newly added or restarted, receiving the data carrying the data The indication message of the keyword, according to the keyword of the data, the data is created in the overall synchronization phase, and all the created tags are deleted after receiving the overall synchronization completion message after all the data in the shared memory is created; in the shared memory In the case where the data update in the source process is restarted, empty data for prohibiting access to data from the shared memory is created; or, an aging flag for continuing to access data in the shared memory is marked.

The embodiment of the present invention provides a data update processing device, which is used to implement the foregoing embodiments and preferred embodiments, and has not been described again. As used below, the term "module" may implement a combination of software and/or hardware of a predetermined function. Although the apparatus described in the following embodiments is preferably implemented in software, hardware, or a combination of software and hardware, is also possible and contemplated.

4 is a block diagram of a data update processing apparatus according to an embodiment of the present invention. As shown in FIG. 4, the method includes an update module 42, a first sending module 44, and a providing transmitting module 46. The following briefly describes each module.

An update module 42 configured to update data in the shared memory;

The first sending module 44 is configured to send a completion message to the one or more threads that the update of the data in the shared memory is completed;

The sending module 46 is configured to provide the updated data in the shared memory to the one or more threads for service processing according to the completion message.

FIG. 5 is a block diagram 1 of a data update processing apparatus according to a preferred embodiment of the present invention. As shown in FIG. 5, the apparatus further includes:

The second sending module 52 is configured to send an indication message to the one or more threads, wherein the indication message is used to indicate that the one or more threads are in an updated state.

The embodiment of the present invention further provides a data update processing apparatus. FIG. 6 is a block diagram 2 of a data update processing apparatus according to an embodiment of the present invention. As shown in FIG. 6, the method includes:

The first receiving module 62 is configured to receive a completion message for completing the update of the data in the shared memory;

The access module 64 is configured to access the data after the update in the shared memory is completed according to the completion message.

FIG. 7 is a block diagram 2 of a data update processing apparatus according to a preferred embodiment of the present invention. As shown in FIG. 7, the apparatus further includes:

The second receiving module 72 is configured to receive an indication that the data in the shared memory is in an updated state Message

The establishing module 74 is configured to establish, according to the indication message, an identifier that the data is in an updated state;

The delete module 76 is configured to delete the identity after receiving the completion message for the completion of the update of the data in the shared memory.

FIG. 8 is a block diagram 3 of a data update processing apparatus according to a preferred embodiment of the present invention. As shown in FIG. 8, the apparatus further includes at least one of the following:

The first processing module 82 is configured to: when the data in the shared memory is updated to add data, receive an indication message carrying the keyword of the data, and create null data corresponding to the keyword of the data, where After the shared memory is added, the empty data is deleted;

The second processing module 84 is configured to receive an indication message carrying the keyword of the data when the data in the shared memory is updated to modify or delete data, and obtain the update in the shared memory according to the keyword of the data. The old data is backed up, and after the shared memory is modified or deleted, the old data is deleted;

The third processing module 86 is configured to, when the data in the shared memory is updated to be newly added or restarted by one or more threads, receive an indication message carrying the keyword of the data, and mark the keyword according to the data as The data has been created during the overall synchronization phase, and all created tags are deleted after receiving the overall synchronization completion message after all the data in the shared memory is created.

The fourth processing module 88 is configured to: create a blank data for prohibiting access to data from the shared memory when the data in the shared memory is updated to the source process, or to continue to access the shared memory The aging mark of the data.

The embodiment of the present invention is further described by taking one or more threads as a Reader as an example.

The optional embodiment enables related processes that need to access the shared memory to sense the events of adding, modifying, and deleting data in the shared memory in time, and control the access of the data in the shared memory according to the event. The process can not access the data in the shared memory before the data addition event is perceived, and the data can be accessed only after the data addition event is perceived; before the data modification event is perceived, the process can only access the data before the modification, and the data is perceived. When the event is modified, the data before and after the modification can be accessed at the same time (the data before and after the modification can be compared), and after the modification event is perceived, the process can access the modified data; before the data deletion event is sensed, the process You can access the data in the shared memory, and after you perceive the data deletion event, you cannot access the data in the shared memory. For the case of a process restart, the process also controls the access of the process to the shared memory. The method can participate in the process of adding, modifying, and deleting shared memory data, so that the process can perform related logic processing in time, and can obtain required data information during processing.

The optional embodiment provides a data synchronization method based on shared memory, and the data is sent in the shared memory. When the change occurs, the relevant process can be notified in time, and the coordination process can perform relevant logic processing in time, that is, the required data can be accessed during processing, and new data can be acquired for the new data addition; for the data modification, the modification can be obtained. Pre- and modified data; for data deletion, data that is about to be deleted can be obtained. While reducing the memory overhead, it also satisfies the requirements of various application scenarios, and achieves the same effect as the method of synchronizing data between processes using messages.

The following three roles based on the shared memory data synchronization method model are described below.

Source Source, the source of data generation, accepts Writer and Reader registration.

The writer Writer is responsible for writing the data generated by the Source to the shared memory.

Reader Reader, a process (or thread) that needs to access shared memory data, such as protocol processes.

Source is the source of data generation. It can be a separate process in which a source of data is stored. Source accepts the registration of Writer and Reader, and maintains the registration information of Writer and Reader on each CPU in CPU units. There can be multiple Readers on a single CPU, but only one Writer can exist. When the source data in the Source is added, modified, or deleted, the data is synchronized to the Reader through the shared memory mode, so that the Reader can perceive the data addition, modification, and deletion events. The Writer is the process (or thread) responsible for writing to the shared memory. When the source data is added, modified, or deleted, the data changes are written to the shared memory. Reader is a process that needs to access shared memory data and has read-only access to shared memory. For example, routing processes, PPP processes, and other protocol processes. In addition, LOD (Local Old Database) is a local "old data" library, and the "old data" before modification is saved in each Reader local process space before the shared memory data is modified. LND (Local Null Database) is a local "empty data" library. Before the shared memory data is created, the "empty data" of the corresponding data is created in each Reader local process space to indicate that the corresponding data has not been created yet. When there is "empty data" locally in a process, even if the corresponding data already exists in the shared memory, the process is not visible.

9 is a schematic diagram of a data synchronization model according to an embodiment of the present invention. As shown in FIG. 9, when data is added, modified, or deleted in the Source, each Reader is first notified to perform preprocessing. After all Reader preprocessing is completed, the Writer is notified to update the sharing. The data in the memory, after the Writer operation is completed, the Source notifies each Reader that the update is completed, and the Reader performs the corresponding business logic processing.

FIG. 10 is a schematic diagram of data addition in data synchronization according to an embodiment of the present invention. As shown in FIG. 10, the source sends a keyword of the data to the Reader through a message, and notifies the Reader to create “empty data” corresponding to the keyword in the LND. To indicate that the data corresponding to the keyword has not been created (even if it exists in the shared memory, it is not visible); after all Reader has created "empty data", the Source notifies the Writer to create new data in the shared memory, after the completion of the Source Then notify Reader to complete the creation, Reader does the new data creation logic processing, and deletes the "empty data" corresponding to the keyword, indicating that the data corresponding to the keyword has been created, and the subsequent Reader This data can be accessed directly from shared memory.

11 is a schematic diagram of data modification in data synchronization according to an embodiment of the present invention. As shown in FIG. 11, the source sends a keyword of the data to the Reader through a message, and the Reader queries the old data before the modification in the shared memory by using a keyword. ", and back up the "old data" to the LOD local to the Reader process to indicate that the data in the shared memory is in an unstable state and is changing (Reader can only query the LOD when there is "old data" in the LOD) The "old data", the corresponding data in the shared memory is not visible). The Source notifies the Writer to modify the data in the shared memory, and then notifies the Reader that the data modification is completed. The Reader performs the data modification logic processing (at this time, the "old data" in the LOD and the modified data in the shared memory can be accessed,) And delete the "old data" backed up in the LOD, indicating that the data corresponding to the keyword has been modified, and is currently in a stable state, and the subsequent Reader can directly access the data from the shared memory.

FIG. 12 is a schematic diagram of data deletion in data synchronization according to an embodiment of the present invention. As shown in FIG. 12, the process of data backup performed by Reader is similar to the backup process performed when data is modified. Source sends the data key to Reader through the message. Reader queries the data from the shared memory by keyword and backs up the data to the local LOD of the Reader process to indicate that the data in the shared memory is unstable. delete. The Source notifies the Writer to delete the data in the shared memory, and then notifies the Reader that the deletion is completed. The Reader performs the data deletion logic processing (in this case, the data information to be deleted is queried), and the backup data in the LOD is deleted, indicating the key. The data corresponding to the word has been deleted. Subsequent Reader will not query the data corresponding to the keyword in the shared memory.

13 is a schematic diagram of overall synchronization in data synchronization according to an embodiment of the present invention. As shown in FIG. 13, for a case where data already exists in the shared memory and a new Reader is added, the Reader has not perceived the creation of the corresponding data. There is no new data creation logic processing, and the Reader is not allowed to access the data in the shared memory at this time. The data that already exists in the shared memory needs to be synchronized to the Reader once, and the Reader perceives the data creation event before accessing the data in the shared memory.

For the newly added Reader, the synchronization status is marked as the overall synchronization phase, and the Source directly sends the existing data key to the Reader, so that the Reader perceives the creation event. For data that has already received a creation event, Reader creates a corresponding record locally, with the "created" tag. For data with "created" records, Reader can query the data in shared memory, otherwise the data in shared memory is not visible to the Reader. The Source notifies the Reader that all the data has been created, and notifies the Reader that the synchronization is complete. The Reader will synchronize the status flag to change the synchronization phase and delete all the local "created" records.

When the Reader restarts, when the Reader process exits, the Source deletes the Reader from the registration list, and the data can continue to synchronize with other Readers. After the Reader gets up, it re-registers with the Source, and the Source synchronizes the data to the Reader according to the overall synchronization process. During a Reader restart, Source can synchronize data to other Readers without affecting other Readers.

Source restart: For the restart of the source process, the following two implementation modes can be used according to the scenario.

14 is a schematic diagram 1 of a source restart in data synchronization according to an embodiment of the present invention. As shown in FIG. 14, when the reader perceives that the Source exits, it traverses all the data in the shared memory, performs data deletion logic processing, and creates in the LND. Corresponding "empty data", subsequent access to the corresponding data from shared memory. After the Writer senses that the Source exits, it puts an "aging" flag on the data in the shared memory. After the Source process is restarted, the data is restored and a "data addition" synchronization process is performed to Reader and Writer. The source sends the keyword of the data to the Reader through the message. The Reader creates the "empty data" corresponding to the keyword in the LND. If the corresponding "empty data" already exists in the LND, the processing step is skipped. After all Reader has created "empty data", the Source notifies the Writer to create data in the shared memory. If the corresponding data already exists in the shared memory, the data in the shared memory is directly updated, and the "aging" of the data is removed. mark. After the Writer finishes creating or updating the shared memory data, the Source notifies the Reader to complete the creation. The Reader performs the data creation logic processing and deletes the corresponding "empty data", indicating that the data corresponding to the keyword has been created, and the subsequent Reader can directly Access this data from shared memory. The data in the Source is restored, and after the synchronization is completed, the Reader and the Writer are notified to perform "junk" data processing, the Reader deletes the "empty data" still existing in the LND, and the Writer deletes the data in the shared memory that still has the "aging" flag.

FIG. 15 is a second schematic diagram of a source restart in data synchronization according to an embodiment of the present invention. As shown in FIG. 15, after the reader perceives that the source exits, it traverses all data in the shared memory, and locally creates a corresponding record, and puts on “aging”. Marked, you can continue to access data in shared memory. After the Writer senses that the Source exits, it puts an "aging" flag on the data in the shared memory. After the source process is restarted, the data is restored again, and the "data addition" or "data modification" synchronization process is performed to the Reader and the Writer. The Source sends the keyword of the data to the Reader through the message. If the Reader already has the corresponding record with the "Aging" mark, the "Old Data" in the shared memory is backed up to the local LOD, and the "Aging" mark record is deleted. Otherwise, Reader creates the "empty data" corresponding to the keyword in the LND. After all Reader is preprocessed, the Source notifies the Writer to create data in the shared memory. At this time, if the corresponding data already exists in the shared memory, the data in the shared memory is directly updated, and the "aging" flag of the data is removed. After the Writer finishes creating or updating the shared memory data, the Source notifies the Reader to create or update. For the case of "empty data", Reader does the data creation logic processing and deletes the corresponding "empty data"; for the existence of "old data" In the case, Reader does the data modification logic and deletes the "old data". After the data is recovered in the source, and the synchronization is completed, the Reader is first notified to perform "junk" data processing, and the Reader performs the delete logic processing on the data still having the "aged" mark record (at this time, the data in the shared memory can still be queried), and Delete the "aging" tag record. After Reader processes the "junk" data, Source notifies Writer to perform "junk" data processing, and deletes the data of "aged" mark in shared memory.

When using this method for data synchronization, related processes can perceive the addition, modification, and deletion of data. And can obtain the corresponding data information when the corresponding logic processing is performed. Achieve the same effect as using data to synchronize data between processes. The business in the process does not care about how the data is synchronized, just focus on its own business logic processing. When the data is in a stable state, only the Source process and the shared memory will apply for memory to save data. As shown in Figure 9, the Reader local process space no longer applies for memory to save data, and the system memory overhead is not proportional to the number of processes. Compared to the way of using messages to synchronize between processes, the system memory overhead is greatly saved.

In contrast to the three roles in the above-mentioned shared memory-based data synchronization model, when implementing the deployment, only the principle that the Writer and the Reader are distributed on the same CPU are required, and the deployment has greater flexibility. In a single CPU environment, you only need to set up a Writer. In a multi-CPU environment, you can set a Writer on each CPU. For the three roles, you can also flexibly set them according to actual needs. There are many different deployment methods that can be used in a centralized and distributed environment. The following is an example.

FIG. 16 is a first schematic diagram of a data synchronization model deployment according to an embodiment of the present invention. As shown in FIG. 16, in a centralized environment, a shared memory writer process (Writer) is independently set up, and is responsible for operating shared memory data. Multiple Readers can be in the same process or in different processes. The process in which Reader is located and the Writer process map to the same shared memory space.

17 is a schematic diagram 2 of a data synchronization model deployment according to an embodiment of the present invention. As shown in FIG. 17, in a centralized environment, a Writer and a Source are in the same process, and a Writer is used as a thread in the Source process to operate the shared memory. . Multiple Readers can be in the same process or distributed in different processes. The process in which Reader is located and the Writer process are mapped to the same shared memory space.

FIG. 18 is a third schematic diagram of a data synchronization model deployment according to an embodiment of the present invention. As shown in FIG. 18, in a distributed environment, a Writer and a Source on an R-CPU are in the same process, and a separate Writer is deployed in the L-CPU. The process provides data services for Reader on each CPU. Two threads in process B enable shared memory at the same time, but only occupy a linear space. Source still sees two Readers.

FIG. 19 is a schematic diagram 4 of a data synchronization model deployment according to an embodiment of the present invention. As shown in FIG. 19, in a distributed environment, each CPU independently sets a shared memory write process (Writer), which is responsible for shared memory writes on respective CPUs. Operation, providing data services for Reader on their respective CPUs.

FIG. 20 is a schematic diagram 5 of a data synchronization model deployment according to an embodiment of the present invention. As shown in FIG. 20, in the case of multiple Sources, different data may have different Sources, but a Writer is responsible for writing shared memory. In a centralized environment, multiple Sources can be in different processes or in different threads of the same process. In a distributed environment, multiple Sources can be on the same CPU or on different CPUs. The deployment mode for two sources in a centralized environment when they are in different processes.

Obviously, those skilled in the art should understand that the above various modules or steps of the present invention can be used universally. Implemented by computing devices, which may be centralized on a single computing device or distributed over a network of computing devices. Alternatively, they may be implemented in program code executable by the computing device, such that They are stored in a storage device and are executed by the computing device, and in some cases, the steps shown or described may be performed in an order different than that herein, or they may be separately fabricated into individual integrated circuit modules, or Multiple modules or steps in the fabrication are implemented as a single integrated circuit module. Thus, the invention is not limited to any specific combination of hardware and software.

The above description is only the preferred embodiment of the present invention, and is not intended to limit the present invention, and various modifications and changes can be made to the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and scope of the present invention are intended to be included within the scope of the present invention.

Industrial applicability

According to the foregoing technical solution provided by the embodiment of the present invention, the data in the shared memory is updated; the completion message of completing the update of the data in the shared memory is sent to one or more threads; and the shared memory is shared according to the completion message. The updated data is provided to the one or more threads for service processing, and solves the problem that the multi-process uses the shared memory in the related technology, and the data change in the shared memory cannot be sensed in time, so that the shared memory can be known in time. The status of the data.

Claims

A data update processing method includes:

Update data in shared memory;

Sending a completion message to the one or more threads that the update of the data in the shared memory is complete;

And updating the updated data in the shared memory to the one or more threads for service processing according to the completion message.
The method of claim 1 further comprising: prior to updating said data in the shared memory:

Sending an indication message to the one or more threads, wherein the indication message is used to indicate that the one or more threads are in an updated state.
A data update processing method includes:

Receiving a completion message that the update of the data in the shared memory is completed;

The data after the completion of the update in the shared memory is accessed according to the completion message.
The method of claim 3, further comprising: before receiving the completion message of the update of the data in the shared memory:

Receiving an indication message indicating that the data in the shared memory is in an updated state;

And establishing, according to the indication message, an identifier that the data is in an updated state;

The identification is deleted after receiving a completion message for the completion of the update of the data in the shared memory.
The method according to claim 3, wherein at least one of the following is included before the updated data in the shared memory is accessed according to the completion message:

When updating the data in the shared memory to add data, receiving an indication message carrying the keyword of the data, creating null data corresponding to the keyword of the data, and adding data to the shared memory is completed. After deleting the empty data;

When the data in the shared memory is updated to modify or delete the data, the indication message carrying the keyword of the data is received, and the old data before the update in the shared memory is obtained according to the keyword of the data and is backed up. After the shared memory is modified or deleted, the old data is deleted;

In the case that the data in the shared memory is updated to one or more threads newly added or restarted, an indication message carrying the keyword carrying the data is received, and the data according to the data is marked as the data in the overall synchronization phase. Created, after the completion of all data in the shared memory is created, the overall synchronization is completed. After deleting the message, delete all created tags;

In the case where the data update in the shared memory is restarted by the Source process, empty data for prohibiting access to the data from the shared memory is created; or an aging flag for continuing access to the data in the shared memory is marked.
A data update processing device includes:

Update module, set to update data in shared memory;

a first sending module, configured to send a completion message to the one or more threads that the update of the data in the shared memory is completed;

Providing a sending module, configured to provide the updated data in the shared memory to the one or more threads for service processing according to the completion message.
The apparatus of claim 6 wherein said apparatus further comprises:

And a second sending module, configured to send an indication message to the one or more threads, wherein the indication message is used to indicate that the one or more threads are in an updated state.
A data update processing device includes:

a first receiving module, configured to receive a completion message for completing data update in the shared memory;

The access module is configured to access the data after the update in the shared memory is completed according to the completion message.
The apparatus of claim 8 wherein said apparatus further comprises:

a second receiving module, configured to receive an indication message indicating that the data in the shared memory is in an updated state;

Establishing a module, configured to establish, according to the indication message, an identifier that the data is in an updated state;

The delete module is set to delete the identifier after receiving a completion message for completing the update of the data in the shared memory.
The apparatus of claim 8 wherein said apparatus further comprises at least one of:

The first processing module is configured to: when the data in the shared memory is updated to add data, receive an indication message carrying the keyword of the data, and create null data corresponding to the keyword of the data, where After the shared memory is added, the null data is deleted;

a second processing module, configured to: when the data in the shared memory is updated to modify or delete data, receive an indication message carrying the keyword of the data, and obtain a share according to the keyword of the data. The old data before the update in the memory is backed up, and after the shared memory is modified or deleted, the old data is deleted;

a third processing module, configured to: when the data in the shared memory is updated to one or more threads newly added or restarted, receive an indication message carrying the keyword of the data, and mark the keyword according to the data The data has been created for the overall synchronization phase, and all created tags are deleted after receiving the overall synchronization completion message after all the data in the shared memory is created.

a fourth processing module, configured to create null data for prohibiting access to data from the shared memory in a case where the data in the shared memory is updated to be restarted by the source process; or, the mark is used to continue accessing the share An aging token for in-memory data.