CN107391285B - Memory sharing method and system - Google Patents

Memory sharing method and system Download PDF

Info

Publication number
CN107391285B
CN107391285B CN201710731296.8A CN201710731296A CN107391285B CN 107391285 B CN107391285 B CN 107391285B CN 201710731296 A CN201710731296 A CN 201710731296A CN 107391285 B CN107391285 B CN 107391285B
Authority
CN
China
Prior art keywords
data structure
shared
data
shared memory
memory
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201710731296.8A
Other languages
Chinese (zh)
Other versions
CN107391285A (en
Inventor
伍云云
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Midea Group Co Ltd
Midea Smart Home Technology Co Ltd
Original Assignee
Midea Group Co Ltd
Midea Smart Home Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Midea Group Co Ltd, Midea Smart Home Technology Co Ltd filed Critical Midea Group Co Ltd
Priority to CN201710731296.8A priority Critical patent/CN107391285B/en
Publication of CN107391285A publication Critical patent/CN107391285A/en
Application granted granted Critical
Publication of CN107391285B publication Critical patent/CN107391285B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/54Interprogram communication
    • G06F9/544Buffers; Shared memory; Pipes

Abstract

The invention provides a memory sharing method and a memory sharing system, wherein the method comprises the following steps: the method comprises the steps that a first process writes shared data adopting a first data structure into a shared memory, the first process indicates the first data structure to a second process adopting a second data structure, the second process reads the shared memory to obtain the shared data of the first data structure, and the second process analyzes the shared data of the first data structure according to the first data structure indicated by the first process to obtain the shared data of the second data structure. In the invention, different first data structures and second data structures are respectively adopted in the first process and the second process, so that data communication among the processes is realized, and the problem that the shared memory cannot be flexibly used due to the fact that the shared data structure in the shared memory area is a certain specific data structure and the data structure is single in the prior art is solved.

Description

Memory sharing method and system
Technical Field
The present invention relates to the field of computer technologies, and in particular, to a memory sharing method and system.
Background
With the development of the software industry, the communication means of the processes in the system is more and more complex, but the most effective communication means among the processes is shared memory. Shared memory refers to memory that can be shared by more processes, which is described as a mapping of one region (segment) of memory. A process is a running instance of an application and is a dynamic execution of the application. The shared memory is operated by multiple processes, namely, data in the shared memory is read or written into the shared memory, and the multiple processes can realize communication among the processes through the shared memory.
Currently, the shared memory can only perform memory sharing for a specific data structure, resulting in a single object data structure shared in the shared memory area.
Disclosure of Invention
The present invention is directed to solving, at least to some extent, one of the technical problems in the related art.
Therefore, a first objective of the present invention is to provide a memory sharing method, so as to implement data communication between processes by respectively adopting different first data structures and second data structures in a first process and a second process, and solve the problem in the prior art that a shared memory cannot be flexibly used because a shared data structure in a shared memory area is a specific data structure and the data structure is relatively single.
A second objective of the present invention is to provide a memory sharing system.
A third object of the invention is to propose a computer device.
A fourth object of the invention is to propose a non-transitory computer-readable storage medium.
A fifth object of the invention is to propose a computer program product.
To achieve the above object, an embodiment of a first aspect of the present invention provides a memory sharing method, including:
writing shared data adopting a first data structure into the shared memory by a first process;
the first process indicating the first data structure to a second process employing a second data structure;
the second process reads the shared memory to obtain shared data of the first data structure;
and according to the first data structure indicated by the first process, the second process analyzes the shared data of the first data structure to obtain the shared data of a second data structure.
In the memory sharing method of this embodiment, a first process writes shared data in a first data structure into a shared memory, the first process indicates the first data structure to a second process in a second data structure, the second process reads the shared memory to obtain shared data in the first data structure, and the second process parses the shared data in the first data structure according to the first data structure indicated by the first process to obtain shared data in the second data structure. In the invention, under the condition that different first data structures and second data structures are respectively adopted in the first process and the second process, the first process informs the second process of the adopted first data structure, so that the second process can analyze the shared data written in by the first process, the memory sharing and the data communication among the processes are realized, and the problem that the shared memory cannot be flexibly used due to the fact that the shared data structure in the shared memory area is a certain specific data structure and the data structure is single in the prior art is solved.
To achieve the above object, a second aspect of the present invention provides a memory sharing system, including:
a first process and a second process.
The first process is used for writing shared data adopting a first data structure into the shared memory; indicating the first data structure to a second process employing a second data structure;
the second process is used for reading the shared memory to obtain shared data of the first data structure; and analyzing the shared data of the first data structure according to the first data structure indicated by the first process to obtain the shared data of a second data structure.
In the memory sharing system of this embodiment, a first process writes shared data in a first data structure into a shared memory, the first process indicates the first data structure to a second process in a second data structure, the second process reads the shared memory to obtain shared data in the first data structure, and the second process parses the shared data in the first data structure according to the first data structure indicated by the first process to obtain shared data in the second data structure. In the invention, under the condition that different first data structures and second data structures are respectively adopted in the first process and the second process, the first process informs the second process of the adopted first data structure, so that the second process can analyze the shared data written in by the first process, the memory sharing and the data communication among the processes are realized, and the problem that the shared memory cannot be flexibly used due to the fact that the shared data structure in the shared memory area is a certain specific data structure and the data structure is single in the prior art is solved.
To achieve the above object, an embodiment of a third aspect of the present invention provides a computer device, including a storage, a processor, and a computer program stored in the storage and executable on the processor, where the processor runs a first process and a second process, and when the first process and the second process execute the program, the memory sharing method according to the embodiment of the first aspect is implemented.
In order to achieve the above object, a fourth aspect of the present invention provides a non-transitory computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a first process and a second process run by a processor, the memory sharing method according to the first aspect of the present invention is implemented.
In order to achieve the above object, an embodiment of a fifth aspect of the present invention provides a computer program product, where instructions in the computer program product are executed by a processor, the processor runs a first process and a second process, and when the first process and the second process execute the program, the memory sharing method according to the embodiment of the first aspect is implemented.
Additional aspects and advantages of the invention will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the invention.
Drawings
The foregoing and/or additional aspects and advantages of the present invention will become apparent and readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings of which:
fig. 1 is a schematic flowchart illustrating a memory sharing method according to an embodiment of the present invention;
fig. 2 is a schematic flowchart illustrating another memory sharing method according to an embodiment of the present invention;
fig. 3 is a schematic flowchart illustrating inter-process interaction of memory sharing according to an embodiment of the present invention; and
fig. 4 is a schematic structural diagram of a memory sharing system according to an embodiment of the present invention.
Detailed Description
Reference will now be made in detail to embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to the same or similar elements or elements having the same or similar function throughout. The embodiments described below with reference to the drawings are illustrative and intended to be illustrative of the invention and are not to be construed as limiting the invention.
The following describes a memory sharing method and system according to an embodiment of the present invention with reference to the drawings.
Fig. 1 is a flowchart illustrating a memory sharing method according to an embodiment of the present invention.
As shown in fig. 1, the method comprises the steps of:
step S101, the first process writes shared data in the first data structure into the shared memory.
The shared memory is an efficient Inter-process communication mode and is also the fastest Inter-process communication (IPC) mode, where the shared memory refers to a mode in which the same physical memory is mapped between at least two different processes, and at least two processes can see the update of data in the shared memory by the other party instantly. For convenience of distinction, two different processes are respectively referred to as a first process and a second process, and a first data structure and a second data structure are respectively adopted in the first process and the second process, wherein the first data structure and the second data structure are different types of data structures. It should be noted that the first process and the second process are relative concepts.
Specifically, the first process maps a segment of physical memory into an address space of the first process, and then the first process writes the shared data in the first data structure into the shared memory.
In step S102, a first process indicates a first data structure to a second process that employs a second data structure.
Specifically, the shared memory stores information of a first data structure, the first data structure is stored at a position corresponding to the offset address, the first process sends the offset address of the shared memory to the second process, and if the second process successfully reads the information of the first data structure according to the offset address, the second process sends an offset address response message to the first process.
The information of the first data structure at least comprises the incidence relation of the data structure and the type of the data structure, and the pointer of the incidence relation of the data structure points to the data block of the data structure.
Step S103, the second process reads the shared memory to obtain the shared data of the first data structure.
Specifically, the second process maps the same segment of physical memory into an address space of the second process, so as to realize memory sharing with the first process, shared data of the first process adopting the first data structure is stored in the shared memory, and the shared data of the first data structure can be read by the second process accessing the shared memory.
And step S104, according to the first data structure indicated by the first process, the second process analyzes the shared data of the first data structure to obtain the shared data of the second data structure.
Specifically, the second process reads the information of the first data structure from the shared memory, so as to obtain the type of the data structure of the first data structure and the association relationship of the data structure, and the second process analyzes the shared data of the first data structure obtained from the shared memory according to the first data structure, converts the shared data into shared data of the second data structure, and thus realizes data sharing.
In the memory sharing method of this embodiment, a first process writes shared data in a first data structure into a shared memory, the first process indicates the first data structure to a second process in a second data structure, the second process reads the shared memory to obtain shared data in the first data structure, and the second process parses the shared data in the first data structure according to the first data structure indicated by the first process to obtain shared data in the second data structure. In the invention, under the condition that different first data structures and second data structures are respectively adopted in the first process and the second process, the first process informs the second process of the adopted first data structure, so that the second process can analyze the shared data written in by the first process, the memory sharing and the data communication among the processes are realized, and the problem that the shared memory cannot be flexibly used due to the fact that the shared data structure in the shared memory area is a certain specific data structure and the data structure is single in the prior art is solved.
Based on the foregoing embodiments, this embodiment further provides a possible memory sharing method, which further clearly explains that the shared memory can share any data structure form, and fig. 2 is a schematic flow chart of another memory sharing method proposed in this embodiment of the present invention, as shown in fig. 2, the method may include the following steps:
in step S201, the first process interacts with the second process to establish a shared memory.
Before data sharing is carried out between a first process and a second process, a shared memory needs to be established first, so that communication between the processes and data sharing are achieved. And then, the first process sends a shared memory establishing message carrying shared memory attribute information to the second process, and the second process sends a shared memory establishing confirming message to the first process when receiving the attribute message carried by the shared memory establishing message, so that the shared memory is successfully established between the first process and the second process.
In step S202, the first process writes the shared data in the first data structure and writes the information in the first data structure into the shared memory.
Specifically, the first process writes the shared data in the first data structure into the shared memory, that is, the shared memory is allocated with a fixed storage area to store the shared data in the first data structure.
The first data structure at least comprises the incidence relation of the data structure and the type of the data structure, and the pointer of the incidence relation of the data structure points to the data block of the data structure.
In step S203, the first process sends the written shared data and the offset address of the information of the first data structure to the second process.
Specifically, the first process stores the information of the first data structure and the shared data corresponding to the first data structure in the shared memory. As a possible implementation manner, the pointer variable of each process may point to a fixed storage location of the shared memory, or as another possible implementation manner, the pointer variable may point to a location of a last read-write operation, and in any manner, the first process may employ a manner of sending an offset address, so that the second process reads information of the shared data and the first data structure according to the offset address.
Optionally, the first process sends the offset address of the shared memory to the second process through a message queue, where a message queue is composed of a certain number of message buffers with fixed sizes, and the first process may send the offset address message of the shared memory to the message queue, and the message queue transmits the message to the second process.
And step S204, the second process reads the information of the first data structure according to the offset address and sends an offset address response message to the first process.
Specifically, the second process reads the first data structure from the specified storage area of the shared memory according to the obtained offset address of the shared memory, and sends a response message for reading the first data structure to the first process.
In step S205, the second process reads the shared memory to obtain the shared data of the first data structure.
Specifically, after the second process reads the first data structure of the first process, the shared data of the first data structure stored in the position corresponding to the offset address of the shared memory is further read.
Step S206, according to the first data structure indicated by the first process, the second process analyzes the shared data of the first data structure to obtain the shared data of the second data structure.
Specifically, the second process performs structure analysis on shared data acquired from the shared memory by using the first data structure according to the acquired first data structure of the first process, and converts the shared data into a second data structure of a second data structure type, thereby realizing sharing of data of any data structure.
It should be understood that the first data structure and the second data structure are different data structures, and the type of the first data structure and the association relationship of the data structure, which are included in the information of the first data structure, are used to instruct the second process to parse the shared data using the first data structure, and then convert the shared data into the data of the second data structure.
In the memory sharing method of this embodiment, a first process writes shared data in a first data structure into a shared memory, the first process indicates the first data structure to a second process in a second data structure, the second process reads the shared memory to obtain shared data in the first data structure, and the second process parses the shared data in the first data structure according to the first data structure indicated by the first process to obtain shared data in the second data structure. In the invention, under the condition that different first data structures and second data structures are respectively adopted in the first process and the second process, the first process informs the second process of the adopted first data structure, so that the second process can analyze the shared data written in by the first process, the memory sharing and the data communication among the processes are realized, and the problem that the shared memory cannot be flexibly used due to the fact that the shared data structure in the shared memory area is a certain specific data structure and the data structure is single in the prior art is solved. On the basis of the foregoing embodiment, the present invention further provides a method for inter-process interaction of memory sharing, fig. 3 is a schematic flow chart of inter-process interaction of memory sharing provided in the embodiment of the present invention, and as shown in fig. 3, the interaction flow includes the following steps:
in step S301, the first process sends a message requesting to establish a shared memory to the second process.
Specifically, the first process calls a shmget () function to obtain a shared memory region in the memory according to the data information to be transmitted, and sends a message requesting to establish a shared memory to the second process, where the message may include: and establishing the name of the shared memory, the required capacity of the shared memory and the storage area of the shared memory.
In step S302, the second process sends a shared memory determination establishment request message to the first process.
Specifically, the second process feeds back a message that the first process can establish the shared memory.
Step S303, the first process sends a shared memory setup message to the second process.
Specifically, the first process calls a function shmat () to map the shared memory into the memory space of the first process, and sends a shared memory setup message to the second process.
In step S304, the second process sends a message for determining establishment of the shared memory to the first process.
Specifically, the second process maps the shared memory area to the memory space of the second process, so as to implement connection between the second process and the shared memory, and the second process feeds back a shared memory establishment message to the first process, thereby completing establishment of the shared memory.
In step S305, the first process writes the shared data of the first data structure into the shared memory.
In step S306, the first process sends the offset address of the shared memory to the second process.
In step S307, the second process sends a message confirming receipt of the offset address to the first process.
In step S308, the second process obtains the shared data of the first data structure from the shared memory.
Step S309, the second process analyzes the shared data of the first data structure to obtain the shared data of the first data structure.
Step S305 to step S309 can refer to step S202 to step S206 of the corresponding embodiment of fig. 2, and the implementation principle is the same, which is not described herein again.
In the memory sharing method of this embodiment, a first process writes shared data in a first data structure into a shared memory, the first process indicates the first data structure to a second process in a second data structure, the second process reads the shared memory to obtain shared data in the first data structure, and the second process parses the shared data in the first data structure according to the first data structure indicated by the first process to obtain shared data in the second data structure. In the invention, under the condition that different first data structures and second data structures are respectively adopted in the first process and the second process, the first process informs the second process of the adopted first data structure, so that the second process can analyze the shared data written in by the first process, the memory sharing and the data communication among the processes are realized, and the problem that the shared memory cannot be flexibly used due to the fact that the shared data structure in the shared memory area is a certain specific data structure and the data structure is single in the prior art is solved.
To clearly illustrate the above embodiment, the present embodiment provides a memory sharing system, and fig. 4 is a schematic structural diagram of the memory sharing system according to the embodiment of the present invention, as shown in fig. 4, the system includes: a first process 41 and a second process 42.
The first process 41 is configured to write shared data in a first data structure into the shared memory, and indicate the first data structure to the second process 42 in a second data structure.
The second process 42 is configured to read the shared memory, obtain shared data of the first data structure, and analyze the shared data of the first data structure according to the first data structure indicated by the first process 41, to obtain shared data of the second data structure.
It should be noted that the above explanation of the method embodiment is also applicable to the system of this embodiment, and is not repeated here.
In the memory sharing system of this embodiment, a first process writes shared data in a first data structure into a shared memory, the first process indicates the first data structure to a second process in a second data structure, the second process reads the shared memory to obtain shared data in the first data structure, and the second process parses the shared data in the first data structure according to the first data structure indicated by the first process to obtain shared data in the second data structure. In the invention, under the condition that different first data structures and second data structures are respectively adopted in the first process and the second process, the first process informs the second process of the adopted first data structure, so that the second process can analyze the shared data written in by the first process, the memory sharing and the data communication among the processes are realized, and the problem that the shared memory cannot be flexibly used due to the fact that the shared data structure in the shared memory area is a certain specific data structure and the data structure is single in the prior art is solved.
In order to implement the foregoing embodiments, the present invention provides a computer device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor runs a first process and a second process, and when the first process and the second process execute the program, the memory sharing method described in the foregoing method embodiments is implemented.
In order to implement the foregoing embodiments, the present invention further provides a non-transitory computer-readable storage medium, on which a computer program is stored, and when a first process and a second process run by a processor execute the computer program, the memory sharing method described in the foregoing method embodiments is implemented.
In order to implement the foregoing embodiments, the present invention further provides a computer program product, where instructions in the computer program product are executed by a processor, the processor runs a first process and a second process, and when the first process and the second process execute the program, the memory sharing method described in the foregoing method embodiments is implemented.
In the description herein, references to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, various embodiments or examples and features of different embodiments or examples described in this specification can be combined and combined by one skilled in the art without contradiction.
Furthermore, the terms "first", "second" and "first" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. In the description of the present invention, "a plurality" means at least two, e.g., two, three, etc., unless specifically limited otherwise.
Any process or method descriptions in flow charts or otherwise described herein may be understood as representing modules, segments, or portions of code which include one or more executable instructions for implementing steps of a custom logic function or process, and alternate implementations are included within the scope of the preferred embodiment of the present invention in which functions may be executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those reasonably skilled in the art of the present invention.
The logic and/or steps represented in the flowcharts or otherwise described herein, e.g., an ordered listing of executable instructions that can be considered to implement logical functions, can be embodied in any computer-readable medium for use by or in connection with an instruction execution system, apparatus, or device, such as a computer-based system, processor-containing system, or other system that can fetch the instructions from the instruction execution system, apparatus, or device and execute the instructions. For the purposes of this description, a "computer-readable medium" can be any means that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. More specific examples (a non-exhaustive list) of the computer-readable medium would include the following: an electrical connection (electronic device) having one or more wires, a portable computer diskette (magnetic device), a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disc read-only memory (CDROM). Additionally, the computer-readable medium could even be paper or another suitable medium upon which the program is printed, as the program can be electronically captured, via for instance optical scanning of the paper or other medium, then compiled, interpreted or otherwise processed in a suitable manner if necessary, and then stored in a computer memory.
It should be understood that portions of the present invention may be implemented in hardware, software, firmware, or a combination thereof. In the above embodiments, the various steps or methods may be implemented in software or firmware stored in memory and executed by a suitable instruction execution system. If implemented in hardware, as in another embodiment, any one or combination of the following techniques, which are known in the art, may be used: a discrete logic circuit having a logic gate circuit for implementing a logic function on a data signal, an application specific integrated circuit having an appropriate combinational logic gate circuit, a Programmable Gate Array (PGA), a Field Programmable Gate Array (FPGA), or the like.
It will be understood by those skilled in the art that all or part of the steps carried by the method for implementing the above embodiments may be implemented by hardware related to instructions of a program, which may be stored in a computer readable storage medium, and when the program is executed, the program includes one or a combination of the steps of the method embodiments.
In addition, functional units in the embodiments of the present invention may be integrated into one processing module, or each unit may exist alone physically, or two or more units are integrated into one module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode. The integrated module, if implemented in the form of a software functional module and sold or used as a stand-alone product, may also be stored in a computer readable storage medium.
The storage medium mentioned above may be a read-only memory, a magnetic or optical disk, etc. Although embodiments of the present invention have been shown and described above, it is understood that the above embodiments are exemplary and should not be construed as limiting the present invention, and that variations, modifications, substitutions and alterations can be made to the above embodiments by those of ordinary skill in the art within the scope of the present invention.

Claims (5)

1. A memory sharing method is characterized by comprising the following steps:
a first process sends a message requesting to establish a shared memory to a second process;
if the second process determines to establish the shared memory with the first process, the second process sends a determination request to the first process;
the first process sends a shared memory establishing message to the second process; wherein, the shared memory establishing message carries attribute information; the attribute information comprises the capacity of a shared memory and/or a storage area of the shared memory;
when the second process receives the attribute information carried by the shared memory establishing message, the second process sends a message for determining the establishment of the shared memory to the first process;
writing shared data adopting a first data structure into the shared memory by a first process;
the first process indicating the first data structure to a second process employing a second data structure;
the second process reads the shared memory to obtain shared data of the first data structure;
and according to the first data structure indicated by the first process, the second process analyzes the shared data of the first data structure to obtain the shared data of a second data structure.
2. The memory sharing method of claim 1, wherein the indicating, by the first process, the first data structure to the second process using the second data structure comprises:
the first process sends the offset address of the shared memory to the second process; the position corresponding to the offset address stores the information of the first data structure;
and if the second process successfully reads the first data structure according to the offset address, the second process sends an offset address response message to the first process.
3. A memory sharing system, comprising: a first process and a second process;
the first process is used for sending a message requesting to establish the shared memory to the second process;
the second process is configured to send a determination request to the first process if the second process determines to establish the shared memory with the first process;
the first process is used for sending a shared memory establishment message to the second process; wherein, the shared memory establishing message carries attribute information; the attribute information comprises the capacity of a shared memory and/or a storage area of the shared memory;
the second process is used for sending a message for determining the establishment of the shared memory to the first process when the attribute information carried by the message for establishing the shared memory is received;
the first process is further configured to write shared data in a first data structure into the shared memory; indicating the first data structure to a second process employing a second data structure;
the second process is further configured to read the shared memory to obtain shared data of the first data structure; and analyzing the shared data of the first data structure according to the first data structure indicated by the first process to obtain the shared data of a second data structure.
4. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor runs a first process and a second process, and the first process and the second process execute the program to implement the memory sharing method according to any one of claims 1-2.
5. A non-transitory computer readable storage medium having stored thereon a computer program, wherein a first process and a second process run by a processor implement the memory sharing method of any one of claims 1-2 when the program is executed.
CN201710731296.8A 2017-08-23 2017-08-23 Memory sharing method and system Active CN107391285B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710731296.8A CN107391285B (en) 2017-08-23 2017-08-23 Memory sharing method and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710731296.8A CN107391285B (en) 2017-08-23 2017-08-23 Memory sharing method and system

Publications (2)

Publication Number Publication Date
CN107391285A CN107391285A (en) 2017-11-24
CN107391285B true CN107391285B (en) 2020-06-30

Family

ID=60345521

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710731296.8A Active CN107391285B (en) 2017-08-23 2017-08-23 Memory sharing method and system

Country Status (1)

Country Link
CN (1) CN107391285B (en)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108363629B (en) * 2018-02-28 2020-10-27 杭州朗和科技有限公司 Method, medium, apparatus and computing device for instant messaging
CN110618883B (en) * 2019-09-26 2022-09-13 迈普通信技术股份有限公司 Method, device, equipment and storage medium for sharing memory linked list
CN112685063B (en) * 2020-12-30 2023-11-28 北京天融信网络安全技术有限公司 Feature library updating method, device, network equipment and readable storage medium
CN112732461A (en) * 2021-01-06 2021-04-30 浙江智慧视频安防创新中心有限公司 Inter-algorithm data transmission method and device in system
CN112631815B (en) * 2021-03-10 2021-08-17 国能信控互联技术有限公司 Inter-process communication method and system based on COM cross-process calling and shared memory
CN113032162B (en) * 2021-03-23 2023-10-24 重庆兰德适普信息科技有限公司 Multi-process communication method based on shared memory backup mechanism

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1924817A (en) * 2006-09-15 2007-03-07 华为技术有限公司 Data structure transmission method
CN102073537A (en) * 2010-09-29 2011-05-25 深圳市蓝韵实业有限公司 Method for realizing high-concurrency Web medical image server
CN101739301B (en) * 2009-12-09 2013-03-20 南京联创科技集团股份有限公司 Method of interprocess mass data transmission under Unix environment

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9208161B2 (en) * 2012-11-30 2015-12-08 International Business Machines Corporation Hardware contiguous memory region tracking

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1924817A (en) * 2006-09-15 2007-03-07 华为技术有限公司 Data structure transmission method
CN101739301B (en) * 2009-12-09 2013-03-20 南京联创科技集团股份有限公司 Method of interprocess mass data transmission under Unix environment
CN102073537A (en) * 2010-09-29 2011-05-25 深圳市蓝韵实业有限公司 Method for realizing high-concurrency Web medical image server

Also Published As

Publication number Publication date
CN107391285A (en) 2017-11-24

Similar Documents

Publication Publication Date Title
CN107391285B (en) Memory sharing method and system
US9967222B2 (en) Method and device for managing shared memory in robot operating system
US9015695B2 (en) Information processing apparatus and information processing method
JP7206371B2 (en) MAP DATA UPDATE METHOD, MAP DATA UPDATE DEVICE, MAP DATA UPDATE SYSTEM AND COMPUTER-READABLE STORAGE MEDIUM
CN109213611B (en) Cross-process communication method, device, terminal and storage medium
CN107861691B (en) Load balancing method and device of multi-control storage system
CN107689987B (en) Virtual network service exposure method and device
CN109951494B (en) Simulation data processing method and device, simulation equipment and storage medium
CN109933430B (en) Method and apparatus for distributing graphics processor
CN114302040B (en) Method for sharing single camera by multiple applications and related products
CN112433920A (en) Buried point data reporting method, device, equipment and medium
KR20170010810A (en) Method, device and user equipment for reading/writing data in nand flash
KR20200034572A (en) Request processing method and apparatus
CN110580674B (en) Information processing method, device and system
CN110662191B (en) Communication mode selection method and device and electronic equipment
CN111123728A (en) Unmanned vehicle simulation method, device, equipment and computer readable medium
CN111600943B (en) Method and equipment for acquiring target data
CN111694848A (en) Method and apparatus for updating data buffer using reference count
CN110580240B (en) Peripheral device management method and device for electronic device, electronic device and medium
CN114265713A (en) RDMA event management method, device, computer equipment and storage medium
CN114327248A (en) Storage node, storage device and network chip
CN107370785B (en) Method and equipment for processing user service state information
CN113609150B (en) Hardware-based atomic writing method, equipment and system
CN111181864A (en) Method and apparatus for determining link congestion status from an application to a server
CN111221584A (en) Terminal single-card and double-card adapting method and device, computer equipment and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant