CN105068878A - Inter-process communication method and system - Google Patents
Inter-process communication method and system Download PDFInfo
- Publication number
- CN105068878A CN105068878A CN201510466483.9A CN201510466483A CN105068878A CN 105068878 A CN105068878 A CN 105068878A CN 201510466483 A CN201510466483 A CN 201510466483A CN 105068878 A CN105068878 A CN 105068878A
- Authority
- CN
- China
- Prior art keywords
- parameter
- message
- variable
- sent
- array
- 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
Landscapes
- Detection And Prevention Of Errors In Transmission (AREA)
Abstract
The present invention provides an inter-process communication method and system. The method comprises: a first process stores a first variable and to-be-sent parameters in a pre-applied memory in order, wherein each to-be-sent parameter uses '\0' as an end, and the first variable is used for storing a number of the to-be-sent parameters; the first process sends a first message containing the first variable and the to-be-sent parameters to a second process; the second process, after receiving the first message, acquires the number of the parameters in the first message according to the first variable in the first message; and the second process generates a pointer array according to the number of the parameters in the first message, and reading all the parameters in the first message in order by using the pointer array. According to the present invention, the problem of restriction on the message length, which is caused by adoption of a character array to store messages in the prior art, is solved.
Description
Technical field
The present invention relates to field of computer technology, be specifically related to the communication means between a kind of process and system.
Background technology
Usually message mechanism communication can be used between User space process under linux.Generally for the convenient character array that message can be defined as similar charmsg [a] [b], it shows that message can comprise a parameter, and each parameter maximum length is b.After process receives such message, can access any one parameter easily, such as can pass through msg [0] and visit first parameter, msg [1] visits second parameter.
But said method limits the maximum length of each message artificially, when needing more longer message, can only source code be revised, a or b being expanded, operates so very inconvenient.
Summary of the invention
For defect of the prior art, the invention provides the communication means between a kind of process and system, solve in prior art the problem adopting character array storing message and restriction of message length.
For solving the problem, first aspect, the invention provides the communication means between a kind of process, comprising:
First variable and parameter to be sent leave in the internal memory of pre-first to file by the first process successively, and wherein each parameter to be sent is using ’ 0 ' as ending, and described first variable is for storing the number of parameter to be sent;
The first message comprising the first variable and parameter to be sent is sent to the second process by the first process;
Second process, after receiving described first message, obtains the number of the parameter in the first message according to the first variable in described first message;
Second process generates array of pointers according to the number of the parameter in described first message, and utilizes described array of pointers to read all parameters in the first message successively.
Further, before the first variable and parameter to be sent leave in the internal memory of pre-first to file by the first process successively, described method also comprises:
First process is the internal memory of M1 according to described first variable and parameter application one block size to be sent:
M1＝sizeof1+strlen1+strlen2+…+strlenN+N；
Wherein, N is the number of the parameter in the first message, and sizeof1 is the length of the first data type of a variable, and strlen1 is the length of first parameter, and strlen2 is the length of second parameter, and strlenN is the length of N number of parameter, and unit is byte.
Further, the second process generates array of pointers according to the number of the parameter in described first message, and all parameters utilizing described array of pointers to read successively in the first message comprise:
Second process generates array of pointers according to the number of the parameter in described first message, and the array element of wherein said array of pointers is respectively p [0], p [1] ..., p [N-1];
P [0] is utilized to read first parameter, p [i]=p [i-1]+strlen (p [i-1])+1 is utilized to read the i-th+1 parameter, wherein 1≤i≤N, N is the number of the parameter in the first message, and strlen (p [i-1]) is the length of i-th parameter;
Described array element p [0] points to the start address of first parameter in the first message, and described array element p [i-1] points to the start address of i-th parameter in the first message.
Further, before the second process generates array of pointers according to the number of the parameter in described first message, described method also comprises:
Second process is the internal memory of M2 according to number application one block size of the parameter in described first message:
M2＝sizeof2*N；
Wherein, sizeof2 is the memory size that a pointer needs.
Further, described first data type of a variable is integer or character type.
Second aspect, present invention also offers the communication system between a kind of process, comprises the first process communication device and the second process communication device;
Described first process communication device comprises storage unit and transmitting element;
Described second process communication device comprises receiving element, acquiring unit and reading unit;
Described storage unit, for leaving in the internal memory of pre-first to file successively by the first variable and parameter to be sent, wherein each parameter to be sent is using ’ 0 ' as ending, and described first variable is for storing the number of parameter to be sent;
Described transmitting element, for sending to the second process communication device by the first message comprising the first variable and parameter to be sent;
Described receiving element, for receiving the first message that the first process communication device sends;
Described acquiring unit, for obtaining the number of the parameter in the first message according to the first variable in described first message;
Described reading unit, for generating array of pointers according to the number of the parameter in described first message, and utilizes described array of pointers to read all parameters in the first message successively.
Further, described first process communication device also comprises the first application unit, and it is the internal memory of M1 that described first application unit is used for according to described first variable and parameter application one block size to be sent:
M1＝sizeof1+strlen1+strlen2+…+strlenN+N；
Wherein, N is the number of the parameter in the first message, and sizeof1 is the length of the first data type of a variable, and strlen1 is the length of first parameter, and strlen2 is the length of second parameter, and strlenN is the length of N number of parameter, and unit is byte.
Further, described reading unit comprises generation module and read module;
Described generation module is used for generating array of pointers according to the number of the parameter in described first message, and the array element of wherein said array of pointers is respectively p [0], p [1] ..., p [N-1];
Described read module is used for utilizing p [0] to read first parameter, p [i]=p [i-1]+strlen (p [i-1])+1 is utilized to read the i-th+1 parameter, wherein 1≤i≤N, N is the number of the parameter in the first message, and strlen (p [i-1]) is the length of i-th parameter;
Described array element p [0] points to the start address of first parameter in the first message, and described array element p [i-1] points to the start address of i-th parameter in the first message.
Further, described second process communication device also comprises the second application unit, and it is the internal memory of M2 that described second application unit is used for according to number application one block size of the parameter in described first message:
M2＝sizeof2*N；
Wherein, sizeof2 is the memory size that a pointer needs.
Further, described first data type of a variable is integer or character type.
As shown from the above technical solution, the communication means between process of the present invention, first the first process deposits the first variable and parameter to be sent successively in the internal memory of pre-first to file, and wherein said first variable is for storing the number of parameter to be sent.Then the first message comprising the first variable and parameter to be sent is sent to the second process by the first process.After the second process receives the first message, second process obtains the number of the parameter that the first process sends by reading first variable, on this basis, the second process is that the array of pointers of number of parameters realizes accessing a certain parameter by arranging an array length.Because the method for the invention only need arrange the number of parameter to be sent in the first variable, and the length issue of parameter need not be considered.Therefore when parameter length or number of parameters change, adopt method of the present invention, need not revise source code, only need order after the first variable just passable stored in parameter, therefore the method for the invention can process the parameter of variable-length easily.In addition, the method for the invention can also realize the fast access of parameter.
Accompanying drawing explanation
In order to be illustrated more clearly in the embodiment of the present invention or technical scheme of the prior art, be briefly described to the accompanying drawing used required in embodiment or description of the prior art below, apparently, accompanying drawing in the following describes is some embodiments of the present invention, for those of ordinary skill in the art, under the prerequisite not paying creative work, other accompanying drawing can also be obtained according to these accompanying drawings.
Fig. 1 is the process flow diagram of the communication means between the process that provides of the embodiment of the present invention one;
Fig. 2 is the structural representation of the communication system between the process that provides of the embodiment of the present invention two.
Embodiment
For making the object of the embodiment of the present invention, technical scheme and advantage clearly, below in conjunction with the accompanying drawing in the embodiment of the present invention, clear, complete description is carried out to the technical scheme in the embodiment of the present invention, obviously, described embodiment is the present invention's part embodiment, instead of whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art, not making the every other embodiment obtained under creative work prerequisite, belong to the scope of protection of the invention.
Fig. 1 shows the process flow diagram of the communication means between process that the embodiment of the present invention one provides, and as shown in Figure 1, the communication means between the process of the present embodiment comprises the steps:
Step 101: the first variable and parameter to be sent leave in the internal memory of pre-first to file by the first process successively, wherein each parameter to be sent is using ’ 0 ' as ending, and described first variable is for storing the number of parameter to be sent.
In this step, because the first variable is for storing the number of parameter to be sent, therefore the first data type of a variable is can be integer or character type.Due to the maximum magnitude very large (32 powers-1 of 2) of unsigned int unsignedint type, in the message usually sent between two processes with number of parameters can not exceed this scope, so preferably, adopt unsignedint type definitely can meet use.
First variable is put into the head of internal memory by the first process, deposit parameters successively below, conveniently the second process reads parameters, first process deposit parameter season each parameter with ' 0 ' ending, after parameter deposits end, perform step 102, namely the message in this block internal memory is sent to the second process by the first process.
It is pointed out that before step 101, the method also comprises step 101 '.
Step 101 ': the first process is the internal memory of M1 according to described first variable and parameter application one block size to be sent:
M1＝sizeof1+strlen1+strlen2+…+strlenN+N；
Wherein, N is the number of the parameter in the first message, and sizeof1 is the length of the first data type of a variable, and unit is byte.Strlen1 is the length of first parameter, and strlen2 is the length of second parameter, and strlenN is the length of N number of parameter.
Wherein, strlen1=strlen (first parameter), strlenN=strlen (N number of parameter), strlen () are for asking the function of string length, and unit is byte.Sizeof1 is the length of the first data type of a variable, gives an example, when the first data type of a variable is unsignedint type, and sizeof1=sizeof (unsignedint).Because the ending of each parameter with the addition of character ' 0 ', therefore need to add N when calculating memory size M1.
After having applied for internal memory, perform step 101 again, namely in the internal memory applied for, deposit the first variable and parameter to be sent successively.Do like this and can ensure no matter there are how many parameters, message can be assembled normally, be not subject to the restriction of array size.
Step 102: the first message comprising the first variable and parameter to be sent is sent to the second process by the first process.
Step 103: the second process, after receiving described first message, obtains the number of the parameter in the first message according to the first variable in described first message.
Step 104: the second process generates array of pointers according to the number of the parameter in described first message, and utilize described array of pointers to read all parameters in the first message successively.
In this step, first the second process generates array of pointers according to the number of the parameter in described first message, and the array element of wherein said array of pointers is respectively p [0], p [1] ..., p [N-1]; Then p [0] is utilized to read first parameter, p [i]=p [i-1]+strlen (p [i-1])+1 is utilized to read the i-th+1 parameter, wherein 1≤i≤N, N is the number of the parameter in the first message, and strlen (p [i-1]) is the length of i-th parameter;
Described array element p [0] points to the start address of first parameter in the first message, and described array element p [i-1] points to the start address of i-th parameter in the first message.
It is pointed out that, before step 104, this method also comprises step 104 '.
Step 104 ': the second process is the internal memory of M2 according to number application one block size of the parameter in described first message:
M2＝sizeof2*N；
Wherein, sizeof2 is the memory size that a pointer needs.Second process is after receiving the first message, first extracting parameter number, then one piece of internal memory is applied for according to this value, memory size M2=sizeof2*N=sizeof (void*) * N, the i.e. memory size that needs of N number of pointer, follow-uply so just can visit each pointer by the method for similar array, such as p [0], p [1] ..., p [N-1].
From above-mentioned steps 103 and step 104, after the second process receives the first message, first read the first variable and to get parms number N, have how many parameters to know.Then the second process starts to resolve the first message, due to each parameter in the first message with ' 0 ' ending, according to the regulation of C language, the end mark of character string that Here it is, therefore only need a pointer p to point to the start address of parameter, so this pointer is exactly point to this parameter naturally.
In order to read parameter, second process is provided with an array of pointers p [N], N is the number of parameter, p [0] points to the first variable address below, it is exactly so the address of first parameter, such p [0] has been exactly sensing first parameter, (strlen (p [0]) is the length of first parameter to p [1]=p [0]+strlen (p [0])+1, add 1 be because its ending be character ' 0 ', p [0] is the start address of first parameter) just point to the start address of second parameter, so p [1] has been exactly sensing second parameter, by that analogy, all parameters can be obtained easily.Like this by the method for the present embodiment, not only the length of each parameter can be fixed as a value, the parameter of variable-length can also be read easily.
In the present embodiment, the first process deposits the first variable and parameter to be sent successively in the internal memory of pre-first to file, and wherein said first variable is for storing the number of parameter to be sent.The first message comprising the first variable and parameter to be sent is sent to the second process by the first process.And the second process obtains by reading first variable the number of parameter that the first process sends, on this basis, the second process is that the array of pointers of number of parameters realizes accessing a certain parameter by arranging an array length.Because method described in the present embodiment only need arrange the number of parameter to be sent in the first variable, and the length issue of parameter need not be considered.Therefore when parameter length or number of parameters change, adopt the method described in the present embodiment, need not revise source code, only need order after the first variable just passable stored in parameter, therefore method described in the present embodiment can process the parameter of variable-length easily.In addition, method described in the present embodiment can also realize the fast access of parameter.
Fig. 2 shows the structural drawing of the communication system between process that embodiment two provides, and as shown in Figure 2, the communication system between the process of the present embodiment comprises the first process communication device 100 and the second process communication device 200;
Described first process communication device 100 comprises storage unit 1001 and transmitting element 1002;
Described second process communication device 200 comprises receiving element 2001, acquiring unit 2002 and reading unit 2003;
Described storage unit 1001, for leaving in the internal memory of pre-first to file successively by the first variable and parameter to be sent, wherein each parameter to be sent is using ’ 0 ' as ending, and described first variable is for storing the number of parameter to be sent;
Described transmitting element 1002, for sending to the second process communication device 200 by the first message comprising the first variable and parameter to be sent;
Described receiving element 2001, for receiving the first message that the first process communication device 100 sends;
Described acquiring unit 2002, for obtaining the number of the parameter in the first message according to the first variable in described first message;
Described reading unit 2003, for generating array of pointers according to the number of the parameter in described first message, and utilizes described array of pointers to read all parameters in the first message successively.
Further, described first process communication device 100 also comprises the first application unit 1003, and described first application unit 1003 is for being the internal memory of M1 according to described first variable and parameter application one block size to be sent:
M1＝sizeof1+strlen1+strlen2+…+strlenN+N；
Wherein, N is the number of the parameter in the first message, and sizeof1 is the length of the first data type of a variable, and strlen1 is the length of first parameter, and strlen2 is the length of second parameter, and strlenN is the length of N number of parameter.
After described first application unit 1003 has applied for internal memory, first variable and parameter to be sent leave in the internal memory applied for by described storage unit 1001 successively, do like this and can ensure no matter there are how many parameters, message can be assembled normally, be not subject to the restriction of array size.
Further, described reading unit 2003 comprises generation module and read module;
Described generation module is used for generating array of pointers according to the number of the parameter in described first message, and the array element of wherein said array of pointers is respectively p [0], p [1] ..., p [N-1];
Described read module is used for utilizing p [0] to read first parameter, p [i]=p [i-1]+strlen (p [i-1])+1 is utilized to read the i-th+1 parameter, wherein 1≤i≤N, N is the number of the parameter in the first message, and strlen (p [i-1]) is the length of i-th parameter;
Described array element p [0] points to the start address of first parameter in the first message, and described array element p [i-1] points to the start address of i-th parameter in the first message.
Further, described second process communication device 200 also comprises the second application unit 2004, and described second application unit 2004 is the internal memory of M2 for number application one block size according to the parameter in described first message:
M2＝sizeof2*N；
Wherein, sizeof2 is the memory size that a pointer needs.
Further, described first data type of a variable is integer or character type.
System described in the present embodiment may be used for the method described in above-described embodiment of performing, its principle and effect similar, no longer describe in detail herein.
Above embodiment only for illustration of technical scheme of the present invention, is not intended to limit; Although with reference to previous embodiment to invention has been detailed description, those of ordinary skill in the art is to be understood that: it still can be modified to the technical scheme described in foregoing embodiments, or carries out equivalent replacement to wherein portion of techniques feature; And these amendments or replacement, do not make the essence of appropriate technical solution depart from the spirit and scope of various embodiments of the present invention technical scheme.
Claims (10)
1. the communication means between process, is characterized in that, comprising:
First variable and parameter to be sent leave in the internal memory of pre-first to file by the first process successively, and wherein each parameter to be sent is using ’ 0 ' as ending, and described first variable is for storing the number of parameter to be sent;
The first message comprising the first variable and parameter to be sent is sent to the second process by described first process;
Described second process, after receiving described first message, obtains the number of the parameter in the first message according to the first variable in described first message;
Described second process generates array of pointers according to the number of the parameter in described first message, and utilizes described array of pointers to read all parameters in the first message successively.
2. method according to claim 1, is characterized in that, before the first variable and parameter to be sent leave in the internal memory of pre-first to file by the first process successively, described method also comprises:
Described first process is the internal memory of M1 according to described first variable and parameter application one block size to be sent:
M1＝sizeof1+strlen1+strlen2+…+strlenN+N；
Wherein, N is the number of the parameter in the first message, and sizeof1 is the length of the first data type of a variable, and strlen1 is the length of first parameter, and strlen2 is the length of second parameter, and strlenN is the length of N number of parameter, and unit is byte.
3. method according to claim 1 and 2, is characterized in that, the second process generates array of pointers according to the number of the parameter in described first message, and all parameters utilizing described array of pointers to read successively in the first message comprise:
Described second process generates array of pointers according to the number of the parameter in described first message, and the array element of wherein said array of pointers is respectively p [0], p [1] ..., p [N-1];
P [0] is utilized to read first parameter, p [i]=p [i-1]+strlen (p [i-1])+1 is utilized to read the i-th+1 parameter, wherein 1≤i≤N, N is the number of the parameter in the first message, and strlen (p [i-1]) is the length of i-th parameter;
Described array element p [0] points to the start address of first parameter in the first message, and described array element p [i-1] points to the start address of i-th parameter in the first message.
4. method according to claim 3, is characterized in that, before the second process generates array of pointers according to the number of the parameter in described first message, described method also comprises:
Described second process is the internal memory of M2 according to number application one block size of the parameter in described first message:
M2＝sizeof2*N；
Wherein, sizeof2 is the memory size that a pointer needs.
5. method according to claim 2, is characterized in that, described first data type of a variable is integer or character type.
6. the communication system between process, is characterized in that, comprising: the first process communication device and the second process communication device;
Described first process communication device comprises storage unit and transmitting element;
Described second process communication device comprises receiving element, acquiring unit and reading unit;
Described storage unit, for leaving in the internal memory of pre-first to file successively by the first variable and parameter to be sent, wherein each parameter to be sent is using ’ 0 ' as ending, and described first variable is for storing the number of parameter to be sent;
Described transmitting element, for sending to described second process communication device by the first message comprising the first variable and parameter to be sent;
Described receiving element, for receiving the first message that described first process communication device sends;
Described acquiring unit, for obtaining the number of the parameter in the first message according to the first variable in described first message;
Described reading unit, for generating array of pointers according to the number of the parameter in described first message, and utilizes described array of pointers to read all parameters in the first message successively.
7. system according to claim 6, is characterized in that, described first process communication device also comprises the first application unit, and it is the internal memory of M1 that described first application unit is used for according to described first variable and parameter application one block size to be sent:
M1＝sizeof1+strlen1+strlen2+…+strlenN+N；
Wherein, N is the number of the parameter in the first message, and sizeof1 is the length of the first data type of a variable, and strlen1 is the length of first parameter, and strlen2 is the length of second parameter, and strlenN is the length of N number of parameter, and unit is byte.
8. the system according to claim 6 or 7, is characterized in that, described reading unit comprises generation module and read module;
Described generation module is used for generating array of pointers according to the number of the parameter in described first message, and the array element of wherein said array of pointers is respectively p [0], p [1] ..., p [N-1];
Described read module is used for utilizing p [0] to read first parameter, p [i]=p [i-1]+strlen (p [i-1])+1 is utilized to read the i-th+1 parameter, wherein 1≤i≤N, N is the number of the parameter in the first message, and strlen (p [i-1]) is the length of i-th parameter;
Described array element p [0] points to the start address of first parameter in the first message, and described array element p [i-1] points to the start address of i-th parameter in the first message.
9. system according to claim 8, is characterized in that, described second process communication device also comprises the second application unit, and it is the internal memory of M2 that described second application unit is used for according to number application one block size of the parameter in described first message:
M2＝sizeof2*N；
Wherein, sizeof2 is the memory size that a pointer needs.
10. system according to claim 7, is characterized in that, described first data type of a variable is integer or character type.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510466483.9A CN105068878A (en) | 2015-07-30 | 2015-07-30 | Inter-process communication method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510466483.9A CN105068878A (en) | 2015-07-30 | 2015-07-30 | Inter-process communication method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105068878A true CN105068878A (en) | 2015-11-18 |
Family
ID=54498255
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510466483.9A Pending CN105068878A (en) | 2015-07-30 | 2015-07-30 | Inter-process communication method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105068878A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1835444A (en) * | 2005-03-16 | 2006-09-20 | 中兴通讯股份有限公司 | Multi-processor static parameter synchronous system of radio internet controller and method thereof |
| CN101753540A (en) * | 2008-12-02 | 2010-06-23 | 中兴通讯股份有限公司 | Method for transmitting complex message |
| CN103176852A (en) * | 2011-12-22 | 2013-06-26 | 腾讯科技（深圳）有限公司 | Method and device for inter-progress communication |
| CN103425518A (en) * | 2012-05-16 | 2013-12-04 | 深圳市腾讯计算机系统有限公司 | Cross-process data transmission method and cross-process data transmission device |
| CN103974430A (en) * | 2013-02-06 | 2014-08-06 | 电信科学技术研究院 | Data transmission method and device |
-
2015
- 2015-07-30 CN CN201510466483.9A patent/CN105068878A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1835444A (en) * | 2005-03-16 | 2006-09-20 | 中兴通讯股份有限公司 | Multi-processor static parameter synchronous system of radio internet controller and method thereof |
| CN101753540A (en) * | 2008-12-02 | 2010-06-23 | 中兴通讯股份有限公司 | Method for transmitting complex message |
| CN103176852A (en) * | 2011-12-22 | 2013-06-26 | 腾讯科技（深圳）有限公司 | Method and device for inter-progress communication |
| CN103425518A (en) * | 2012-05-16 | 2013-12-04 | 深圳市腾讯计算机系统有限公司 | Cross-process data transmission method and cross-process data transmission device |
| CN103974430A (en) * | 2013-02-06 | 2014-08-06 | 电信科学技术研究院 | Data transmission method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106649346B (en) | Data repeatability checking method and device | |
| CN109697133A (en) | ID generation method, apparatus and system | |
| US10754869B2 (en) | Managing data format of data received from devices in an internet of things network | |
| CN106886483B (en) | Method and device for providing and acquiring terminal application log | |
| GB2562825A (en) | Privacy enhanced central data storage | |
| CN102801784A (en) | Distributed type data storing method and equipment | |
| CN110020353B (en) | Method and device for constructing webpage form | |
| EP3367254A1 (en) | Method and apparatus for generating random character string | |
| CN104423961A (en) | Method and system for generating testing script | |
| CN106101712B (en) | A kind of processing method and processing device of video stream data | |
| CN105022619A (en) | Code processing method and device | |
| CN109145625A (en) | Processing method, device and the block chain data-storage system of policy information | |
| RU2020100462A (en) | COMMUNICATION METHOD, NETWORK DEVICE AND TERMINAL | |
| CN110197445A (en) | Generation, querying method, computer equipment and the storage medium of intellectual property state | |
| CN103778067A (en) | Object processing method and device of Java card and Java card | |
| CN109284453A (en) | Data download method and device based on PDF document, storage medium, terminal | |
| CN104077374B (en) | A kind of method and device for realizing the storage of IP disk files | |
| CN115002196B (en) | Data processing method and device and vehicle end acquisition equipment | |
| US20130282782A1 (en) | Distribution apparatus, restoration apparatus, distribution method, restoration method, and distribution and restoration system | |
| CN109582776B (en) | Model generation method and device, electronic device and storage medium | |
| CN106796587A (en) | Checking analysis result | |
| CN105068878A (en) | Inter-process communication method and system | |
| CN108776665B (en) | Data processing method and device | |
| US10943168B2 (en) | System and method for determining an artificial intelligence model in a decentralized network | |
| CN116383329A (en) | Data importing method, device, equipment and medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination |