CN1549108A - Method for realizing communication process zero copy information queue - Google Patents
Method for realizing communication process zero copy information queue Download PDFInfo
- Publication number
- CN1549108A CN1549108A CNA031134130A CN03113413A CN1549108A CN 1549108 A CN1549108 A CN 1549108A CN A031134130 A CNA031134130 A CN A031134130A CN 03113413 A CN03113413 A CN 03113413A CN 1549108 A CN1549108 A CN 1549108A
- Authority
- CN
- China
- Prior art keywords
- message
- message queue
- pointer
- queue
- semaphore
- 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.)
- Granted
Links
Images
Abstract
The present invention relates to the method of realizing zero-copy message queue during communication. The zero-copy message queue is one circulating buffer area comprising pointers to message body data, and its data structure includes message queue head pointer, tail pointer, current message number, total message number, repellent operation signal amount, counted signal amount, etc. The present invention ensures no memory copy during message communication, and may be used widely in embedded operation system. The comparison test with VxWorks message queue shows that the present invention has greatly raise communication rate, lowered memory occupation during communication and saving in system resource. In addition, the present invention supports several operation systems and is favorable to transplantation of application program in different operation systems.
Description
Technical field
The present invention relates to a kind of method that operating system task or cross-thread communicate that is implemented in, specifically is a kind of in communication process, realizes the method for zero-copy message queue, is applicable between the embedded real-time operating system task, communicates by message queue.
Background technology
Along with world economy enters digital New Economy Era, telecommunication technology and information network technique have obtained unprecedented fast development.The great variety of the communications field from the network to the business promoting the sustainable development of data service, and the flow of data service may surpass the voice service flow in 2～3 years.
Business based on the packet exchange will cover whole conventional telecommunications business in 5～10 years.Thereby the signaling flow communication mode in single voice service circuit switching, become protocol streams and signaling flow communication mode in the exchange of mass data business datum, the traffic increases greatly, and traffic rate is also increasing, and this is just to having higher requirement by operating system transmission control flow data.
Modern operating system usually is to carry out communication between task by the mode of message, and message queue provides a kind of senior intertask communication mechanism, has been widely used in embedded system.But the message queue that present operating system provides is in the process of carrying out message communicating; for the protection to task context is provided; common way is to send the message copying of task private room to the system buffer; copy to the private room of reception task from the system buffer again; in the information receiving and transmitting process, there is message memory copying repeatedly like this; on the one hand a large amount of consume system resources, communication efficiency also greatly reduces on the other hand.
1. in VxWorks system, system sends message by msgQSend () function, receives message by msgQReceive () function.The reception task that is sent in of a message waits under the situation of this message queue, be through a memory copying: send the private room of the private room of task to the reception task.And when the reception task is not waited for this message queue, pass through the secondary memory copying: the buffer zone from the private room that sends task to system message queue; Again from the message queue buffer zone to the private room that receives task.If the message that sends is bigger, then also must strengthens the stack space of the transmission task and the task of reception, otherwise cause storehouse to overflow easily.
2. in the general-purpose operating system such as Windows NT, system sends asynchronous message by PostMessage () function, sends synchronization message by SendMessage () function, receives message by GetMessage () or PeekMessage ().In the windows program, when application program sends task of window execution of a message informing appointment, PostMessage () function be MSG message structure of this message establishing and with this message copying in message queue, and application program is taken out (copying local context from message queue to) by message circulation with this message, and distributes corresponding window and handle.As seen, also there is repeatedly memory copying problem in message in distributing process.
Moreover the application program of the communications field is based on message-driven mostly, and is very frequent to the operation of message queue, and the message queue calling interface that present various operating system provides is inconsistent, causes the transplanting of application code very inconvenient, and readability is also very poor.
Summary of the invention
To the objective of the invention is the shortcoming that there has been repeatedly memory copying in the existing operating system message queue in order having overcome, to have proposed a kind ofly in communication process, realize the method for zero-copy message queue, to guarantee not having memory copying in the message communicating process.The present invention supports urgent and common two-stage message, and provide multiple query interface, adaptive by to semaphore and mutual exclusion mechanism, can be widely used in embedded OS such as VxWorks, pSoS, and general-purpose operating system Windows NT, several operation systems such as Linux shield the difference of various operating systems.
The present invention is achieved in that
A kind of method that realizes the communication process zero-copy message queue comprises the steps:
First step semaphore is adaptive: create, obtain, discharge, delete one the general semaphore of various operating systems is comprised vxworks, pSos, Windows NT, operating systems such as Linux.
The second step mutex is adaptive: create, obtain, discharge, delete one the general mutex of various operating systems is comprised vxworks, pSos, Windows NT, operating systems such as Linux.
The 3rd step system message queue pond initialization: in the system buffer, distribute a message queue pond to create the index information of whole message queue during system initialization.
The 4th step was created message queue: search a still unappropriated message queue from the message queue pond, return the numbering of this message, be used for the transmission and the reception of message.
The 5th step sent message: on the message queue of appointment, send message data, if urgent message is added this message to the message queue head, common message is added this message to the message queue tail, returns success at last or fails.
The 6th step received message: receive message on the message queue of appointment, and return the pointer of send buffer.If message queue is for empty: when timeout parameter is 0, return null pointer immediately; When timeout parameter is-1, task enters blocks formation and forever waits for; When timeout parameter is other value, task postpones a period of time and continues operation.When the message queue non-NULL, take out a message and turn back to send buffer from the message queue head.
The 7th step deletion message queue: no message queue is needed deletion, and discharge the internal memory that it takies.The deletion message queue is an inverse process of creating message queue, by message queue ID number of appointment judged whether it uses, if do not use, the deletion failure if use, then discharges the message internal memory in this message queue, the flush message number, and be set to not use.
The 8th step query messages number: need to obtain the message queue of inquiry by the input call number, and return message count wherein.
Adopt the method for zero-copy message communicating of the present invention, by with the contrast test of VxWorks message queue, compared with prior art, improved traffic rate greatly, reduced the EMS memory occupation in the communication process simultaneously, saved valuable system resource.Because it supports several operation systems, therefore help being structured in the transplanting of the application program on the various operating systems simultaneously.
Description of drawings
What Fig. 1 provided is VxWorks message queue implementation;
What Fig. 2 provided is that zero-copy message queue realizes principle;
What Fig. 3 provided is the realization flow of zero-copy message queue;
What Fig. 4 provided is to create the message queue flow process;
What Fig. 5 provided is to send message flow;
What Fig. 6 provided is to receive message flow;
What Fig. 7 provided is deletion message queue flow process.
Embodiment
Fig. 1 has introduced VxWorks message queue implementation, and message queue distributes and message queue of initialization in system space when initialization.The message number of the maximum that can line up with it and the maximum byte length of each message are allocated enough cushion spaces in advance as parameter.When task and ISR call msgQSend () function when message queue sends message, if there is not the message of task in waiting for this formation, this message enters the buffering of message queue so.If there is task to wait for the message of this formation, this message is submitted to the task of first wait immediately so.When message queue is expired, promptly when formation does not have available buffering, certain overtime of transmission task wait.When overtime be NO_WAIT (0), the transmission task is returned mistake immediately.When overtime be WAIT_FOREVER (1), the transmission task enters the obstruction task queue.When overtime when being other, the transmission task postpones a period of time and continues operation again.Task call msgQReceive () function receives message from message queue.If existing available message in the buffer queue, first message dequeue immediately so, and return to caller.If there is not message to use, caller will block, and enter in the task queue of waiting for this message to line up.This shows that in VxWorks, the reception task that is sent in of a message waits under the situation of this message queue, be through a memory copying: send the private room of the private room of task to the reception task.And not do not bide one's time at this message queue etc. in the reception task, pass through the secondary memory copying: buffer zone from the private room of transmission task to system message queue; Again from the message queue buffer zone to the private room that receives task.
Fig. 2 has introduced zero-copy message queue and has realized principle.Zero-copy message queue is a cyclic buffer of being made up of the pointer of refer message volume data, and its data structure comprises total message number of head pointer, the tail pointer of message queue, current message number, message queue and mutually exclusive operation semaphore, counting semaphore etc.In the system buffer, distribute a message queue pond to create the index information of whole message queue during system initialization.When one of task creation is used for the message queue of intertask communication, from the message queue pond, search a still unappropriated message queue, return the numbering of this message, be used for the transmission and the reception of message.When message sent, if common message, the pointer that sends task data was articulated to the afterbody of current message queue, if urgent message, then the pointer of this message data was added to the head of message queue.If arrive the border of message queue, do border pointer adjustment.Discharge the semaphore of waiting on this message queue after transmission finishes, promptly counting semaphore adds 1.When receiving message, the reception task is taken out the pointer of first message from queue heads, and it is returned to reception task buffer zone, makes suitable pointer operation simultaneously.If message queue is empty, receive the counting semaphore of waiting for this message queue, promptly counting semaphore subtracts 1.If counting semaphore is then handled according to the receive time-out value parameter accordingly less than 0 at this moment.Owing in the transmission of message and receiving course, adopted the pointer transmission, do not carried out memory copying.
Fig. 3 has introduced the flow process of creating message queue.Initial message formation pond at first is if the initialization function is just no longer called in the initialization of message queue pond.After initialization is finished, from the system message queue pond, search a still untapped message queue,, then return the index value of an invalid message formation if do not find; If find a still untapped message queue, then the value of this message queue of initialization comprises head pointer, tail pointer, message count, creates the mutex amount, creates counting semaphore etc.This operation need measure mutual exclusion with overall signal owing to be operation to global data in step.After this message queue of initialization is finished, the index of return messages formation.
Fig. 4 has introduced the transmission message flow.At first input parameter is carried out effect, illegal parameter output print information is also returned to send and is failed.Then enter the key code segment protect: the key code segment protect can be realized with switch interrupts or with semaphore, comes adaptive by macro switch.If the interruption mutual exclusion, lock interrupts; If semaphore is got in the semaphore mutual exclusion.Next step is the pointer operation that carries out formation: if urgent message is added this message to the message queue head; If common message is added this message to the message queue tail.Message count in the message queue adds 1 simultaneously.After finishing, operation withdraws from the critical code section protection:, open and interrupt lock if interrupt mutual exclusion.If the semaphore mutual exclusion, release semaphore.After message was added message queue to, the transmission task need discharge the counting semaphore of wait on this message queue, and this counting semaphore adds 1, and it is ready that the obstruction task is entered, and allowed kernel traffic control core.Return at last and send the message success.
Fig. 5 has introduced the reception message flow.At first input parameter is carried out effect, if the non-rule of parameter is returned null pointer.At first obtain the operation this message queue pointer, obtain counting semaphore then, make counting semaphore subtract 1, if this counting semaphore less than 0, then calling task will be handled according to timeout parameter: when timeout parameter is 0, return null pointer immediately; When timeout parameter is-1, task enters blocks formation and forever waits for; When timeout parameter is other value, task postpones a period of time and continues operation.When calling task resumes operation; if message queue is empty; return null pointer; otherwise carry out the core data operation: at first enter the key code protection; then carry out pointer operation, take out a message, return to caller from the message queue head; message count in the message queue subtracts 1 simultaneously, withdraws from the key code protection after the taking-up message.Return the message of taking-up at last.
Fig. 6 has introduced the flow process of deletion message queue.The deletion message queue is an inverse process of creating message queue, at first obtain the pointer of this message queue of operation, if this message queue does not use, then return deletion error, otherwise obtain the pointer of this message queue, head pointer, tail pointer, message count, maximum number of messages equivalence are set to 0, delete the mutex amount simultaneously, wait for counting semaphore, and this action need is done the mutual exclusion in global data district.Return at last and delete successfully.
Fig. 7 has introduced the flow process that how to realize the message queue scheme.8 steps to the scheme introduced have previously been carried out the process flow diagram realization, promptly semaphore is adaptive, mutex is adaptive, the message queue initialization, create message queue, send message, receive message, deletion message queue, query messages formation etc.
Claims (12)
1. a method that realizes the communication process zero-copy message queue comprises the steps:
It is adaptive to carry out semaphore: create, obtain, discharge, delete one to the general semaphore of operating system;
It is adaptive to carry out mutex: create, obtain, discharge, delete one to the general mutex of operating system;
To the initialization of system message queue pond: during system initialization, in the system buffer, distribute a message queue pond, to create the index information of whole message queue;
Create message queue: from the message queue pond, search a still unappropriated message queue, return the numbering of this message, be used for the transmission and the reception of message;
Send message: on the message queue of appointment, send message data;
Receive message: on the message queue of appointment, receive message, and return the pointer of send buffer;
Deletion message queue: no message queue is needed deletion, and discharge the internal memory that it takies;
Query messages number: need to obtain the message queue of inquiry by the input call number, and return message count wherein.
2. realize the method for zero-copy message queue according to claim 1, it is characterized in that:
The described operating system that is common to institute's adaptation signal amount and mutex comprises vxworks, pSos, Windows NT, Linux etc.
3. realize the method for zero-copy message queue according to claim 1, it is characterized in that: described transmission message:
Be urgent message, add this message to the message queue head;
Be common message, add this message to the message queue tail.
4. realize the method for zero-copy message queue according to claim 1, it is characterized in that:
The message queue of described reception message is for empty: timeout parameter is 0, returns null pointer immediately; Timeout parameter is-1, and task enters the obstruction formation and forever waits for; Timeout parameter is other value, and task postpones a period of time and continues operation,
The message queue non-NULL of described reception message takes out a message and turns back to send buffer from the message queue head.
5. realize the method for zero-copy message queue according to claim 1, it is characterized in that:
Described deletion message queue is used to judge whether the specify message formation is used for ID number,
If do not use, the deletion failure;
If use, the message internal memory in this message queue is discharged, the flush message number, and be set to not use.
6. realize the method for zero-copy message queue according to claim 1, it is characterized in that:
Described message queue is a cyclic buffer of being made up of the pointer of refer message volume data, and its data structure comprises total message number of head pointer, the tail pointer of message queue, current message number, message queue and mutually exclusive operation semaphore, counting semaphore etc.
7. as the method for realization zero-copy message queue as described in claim 1 or 3, it is characterized in that: described transmission message:
Be common message, the pointer that sends task data is articulated to the afterbody of current message queue;
Be urgent message, then the pointer of this message data added to the head of message queue;
Arrive the border of message queue, do border pointer adjustment;
Discharge the semaphore of waiting on this message queue after transmission finishes, promptly counting semaphore adds 1.
8. as the method for realization zero-copy message queue as described in claim 1 or 4, it is characterized in that: described reception message:
The reception task is taken out the pointer of first message from the message queue head, and it is returned to reception task buffer zone, makes suitable pointer operation simultaneously,
If message queue is empty, receive the counting semaphore of waiting for this message queue, promptly counting semaphore subtracts 1;
If counting semaphore is then handled according to the receive time-out value parameter accordingly less than 0 at this moment.
9. realize the method for zero-copy message queue according to claim 1, it is characterized in that: described establishment message queue further comprises the steps:
Initial message formation pond,
From the system message queue pond, search a still untapped message queue: do not find, then return the index value of an invalid message formation; Find a still untapped message queue, then the value of this message queue of initialization utilizes overall signal to measure mutual exclusion, comprises head pointer, tail pointer, message count, and create the mutex amount, create counting semaphore etc.,
Finish this message queue of initialization, the index of return messages formation.
10. realize the method for zero-copy message queue according to claim 1, it is characterized in that: described transmission message further comprises the steps:
Input parameter is carried out effect, and illegal parameter output print information is also returned to send and is failed,
Enter the key code segment protect: utilize switch interrupts or use semaphore, adaptive by macro switch, be to interrupt mutual exclusion, lock interrupts; Be the semaphore mutual exclusion, get semaphore,
Carry out the pointer operation of message queue: be urgent message, add this message to the message queue head; Be common message, add this message to the message queue tail, the message count in the message queue adds 1 simultaneously,
Withdraw from the key code segment protect: be to interrupt mutual exclusion, open and interrupt lock; Be the semaphore mutual exclusion, release semaphore,
After message was added message queue to, the transmission task need discharge the counting semaphore of wait on this message queue, and this counting semaphore adds 1, and it is ready that the obstruction task is entered, and allowed kernel traffic control core,
Return and send the message success.
11. realize the method for zero-copy message queue according to claim 1, it is characterized in that: described reception message further comprises the steps:
Input parameter is carried out effect, and the non-rule of parameter is returned null pointer,
Obtain the pointer of this message queue of operation, obtain counting semaphore then, make counting semaphore subtract 1, this counting semaphore is less than 0, and then calling task will be handled according to timeout parameter; Timeout parameter is 0, returns null pointer immediately; Timeout parameter is-1, and task enters the obstruction formation and forever waits for; Timeout parameter is other value, and task postpones a period of time and continues operation, and calling task resumes operation,
Message queue is empty, returns null pointer, otherwise carries out the core data operation: at first enter the key code protection; then carry out pointer operation, take out a message, return to caller from the message queue head; message count in the message queue subtracts 1 simultaneously, withdraws from the key code protection after the taking-up message
Return the message of taking-up.
12. realize the method for zero-copy message queue according to claim 1, it is characterized in that: described deletion message queue further comprises the steps:
Obtain the pointer of this message queue of operation, this message queue does not use, and then returns deletion error; Otherwise obtain the pointer of this message queue, do the mutual exclusion in global data district, head pointer, tail pointer, message count, maximum number of messages equivalence are set to 0, delete the mutex amount simultaneously, wait for counting semaphore;
Return and delete successfully.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB031134130A CN1312577C (en) | 2003-05-07 | 2003-05-07 | Method for realizing communication process zero copy information queue |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB031134130A CN1312577C (en) | 2003-05-07 | 2003-05-07 | Method for realizing communication process zero copy information queue |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1549108A true CN1549108A (en) | 2004-11-24 |
| CN1312577C CN1312577C (en) | 2007-04-25 |
Family
ID=34320072
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB031134130A Expired - Fee Related CN1312577C (en) | 2003-05-07 | 2003-05-07 | Method for realizing communication process zero copy information queue |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1312577C (en) |
Cited By (22)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100464304C (en) * | 2006-08-29 | 2009-02-25 | 飞塔信息科技（北京）有限公司 | Device and method for realizing zero copy based on Linux operating system |
| CN101146028B (en) * | 2006-09-12 | 2010-11-24 | 中兴通讯股份有限公司 | A packet data extraction method in communication system |
| CN101470623B (en) * | 2007-12-26 | 2011-02-16 | 无锡江南计算技术研究所 | Queue management method and queue management device, method and system for processing queue message |
| US8020141B2 (en) | 2004-12-06 | 2011-09-13 | Microsoft Corporation | Operating-system process construction |
| US8032898B2 (en) | 2006-06-30 | 2011-10-04 | Microsoft Corporation | Kernel interface with categorized kernel objects |
| CN101470636B (en) * | 2007-12-27 | 2011-10-26 | 北京东方通科技股份有限公司 | Message read-write method and apparatus |
| US8074231B2 (en) | 2005-10-26 | 2011-12-06 | Microsoft Corporation | Configuration of isolated extensions and device drivers |
| CN101409715B (en) * | 2008-10-22 | 2012-04-18 | 中国科学院计算技术研究所 | Method and system for communication using InfiniBand network |
| CN101634956B (en) * | 2009-08-25 | 2012-08-08 | 华为技术有限公司 | Dispatching method and dispatcher of information of polynuclear processor |
| CN102902542A (en) * | 2012-09-27 | 2013-01-30 | Tcl通力电子（惠州）有限公司 | virtual interface configuration method and device |
| CN101576884B (en) * | 2008-05-07 | 2013-03-20 | 中兴通讯股份有限公司 | Implementation method for chain fracture cache file management |
| US8789063B2 (en) | 2007-03-30 | 2014-07-22 | Microsoft Corporation | Master and subordinate operating system kernels for heterogeneous multiprocessor systems |
| US8849968B2 (en) | 2005-06-20 | 2014-09-30 | Microsoft Corporation | Secure and stable hosting of third-party extensions to web services |
| WO2016134634A1 (en) * | 2015-02-27 | 2016-09-01 | 中兴通讯股份有限公司 | Message receiving method, apparatus and device, computer storage medium and central processing unit |
| CN106851015A (en) * | 2017-03-10 | 2017-06-13 | 广东欧珀移动通信有限公司 | Adjust method, device and the terminal of broadcast message queue |
| CN107247631A (en) * | 2017-07-04 | 2017-10-13 | 深圳市西迪特科技有限公司 | General GPON OLT system communication between plates middleware systems |
| CN107391279A (en) * | 2017-07-31 | 2017-11-24 | 山东浪潮云服务信息科技有限公司 | A kind of message queue container creation method, device and message queue container |
| CN110856004A (en) * | 2019-11-05 | 2020-02-28 | 北京字节跳动网络技术有限公司 | Message processing method and device, readable storage medium and electronic equipment |
| CN111240828A (en) * | 2019-12-30 | 2020-06-05 | 苏州大学 | Synchronous communication system and method of embedded real-time operating system |
| CN111537791A (en) * | 2020-07-01 | 2020-08-14 | 杭州雷甸科技有限公司 | Intelligent electric meter based on embedded operating system |
| CN114168365A (en) * | 2021-12-07 | 2022-03-11 | 中国船舶重工集团公司第七0七研究所 | Real-time data recording method based on stm32f450 processor |
| CN115225525A (en) * | 2022-07-07 | 2022-10-21 | 金锐软件技术(杭州)有限公司 | Network flow management system based on internet |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2167633A1 (en) * | 1995-01-23 | 1996-07-24 | Leonard R. Fishler | Apparatus and method for efficient modularity in a parallel, fault tolerant, message based operating system |
| US6081890A (en) * | 1998-11-30 | 2000-06-27 | Intel Corporation | Method of communication between firmware written for different instruction set architectures |
-
2003
- 2003-05-07 CN CNB031134130A patent/CN1312577C/en not_active Expired - Fee Related
Cited By (31)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8020141B2 (en) | 2004-12-06 | 2011-09-13 | Microsoft Corporation | Operating-system process construction |
| US8849968B2 (en) | 2005-06-20 | 2014-09-30 | Microsoft Corporation | Secure and stable hosting of third-party extensions to web services |
| US8074231B2 (en) | 2005-10-26 | 2011-12-06 | Microsoft Corporation | Configuration of isolated extensions and device drivers |
| US8032898B2 (en) | 2006-06-30 | 2011-10-04 | Microsoft Corporation | Kernel interface with categorized kernel objects |
| CN100464304C (en) * | 2006-08-29 | 2009-02-25 | 飞塔信息科技（北京）有限公司 | Device and method for realizing zero copy based on Linux operating system |
| CN101146028B (en) * | 2006-09-12 | 2010-11-24 | 中兴通讯股份有限公司 | A packet data extraction method in communication system |
| US8789063B2 (en) | 2007-03-30 | 2014-07-22 | Microsoft Corporation | Master and subordinate operating system kernels for heterogeneous multiprocessor systems |
| CN101470623B (en) * | 2007-12-26 | 2011-02-16 | 无锡江南计算技术研究所 | Queue management method and queue management device, method and system for processing queue message |
| CN101470636B (en) * | 2007-12-27 | 2011-10-26 | 北京东方通科技股份有限公司 | Message read-write method and apparatus |
| CN101576884B (en) * | 2008-05-07 | 2013-03-20 | 中兴通讯股份有限公司 | Implementation method for chain fracture cache file management |
| CN101409715B (en) * | 2008-10-22 | 2012-04-18 | 中国科学院计算技术研究所 | Method and system for communication using InfiniBand network |
| CN101634956B (en) * | 2009-08-25 | 2012-08-08 | 华为技术有限公司 | Dispatching method and dispatcher of information of polynuclear processor |
| CN102902542A (en) * | 2012-09-27 | 2013-01-30 | Tcl通力电子（惠州）有限公司 | virtual interface configuration method and device |
| CN102902542B (en) * | 2012-09-27 | 2016-06-01 | Tcl通力电子（惠州）有限公司 | Virtual interface configuration method and device |
| WO2016134634A1 (en) * | 2015-02-27 | 2016-09-01 | 中兴通讯股份有限公司 | Message receiving method, apparatus and device, computer storage medium and central processing unit |
| CN105991475B (en) * | 2015-02-27 | 2020-01-07 | 中兴通讯股份有限公司 | Message receiving method, device and central processing unit |
| CN105991475A (en) * | 2015-02-27 | 2016-10-05 | 中兴通讯股份有限公司 | Message receiving method and device, and central processing unit |
| CN106851015A (en) * | 2017-03-10 | 2017-06-13 | 广东欧珀移动通信有限公司 | Adjust method, device and the terminal of broadcast message queue |
| CN106851015B (en) * | 2017-03-10 | 2020-09-22 | Oppo广东移动通信有限公司 | Method, device and terminal for adjusting broadcast message queue |
| CN107247631A (en) * | 2017-07-04 | 2017-10-13 | 深圳市西迪特科技有限公司 | General GPON OLT system communication between plates middleware systems |
| CN107247631B (en) * | 2017-07-04 | 2020-07-28 | 无锡雷华网络技术有限公司 | Universal GPON-O L T system inter-board communication middleware system |
| CN107391279B (en) * | 2017-07-31 | 2020-08-25 | 浪潮云信息技术股份公司 | Message queue container creation method and device and message queue container |
| CN107391279A (en) * | 2017-07-31 | 2017-11-24 | 山东浪潮云服务信息科技有限公司 | A kind of message queue container creation method, device and message queue container |
| CN110856004B (en) * | 2019-11-05 | 2022-02-01 | 北京字节跳动网络技术有限公司 | Message processing method and device, readable storage medium and electronic equipment |
| CN110856004A (en) * | 2019-11-05 | 2020-02-28 | 北京字节跳动网络技术有限公司 | Message processing method and device, readable storage medium and electronic equipment |
| CN111240828A (en) * | 2019-12-30 | 2020-06-05 | 苏州大学 | Synchronous communication system and method of embedded real-time operating system |
| WO2021136127A1 (en) * | 2019-12-30 | 2021-07-08 | 苏州大学 | Synchronous communication system and method for embedded real-time operating system |
| CN111537791A (en) * | 2020-07-01 | 2020-08-14 | 杭州雷甸科技有限公司 | Intelligent electric meter based on embedded operating system |
| CN114168365A (en) * | 2021-12-07 | 2022-03-11 | 中国船舶重工集团公司第七0七研究所 | Real-time data recording method based on stm32f450 processor |
| CN114168365B (en) * | 2021-12-07 | 2023-06-20 | 中国船舶重工集团公司第七0七研究所 | Real-time data recording method based on stm32f450 processor |
| CN115225525A (en) * | 2022-07-07 | 2022-10-21 | 金锐软件技术(杭州)有限公司 | Network flow management system based on internet |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1312577C (en) | 2007-04-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1549108A (en) | Method for realizing communication process zero copy information queue | |
| CA2200929C (en) | Periodic process scheduling method | |
| WO2017133623A1 (en) | Data stream processing method, apparatus, and system | |
| CN101141742B (en) | Application communication method of terminal | |
| CN101102360B (en) | A method for automatic form return | |
| CN1270732A (en) | Process scheduling in computer network | |
| US6907606B1 (en) | Method for implementing event transfer system of real time operating system | |
| CN1784658A (en) | Threshold on unblocking a processing node that is blocked due to data packet passing | |
| CN1152313C (en) | Section-by-section congestion control method based on random early detection | |
| CN100563286C (en) | A kind of NGN call transferring method and system | |
| CN1832517A (en) | Method for implementing new service based on H.248 protocol | |
| CN100341270C (en) | Method for reflecting task progress of message based distributed platform client | |
| US8473579B2 (en) | Data reception management apparatus, systems, and methods | |
| CN111722942A (en) | Transformation method of distributed real-time operating system | |
| CN1327664A (en) | Triggering of intelligent network service | |
| CN1602078A (en) | Method and device of realizing synchronous switchover of CLDS crosslink matrix | |
| CN111414244B (en) | Method for efficiently calling cipher machine | |
| CN1206304A (en) | Message management in wireless selective call receiver | |
| CN1411217A (en) | Method of raising IP message forwarding speed utilizing slow storage technology | |
| CN1976377A (en) | Method for realizing intelligent business flexible trigger in soft exchange system | |
| CN1946116A (en) | Exchanger and call transfer method | |
| CN100531039C (en) | Method for implementing client system state machine using database | |
| CN1805491A (en) | Local charging system and method for IP calls | |
| CN1514656A (en) | Intelligeat network control method of network exchange equipment | |
| CN1239850A (en) | Total and remaining sum polling system and method for intelligent mobile ntwork |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20181017 Address after: 510640 2414-2416 of the main building 371, five mountain road, Tianhe District, Guangzhou, Guangdong. Patentee after: Guangdong Gaohang Intellectual Property Operation Co., Ltd. Address before: 518057 Department of law, Zhongxing building, South Science and technology road, Nanshan District hi tech Industrial Park, Shenzhen Patentee before: ZTE Corporation |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20181107 Address after: 221300 room 103, student Pioneer Park, Pizhou, Xuzhou, Jiangsu Patentee after: Jiangsu Sannong Tesco Agel Ecommerce Ltd Address before: 510640 2414-2416 of the main building 371, five mountain road, Tianhe District, Guangzhou, Guangdong. Patentee before: Guangdong Gaohang Intellectual Property Operation Co., Ltd. |
|
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20070425 Termination date: 20180507 |