CN107229530A - Communication means, storage medium and computer equipment between process - Google Patents
Communication means, storage medium and computer equipment between process Download PDFInfo
- Publication number
- CN107229530A CN107229530A CN201710516306.6A CN201710516306A CN107229530A CN 107229530 A CN107229530 A CN 107229530A CN 201710516306 A CN201710516306 A CN 201710516306A CN 107229530 A CN107229530 A CN 107229530A
- Authority
- CN
- China
- Prior art keywords
- data
- shared drive
- drive block
- unique mark
- written
- 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.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements 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/46—Multiprogramming arrangements
- G06F9/54—Interprogram communication
- G06F9/544—Buffers; Shared memory; Pipes
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements 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/46—Multiprogramming arrangements
- G06F9/54—Interprogram communication
- G06F9/542—Event management; Broadcasting; Multicasting; Notifications
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Multimedia (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invention relates to the communication means between a kind of process, storage medium and computer equipment, wherein method includes：According to the shared drive of host process request distribution shared drive block；Obtain write data requests of any process to shared drive block；Data write-in shared drive block is written into according to the data length of data to be written, and records offset address and data length of the data to be written with respect to shared drive block.The shared drive request distribution shared drive block that the present invention passes through host process, and distribute unique mark for shared drive block, the offset address of the relative host process of corresponding with the unique mark shared drive block of record, when writing data to shared drive block, offset address and data length of the record write-in data with respect to shared drive block, so that other processes can read data by shared drive block, so as to be dispatched by the striding course of Sharing Memory Realization complex object.
Description
Technical field
The present invention relates to field of computer technology, communication means, storage medium between more particularly to a kind of process and
Computer equipment.
Background technology
Shared drive (Share Memory) refers in the computer system of multi-process, can be accessed by different processes
Internal memory, can realize the shared same memory field of multiple processes to carry out data interaction by shared drive.But, it is shared at present
Internal memory is only used for the contiguous memory blocks such as the structure (struct) and array of C language, moreover, these memory blocks are because be one section of company
Continuous internal memory, so, once distributing, length is just secured.And, such as map just helpless for complicated C++ class object etc.
It is not one section of continuous internal memory etc. data structure, the privately owned member of oneself may be deposited, so that can not be directly using tradition
Share memory technology interact.
At present for complex object striding course dispatch, typically by serialize (Serialization), serializing be by
The status information of object is converted to the process for the form that can be stored or transmit, during serializing, and object is by its current state
Be written to interim or persistent storage area, after, can by read from memory block or unserializing object state, again
Create the object.But, traditional serializing and unserializing process can cause large effect to performance.
The content of the invention
Based on this, it is necessary to the problem of being dispatched for complex object striding course there is provided the communication means between a kind of process, deposit
Storage media and computer equipment.
A kind of communication means between process, including：According to the shared drive of host process request distribution shared drive block, and it is
Shared drive block distributes unique mark, records the offset address of the relative host process of corresponding with unique mark shared drive block；Obtain
Any process is taken to the write data requests of shared drive block, wherein, write data requests include data to be written and data to be written
Data length；Data write-in shared drive block is written into according to the data length of data to be written, and records number to be written
According to the offset address and data length of relative shared drive block.
In one of the embodiments, in addition to：Read data request of any process to shared drive block is obtained, wherein,
Read data request includes unique mark corresponding with shared memory block；Returned and be stored in and unique mark pair according to unique mark
The data and data length for the shared drive block answered.
In one of the embodiments, returned according to unique mark and be stored in shared drive block corresponding with unique mark
Data and data length, including：The inclined of the relative host process of corresponding with unique mark shared drive block is determined according to unique mark
Move address；Shared drive block is determined according to the offset address of the relative host process of shared drive block corresponding with unique mark；According to
Shared drive block returns to the data and data length for being stored in shared drive block.
In one of the embodiments, any process is included host process or has permission to be entered using other of shared drive block
Journey.
In one of the embodiments, data write-in shared drive block is written into according to the data length of data to be written
Before, in addition to：Lock shared drive block.
In one of the embodiments, data write-in shared drive block is written into according to the data length of data to be written
Afterwards, in addition to：Shared drive block is unlocked.
A kind of computer-readable recording medium, is stored thereon with computer program, and the computer program is executed by processor
The step of Shi Shixian methods as described above.
A kind of computer equipment, including memory, processor and storing can be run on a memory and on a processor
Computer program, realize following steps during the computing device described program：According to the request point of the shared drive of host process
Unique mark is distributed with shared drive block, and for shared drive block, shared drive block corresponding with unique mark is recorded relative main
The offset address of process；Write data requests of any process to shared drive block are obtained, wherein, write data requests include to be written
The data length of data and data to be written；Data write-in shared drive is written into according to the data length of data to be written
Block, and record offset address and data length of the data to be written with respect to shared drive block.
In one of the embodiments, following steps are also realized during computing device described program：Obtain any process pair
The read data request of shared drive block, the read data request includes unique mark corresponding with shared memory block；According to only
One mark returns to the data and data length of write-in shared drive block corresponding with unique mark.
In one of the embodiments, the number for writing shared drive block corresponding with unique mark is returned according to unique mark
According to and data length, including：Skew of the shared drive block corresponding with unique mark relative to host process is determined according to unique mark
Address；Shared drive block is determined according to the offset address of the relative host process of shared drive block corresponding with unique mark；According to altogether
Enjoy data and data length that memory block returns to write-in shared drive block.
Communication means, storage medium and computer equipment between above-mentioned process, are asked by the shared drive of host process
Shared drive block is distributed, and unique mark is distributed for shared drive block, shared drive block corresponding with unique mark is recorded relative
The offset address of host process, when writing data to shared drive block, skew of the record write-in data relative to shared drive block
Location and data length, so that other processes can read data by shared drive block, so as to real by shared drive
The striding course scheduling of existing complex object.
Brief description of the drawings
Fig. 1 is the flow chart of the communication means between process in one embodiment；
Fig. 2 is the flow chart of the communication means between process in one embodiment；
Fig. 3 is the Signalling exchange schematic diagram of the communication means between process in one embodiment.
Embodiment
To make the purpose, technical scheme and advantage of the embodiment of the present invention clearer, below in conjunction with the embodiment of the present invention
In accompanying drawing, the technical scheme in the embodiment of the present invention is clearly and completely described, it is clear that described embodiment is
A part of embodiment of the present invention, rather than whole embodiments.
The embodiments of the invention provide the communication means between a kind of process, as shown in figure 1, comprising the following steps：
Step S101, according to the shared drive of host process request distribution shared drive block.
In the present embodiment, to apply for the process of shared drive as host process, memory system according to host process it is shared in
Deposit request and distribute shared drive block, while distributing unique mark for the shared drive block, and record corresponding with the unique mark
Offset address of the shared drive block with respect to host process.Wherein, the unique mark of shared drive block can pass through different characters
String or ID are identified, to distinguish different shared drive blocks.
Shared drive block is then used for host process and needs other interactive processes to be to have permission to use this shared drive block
The interaction of complex data is carried out between other processes, wherein, complex data includes but is not limited to C++ class object, such as map.
Step S102, obtains write data requests of any process to shared drive block.
In the present embodiment, host process and other processes having permission using this shared drive block can share interior at this
The various complex datas of dynamic insertion or reading data in counterfoil, so as to realize the interaction of complex data.Therefore, host process and have the right
Limit can be by the unique mark and phase of the shared drive block using any process in other processes of this shared drive block
Various complex datas dynamically are write in the shared drive block to the offset address of host process.
Memory system obtains write data requests of any process to the shared drive block, wherein, write data requests include treating
Write data and the data length of the data to be written.
Step S103, data write-in shared drive block is written into according to the data length of data to be written, and record should
Offset address and data length of the data to be written with respect to shared drive block.
When writing data, memory system is written into data write-in shared drive according to the data length of data to be written
Block, i.e., be its allocation space according to data length, so as to realize the dynamic expansion of internal memory.Meanwhile, it is to be written that memory system records this
Enter data with respect to the offset address of shared drive block and the data length of the data to be written, so that having permission to make
Can be relative according to the shared drive block offset address of host process, the data to be written relatively with the process of this shared drive block
The offset address of shared drive block and the reading of the data length of the data to be written are stored in be written in the shared drive block
Enter data, interactive communication between the striding course to realize complex data.
In one embodiment, according to the data length of data to be written be written into data write-in shared drive block it
Before, memory system can be locked to the shared drive block, that is, lock the shared drive block, to avoid when simultaneously multiple processes are visited
The error in data for operating and occurring during same shared drive block is asked, such as two processes write data simultaneously, or a process writes
Data, another process does not run through data also, and other processes start to write data etc. again.The present embodiment is by locking shared drive
Block so that synchronization only one of which process to the shared drive block carry out write operation, and then ensure data correctness,
Integrality, uniformity.Also, write to the shared drive block after data, memory system can be released to the shared drive block
Locking, so that other processes can access operation this shared drive block.
In one embodiment, as shown in Fig. 2 this method can also include：
Step S201, obtains read data request of any process to shared drive block, and read data request includes common with this
Enjoy the corresponding unique mark of memory block.
The present embodiment mainly elaborates the time data stream journey to shared drive block, when any process needs to read shared drive
During data in block, then read data request is sent to memory system, wherein, read data request includes shared drive to be read
The unique mark of block.
In the case of without special instruction, any process of the present embodiment refers to host process and had permission shared interior using this
Other processes of counterfoil.
Step S202, returns according to unique mark and is stored in the data of shared drive block corresponding with the unique mark and right
The data length answered.
In the present embodiment, memory system is shared to what is carried in the read data request of shared drive block according to any process
The unique mark of memory block, it is determined that the offset address of the relative host process of shared drive block corresponding with the unique mark, so that root
Offset address according to the shared drive block with respect to host process determines shared drive block, and returns to the process of request and to be stored in this and be total to
Enjoy the data and corresponding data length of memory block so that the process of request can be restored in the process of oneself one with
The shared drive block identical shared drive structure.
The present embodiment realizes interaction of the complex data between different processes by shared drive block, so that in the absence of serializing
Memory copying process, therefore, extra memory source will not be consumed；And due to that will not have serializing and unserializing mistake
Journey, therefore improve the efficiency of interaction between process.
Fig. 3 is the signaling diagram of the communication means between process in one embodiment, is understood for convenience, in the present embodiment,
Host process is represented using process A, is had permission and is represented using other processes of the shared drive block using process B, the present embodiment with
Process A writes data, process B reading data instances and illustrated.As shown in figure 3, including：
Step S301, process A are to memory system application shared drive block.
When process A needs to interact with other processes progress complex data, then to memory system application shared drive
Block.
Step S302, memory system is that process A creates shared drive block.
In the present embodiment, memory system is that process A creates shared drive block, and is the unique mark of shared drive block distribution
ShmA is known, while recording offset address of the shared drive block shmA with respect to host process.
Because shared drive block shmA is applied by process A, therefore, once process A is destroyed, then the shared drive block
ShmA just has to reclaim.
Step S303, process A are asked to shared drive block shmA write-in data DataA.
When process A needs to write data DataA to shared drive block shmA, then writing data to memory system transmission please
Ask, wherein, write data requests include data DataA and DataA to be written data length.
Step S304, memory system locks for shared drive block shmA.
Before write-in data DataA is started, memory system can be locked to shared drive block shmA, so as to lock
ShmA, to avoid when multiple processes while the error in data occurred when accessing operation shmA so that synchronization only one of which is entered
Journey carries out write operation to shmA, to ensure the correctness, integrality, uniformity of data.
Step S305, memory system inserts data DataA in shared drive block shmA.
Memory system can then insert data DataA, and remember after being locked to shmA in shared drive block shmA
Data DataA is recorded with respect to shared drive block shmA offset address and data DataA length.
Step S306, memory system is that shared drive block discharges lock.
After write-in data DataA, memory system can unlock to shared drive block shmA, so that other processes
As process B can access operation shared drive block shmA.
Step S307, process B read shared drive block shmA to memory system request.
When process B needs acquisition process A to write shmA complex data DataA, then sent to memory system and read data
Request, wherein, read data request includes shared drive block shmA to be read unique mark " shmA ".
Step S308, memory system inquires about shared drive block by shmA.
Memory system according to read data requests of the process B to shared drive block shmA, inquiry with read data request only
One identifies offset address of " shmA " the corresponding shared drive block with respect to host process, so as to be entered according to shared drive block master relatively
The offset address of journey determines shared drive block shmA.
Step S309, the shared drive block shmA inquired is returned to process B.
Memory system is inclined with respect to host process to process B return shared drive block shmA, including shmA according to Query Result
Move address.
Step S310, process B retrieve DataA by memory system in shared drive block shmA.
Process B retrieves data DataA in the shared drive block shmA that memory system is returned.
Step S311, DataA and DataA length is returned to process B.
Memory system returns to DataA and DataA length according to retrieval result to process B so that process B can be certainly
DataA is restored in oneself process, complex data DataA striding course is interacted between process A and process B so as to realize.
The embodiment of the present invention additionally provides a kind of computer-readable recording medium, is stored thereon with computer program, the meter
Calculation machine program realizes following steps when being executed by processor：According to the shared drive of host process request distribution shared drive block, and
Unique mark is distributed for shared drive block, the offset address of the relative host process of corresponding with unique mark shared drive block is recorded；
Write data requests of any process to shared drive block are obtained, wherein, write data requests include data to be written and number to be written
According to data length；Data write-in shared drive block is written into according to the data length of data to be written, and records to be written
Data are with respect to the offset address of shared drive block and the data length of the data to be written.
In one embodiment, in addition to：Read data request of any process to shared drive block is obtained, wherein, reading
Include unique mark corresponding with shared memory block according to request；It is stored according to unique mark return corresponding with unique mark
The data of shared drive block and the data length.
In one embodiment, the data for being stored in shared drive block corresponding with unique mark are returned according to unique mark
And data length, including：The skew of corresponding with unique mark shared drive block relative to host process is determined according to unique mark
Location；Shared drive block is determined according to the offset address of the relative host process of shared drive block corresponding with unique mark；According to shared
Memory block returns to the data and the data length for being stored in shared drive block.
In one embodiment, any process includes host process or has permission other processes for using shared drive block.
In one embodiment, according to the data length of data to be written be written into data write-in shared drive block it
Before, in addition to：Lock shared drive block.
In one embodiment, according to the data length of data to be written be written into data write-in shared drive block it
Afterwards, in addition to：Shared drive block is unlocked.
The embodiment of the present invention additionally provides a kind of computer equipment, including memory, processor and is stored in memory
Computer program that is upper and can running on a processor, wherein, realize following steps during computing device described program：According to master
The shared drive request distribution shared drive block of process, and distribute unique mark, record and unique mark pair for shared drive block
Offset address of the shared drive block with respect to host process answered；Write data requests of any process to shared drive block are obtained, wherein,
Write data requests include the data length of data to be written and data to be written；Will be to be written according to the data length of data to be written
Enter data write-in shared drive block, and record data to be written with respect to the offset address of shared drive block and the data to be written
Data length.
In one embodiment, in addition to：Read data request of any process to shared drive block is obtained, wherein, reading
Include unique mark corresponding with shared memory block according to request；It is stored according to unique mark return corresponding with unique mark
The data of shared drive block and the data length.
In one embodiment, the data for being stored in shared drive block corresponding with unique mark are returned according to unique mark
And data length, including：The skew of corresponding with unique mark shared drive block relative to host process is determined according to unique mark
Location；Shared drive block is determined according to the offset address of the relative host process of shared drive block corresponding with unique mark；According to shared
Memory block returns to the data and the data length for being stored in shared drive block.
In one embodiment, any process includes host process or has permission other processes for using shared drive block.
In one embodiment, according to the data length of data to be written be written into data write-in shared drive block it
Before, in addition to：Lock shared drive block.
In one embodiment, according to the data length of data to be written be written into data write-in shared drive block it
Afterwards, in addition to：Shared drive block is unlocked.
Each technical characteristic of embodiment described above can be combined arbitrarily, to make description succinct, not to above-mentioned reality
Apply all possible combination of each technical characteristic in example to be all described, as long as however, the combination of these technical characteristics is not deposited
In contradiction, the scope of this specification record is all considered to be.
Embodiment described above only expresses the several embodiments of the present invention, and it describes more specific and detailed, but simultaneously
Can not therefore it be construed as limiting the scope of the patent.It should be pointed out that coming for one of ordinary skill in the art
Say, without departing from the inventive concept of the premise, various modifications and improvements can be made, these belong to the protection of the present invention
Scope.Therefore, the protection domain of patent of the present invention should be determined by the appended claims.
Claims (10)
1. the communication means between a kind of process, it is characterised in that including：
According to the shared drive of host process request distribution shared drive block, and unique mark, note are distributed for the shared drive block
The offset address of the relative host process of corresponding with the unique mark shared drive block of record；
Write data requests of any process to the shared drive block are obtained, write data request includes data to be written and institute
State the data length of data to be written；
The data to be written are write by the shared drive block according to the data length of the data to be written, and record described
The offset address and the data length of the relatively described shared drive block of data to be written.
2. the communication means between process according to claim 1, it is characterised in that also include：
Read data request of any process to the shared drive block is obtained, the read data request includes sharing interior with described
The corresponding unique mark of counterfoil；
The data and the data for being stored in shared drive block corresponding with the unique mark are returned according to the unique mark
Length.
3. the communication means between process according to claim 2, it is characterised in that described to be returned according to the unique mark
The data and the data length of shared drive block corresponding with the unique mark are stored in, including：
The skew of corresponding with unique mark shared drive block relative to the host process is determined according to the unique mark
Location；
According to the offset address of the relative host process of shared drive block corresponding with the unique mark determine it is described it is shared in
Counterfoil；
The data and the data length for being stored in the shared drive block are returned according to the shared drive block.
4. the communication means between process according to claim 1, it is characterised in that any process is entered including the master
Journey has permission other processes for using the shared drive block.
5. the communication means between process according to any one of Claims 1 to 4, it is characterised in that treated described in the basis
The data length for writing data writes the data to be written before the shared drive block, in addition to：
Lock the shared drive block.
6. the communication means between process according to claim 5, it is characterised in that described according to the data to be written
Data length writes the data to be written after the shared drive block, in addition to：
The shared drive block is unlocked.
7. a kind of computer-readable recording medium, is stored thereon with computer program, it is characterised in that the computer program is located
Manage and realized when device is performed such as the step of any one of claim 1~6 methods described.
8. a kind of computer equipment, including memory, processor and storage can be run on a memory and on a processor
Computer program, it is characterised in that realize following steps during the computing device described program：
According to the shared drive of host process request distribution shared drive block, and unique mark, note are distributed for the shared drive block
The offset address of the relative host process of corresponding with the unique mark shared drive block of record；
Write data requests of any process to the shared drive block are obtained, write data request includes data to be written and institute
State the data length of data to be written；
The data to be written are write by the shared drive block according to the data length of the data to be written, and record described
The offset address and the data length of the relatively described shared drive block of data to be written.
9. computer equipment according to claim 8, it is characterised in that also realized during the computing device described program
Following steps：
Read data request of any process to the shared drive block is obtained, the read data request includes sharing interior with described
The corresponding unique mark of counterfoil；
The data and the data for being stored in shared drive block corresponding with the unique mark are returned according to the unique mark
Length.
10. computer equipment according to claim 9, it is characterised in that described returned according to the unique mark stores
In the data and the data length of shared drive block corresponding with the unique mark, including：
The skew of corresponding with unique mark shared drive block relative to the host process is determined according to the unique mark
Location；
According to the offset address of the relative host process of shared drive block corresponding with the unique mark determine it is described it is shared in
Counterfoil；
The data and the data length for writing the shared drive block are returned according to the shared drive block.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710516306.6A CN107229530A (en) | 2017-06-29 | 2017-06-29 | Communication means, storage medium and computer equipment between process |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710516306.6A CN107229530A (en) | 2017-06-29 | 2017-06-29 | Communication means, storage medium and computer equipment between process |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107229530A true CN107229530A (en) | 2017-10-03 |
Family
ID=59936501
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710516306.6A Pending CN107229530A (en) | 2017-06-29 | 2017-06-29 | Communication means, storage medium and computer equipment between process |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107229530A (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107861735A (en) * | 2017-10-26 | 2018-03-30 | 上海联影医疗科技有限公司 | A kind of firmware installation progress monitoring method and computer-readable recording medium |
| CN108449634A (en) * | 2018-03-27 | 2018-08-24 | 武汉斗鱼网络科技有限公司 | A kind of decoded playback method of multi-process, computer equipment and storage medium |
| CN109032818A (en) * | 2018-07-27 | 2018-12-18 | 北京计算机技术及应用研究所 | A kind of method of isomorphism system internuclear synchronization and communication |
| CN109358974A (en) * | 2018-10-17 | 2019-02-19 | 武汉斗鱼网络科技有限公司 | A kind of method and relevant apparatus of interprocess communication |
| CN111459671A (en) * | 2020-03-30 | 2020-07-28 | 深圳市英威腾电源有限公司 | Data processing method and device, data exchange server and storage medium |
| CN111796948A (en) * | 2020-07-02 | 2020-10-20 | 长视科技股份有限公司 | Shared memory access method and device, computer equipment and storage medium |
| CN112379952A (en) * | 2020-12-09 | 2021-02-19 | 成都傲梅科技有限公司 | Method for implementing cross-process callback |
| WO2024193310A1 (en) * | 2023-03-21 | 2024-09-26 | 华为技术有限公司 | Inter-program communication method and computer device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101030135A (en) * | 2006-02-28 | 2007-09-05 | 华为技术有限公司 | Method and device for storing C++ object in shared memory |
| CN102253855A (en) * | 2011-06-17 | 2011-11-23 | 北京书生国际信息技术有限公司 | Method and device for transferring shared memory |
| CN103197979A (en) * | 2012-01-04 | 2013-07-10 | 阿里巴巴集团控股有限公司 | Method and device for realizing data interaction access among processes |
| CN103605577A (en) * | 2013-12-04 | 2014-02-26 | 广州博冠信息科技有限公司 | Cross-process resource sharing method and equipment |
| US20170161124A1 (en) * | 2015-06-26 | 2017-06-08 | Intel Corporation | Firmware-related event notification |
-
2017
- 2017-06-29 CN CN201710516306.6A patent/CN107229530A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101030135A (en) * | 2006-02-28 | 2007-09-05 | 华为技术有限公司 | Method and device for storing C++ object in shared memory |
| CN102253855A (en) * | 2011-06-17 | 2011-11-23 | 北京书生国际信息技术有限公司 | Method and device for transferring shared memory |
| CN103197979A (en) * | 2012-01-04 | 2013-07-10 | 阿里巴巴集团控股有限公司 | Method and device for realizing data interaction access among processes |
| CN103605577A (en) * | 2013-12-04 | 2014-02-26 | 广州博冠信息科技有限公司 | Cross-process resource sharing method and equipment |
| US20170161124A1 (en) * | 2015-06-26 | 2017-06-08 | Intel Corporation | Firmware-related event notification |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107861735A (en) * | 2017-10-26 | 2018-03-30 | 上海联影医疗科技有限公司 | A kind of firmware installation progress monitoring method and computer-readable recording medium |
| CN108449634A (en) * | 2018-03-27 | 2018-08-24 | 武汉斗鱼网络科技有限公司 | A kind of decoded playback method of multi-process, computer equipment and storage medium |
| CN108449634B (en) * | 2018-03-27 | 2021-04-23 | 武汉斗鱼网络科技有限公司 | Playing method for multi-process decoding, computer equipment and storage medium |
| CN109032818A (en) * | 2018-07-27 | 2018-12-18 | 北京计算机技术及应用研究所 | A kind of method of isomorphism system internuclear synchronization and communication |
| CN109358974A (en) * | 2018-10-17 | 2019-02-19 | 武汉斗鱼网络科技有限公司 | A kind of method and relevant apparatus of interprocess communication |
| CN109358974B (en) * | 2018-10-17 | 2021-05-28 | 武汉斗鱼网络科技有限公司 | Inter-process communication method and related device |
| CN111459671A (en) * | 2020-03-30 | 2020-07-28 | 深圳市英威腾电源有限公司 | Data processing method and device, data exchange server and storage medium |
| CN111459671B (en) * | 2020-03-30 | 2023-11-28 | 深圳市英威腾电源有限公司 | Data processing method and device, data exchange server and storage medium |
| CN111796948A (en) * | 2020-07-02 | 2020-10-20 | 长视科技股份有限公司 | Shared memory access method and device, computer equipment and storage medium |
| CN112379952A (en) * | 2020-12-09 | 2021-02-19 | 成都傲梅科技有限公司 | Method for implementing cross-process callback |
| CN112379952B (en) * | 2020-12-09 | 2023-04-07 | 成都傲梅科技有限公司 | Method for implementing cross-process callback |
| WO2024193310A1 (en) * | 2023-03-21 | 2024-09-26 | 华为技术有限公司 | Inter-program communication method and computer device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107229530A (en) | Communication means, storage medium and computer equipment between process | |
| CN106201355B (en) | Data processing method and device and storage system | |
| Goodrich et al. | Oblivious RAM simulation with efficient worst-case access overhead | |
| US20100174865A1 (en) | Dynamic data security erasure | |
| CN104238963B (en) | A kind of date storage method, storage device and storage system | |
| US20070162506A1 (en) | Method and system for performing a redistribute transparently in a multi-node system | |
| CN103942011B (en) | A kind of residual quantity fast photographic system and its application method | |
| CN103605577B (en) | The resource share method and equipment of striding course | |
| US6298401B1 (en) | Object oriented storage device having a disc drive controller providing an interface exposing methods which are invoked to access objects stored in a storage media | |
| CN107544756B (en) | Key-Value log type local storage method based on SCM | |
| CN106548789A (en) | Method and apparatus for operating stacked tile type magnetic recording equipment | |
| CN111309289B (en) | Memory pool management assembly | |
| CN103559319B (en) | The cache synchronization method and equipment of distributed cluster file system | |
| CN106575309A (en) | File system with data block sharing | |
| CN103761190A (en) | Data processing method and apparatus | |
| CN107783988A (en) | The locking method and equipment of a kind of directory tree | |
| CN107632791A (en) | The distribution method and system of a kind of memory space | |
| CN110399235A (en) | Multi-thread data transmission method and device in TEE system | |
| CN104657260A (en) | Achievement method for distributed locks controlling distributed inter-node accessed shared resources | |
| CN105426373A (en) | Database synchronization method and device | |
| CN107402821A (en) | Access control method, device and the equipment of shared resource | |
| CN110377529A (en) | A kind of method, apparatus and equipment of full flash memory storage system data management | |
| CN107562367A (en) | Method and device based on software implementation storage system read-write data | |
| US7822933B1 (en) | Enabling off-host data migration using volume translation mappings, snappoint maps and linked volume technologies | |
| US10095706B2 (en) | Data access system and data access method |
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 | ||
| CB02 | Change of applicant information |
Address after: 201807 Shanghai City, north of the city of Jiading District Road No. 2258 Applicant after: Shanghai Lianying Medical Technology Co., Ltd Address before: 201807 Shanghai City, north of the city of Jiading District Road No. 2258 Applicant before: SHANGHAI UNITED IMAGING HEALTHCARE Co.,Ltd. |
|
| CB02 | Change of applicant information | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20171003 |
|
| RJ01 | Rejection of invention patent application after publication |