CN102880507A - Method for applying and distributing chain structure message - Google Patents
Method for applying and distributing chain structure message Download PDFInfo
- Publication number
- CN102880507A CN102880507A CN2012103359337A CN201210335933A CN102880507A CN 102880507 A CN102880507 A CN 102880507A CN 2012103359337 A CN2012103359337 A CN 2012103359337A CN 201210335933 A CN201210335933 A CN 201210335933A CN 102880507 A CN102880507 A CN 102880507A
- Authority
- CN
- China
- Prior art keywords
- message
- chain structure
- thread
- distribution
- application
- 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
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a method for applying and distributing a chain structure message. The method comprises the steps of: (a) generation of the chain structure message; and (b) distribution of the chain structure message. During the generation of the chain structure message, a message pool module distributes a continuous memory space at one time according to the size of a message, divides a memory into a plurality of blocks according to the size of a message body, and connects the blocks by using pointers. During the distribution of the chain structure message, a message chain table module sends the message to a thread and connects the message to the head or tail of a target thread message queue according to different message priorities. The method for applying and distributing the chain structure message provided by the invention has the advantages that an application and release mechanism of a message pool and a distribution mechanism of a chain message are employed, the problem of dependence of an application program on an operating system is solved, the transportability and stability of the application program are improved, the method is high in multiplex rate, the difference of different operating system inlets is avoided, and function extension is facilitated.
Description
Technical field
The present invention relates to communication technical field, relate in particular to the method for the application of a kind of chain structure message and distribution.
Background technology
Along with the development of science and technology, the professional Wireless Telecom Equipment that is applied in public security, fire-fighting, traffic and the fields such as military requires the security that provides higher.In the real-time system of multitask preemptive type, often finishing of a job will be finished jointly by a plurality of tasks or a plurality of task and a plurality of interruption processing procedure (ISRs Interrupt Service Routine).Must coordination work in coordination between them, even need exchange message to communicate.As: task and other tasks and ISRs swap data, task and other tasks synchronization.Therefore must the assurance task can carry out to shared resource the access of mutual exclusion.
In order to satisfy intertask communication synchronously and the needs of mutual exclusion, guarantee simultaneously resource by the use of safety, must coordinate at the order of carrying out a plurality of inter-related tasks.In the existing Wireless Telecom Equipment, software development model exists that the intermodule coupling is strong, and reusability is low, the bottleneck problem that stability is not high.
Summary of the invention
The object of the present invention is to provide the method for the application of a kind of chain structure message and distribution, solved application program to the Dependence Problem of operating system, strengthened the portable and stable of application program, reusability is high.
The objective of the invention is to be achieved through the following technical solutions.
The method of the application of a kind of chain structure message and distribution comprises step:
A: the generation of chain structure message: the message pool module is according to the size of message, and then the memory headroom that disposable distribution one is continuous is divided into some with internal memory according to the size of message body, these pieces is coupled together with pointer again;
B: the distribution of chain structure message: message chained list module is different according to message priority, and the message that sends to thread will be connected to head or the tail of subject thread message queue.
Preferably, also comprise between step a and the step b: the release of chain structure message: when the user uses assignment messages, directly from the free message chained list of message pool, take out a piece of news, when the user is finished this message, directly message is hung and get back in the free message chained list of message pool.
Preferably, the message that sends to thread among the step b comprises: general message and prioritized messages;
Described general message linkage is last to the subject thread message queue, adopts the order of first in first out to send;
Described prioritized messages is connected to the foremost of subject thread message queue, adopts the order that last in, first out to send.
Preferably, the reception of described chain structure message comprises: common receipt message, regularly answer and the regularly answer of receipt message of receipt message, receipt message.
Preferably, the transmission of described chain structure message comprises: common transmission message, timed sending message, the answer that sends message and the answer of timed sending message.
The present invention compared with prior art, beneficial effect is: message application and the distribution method of chain structure provided by the invention, adopt application and the releasing mechanism of message pool, the distribution mechanisms of chain type message, solved application program to the Dependence Problem of operating system, strengthened the portable and stable of application program, reusability is high.Also solve simultaneously the otherness of different operating system entrance, be convenient to the expansion of function.
Description of drawings
Fig. 1 is chain structure message of the present invention application and distribution flow figure.
Fig. 2 is that message pool of the present invention is distributed synoptic diagram.
Fig. 3 is message chained list pass-along message synoptic diagram of the present invention.
Embodiment
The present invention mainly provides EventDispatcher, Semaphore, four kinds of modes of Mutex, Queue on message synchronization communication function.A basic embedded OS message mechanism comprises: Task scheduling, Task management, synchronous communication, interrupt management, time management function etc.The below briefly introduces four kinds of message passing mechanisms in the lower communication process.
1) semaphore service
Semaphore provides the mechanism of controlling application program critical section operation.OSAL provides the calculating semaphore of scope from 0～32767 (BIOS) 0 ~ 4294967295 (Nucleus).Two basic operations of semaphore are Obtain/Release.Obtain semaphore request consumption signal amount, the request of Release semaphore has increased semaphore.
Hang up:
The operation of picked up signal amount provides the services such as unconditional hang-up, time slot are hung up, nothing hang-up.One is attempted to obtain current count value is that the task of zero-signal amount can be suspended, and when the release semaphore request occured, task recovery was possible (not being certain).
Multitask is hung up and to be attempted to obtain same semaphore, relies on semaphore to create mode, and task both can the FIFO order, also can priority orders hang up.If semaphore supports FIFO to hang up, task is attempted the order recovery of picked up signal amount according to them; In addition, if semaphore supports priority to hang up, task is from high priority to the low priority order recovery.
Deadlock:
Each task is answered the problem of attention system produce of deadlock when using system resource.So-called deadlock refer to that each concurrent task waits for the resource that the other side has each other, and these concurrent tasks can not discharge the own resource that has before obtaining the other side's resource.Thereby cause everybody all to expect resource and all can not get resource, the state that each concurrent task can not continue to push ahead.
2) mutual exclusion lock service
The operation of mutual exclusion lock comprises mainly that mutual exclusion lock creates, locks, release, destruction mutual exclusion lock.Wherein mutual exclusion lock can be divided into quick mutual exclusion lock, recurrence mutual exclusion lock and error detection mutual exclusion lock, and the difference of these three kinds of locks is mainly whether other threads that do not occupy mutual exclusion lock need to wait for hang-up when hope obtains mutual exclusion lock.Fast lock refers to that invokes thread can block until thread lock obtains release; The lock number of times of invokes thread in mutual exclusion can successfully be returned and increase to recursive locks, such as a chained list when the operation of inserting, the operation that can search; The error detection lock then is the unblock version of quick mutual exclusion lock, and it can return and return the information of a mistake immediately.OSAL provides the first mutual exclusion lock.
The difference of mutual exclusion lock and semaphore is:
It is synchronous that semaphore is used for multithreading; A thread has been finished some actions and has just been told other thread by semaphore, and other thread carries out some action again.
Mutual exclusion lock is used for the multithreading mutual exclusion; A thread has taken some resources, and other thread just can't be accessed so, until this thread leaves, other thread just begins to utilize this resource.
Mutual exclusion lock can only be by the thread release that locks; If mutual exclusion lock is locked by certain thread, if this thread goes to lock again then be invalid, that is to say that mutual exclusion lock can only lock once.
3) case distribution service
Event occurs and event is removed two kinds of states for event, by 0,1 expression of each bit in the internal memory.0 this event of expression does not occur or is eliminated, and 1 this event of expression occurs.65535 events (the configurable 1-65535 of user maximum events) can be set at most.Each thread can be waited for generation or the removing of a certain event, if this event has been to occur or remove then thread can not block, if this event does not occur or does not remove then thread block, in case this event occurs or removes then can again change to wake up and wait for the thread that this event produces or removes.The a lot of tasks of same event possibility carry, same task can be waited for a lot of events.
4) message queue service
It can be elongated mechanism that formation provides the size of transmitting a plurality of message, message.Need the user to open up enough buffer zones with receipt message during receipt message.
Message size:
One row message comprises one or more bit bytes.Fixing all supports the maximum message number that need to specify this message queue to deposit during establishment with adjustable length message.
Hang up:
The task of attempting receipt message from empty queue can forever be hung up until data are arranged in the message queue, and also can suspend to has data or surpass till the time beat of appointment in the message queue.
Attempt to send a message to the task of full queue and then can point out error message, but the task recovery that formation is hung up can guarantee task requests the time.For example, suppose that a task hangs up when receipt message is waited in formation.When a message sent to formation, the task of hang-up had just been recovered.
Multitask can be hung up a formation, relies on the task of creating formation to be suspended with FIFO or priority order.
In order to make purpose of the present invention, technical scheme and advantage clearer, below in conjunction with drawings and Examples, the present invention is further elaborated.Should be appreciated that specific embodiment described herein only in order to explain the present invention, is not intended to limit the present invention.
See also shown in Figure 1ly, message application and the distribution of chain structure provided by the invention specifically comprise:
Step 101: the generation of chain structure message and release;
The message pool module is according to the size of message, and then a bulk of continuous memory headroom of disposable distribution is divided into some with internal memory according to the size of message body, these pieces is coupled together with pointer, as shown in Figure 2 again.When the user uses assignment messages, directly from the free message chained list of message pool, take out a piece of news, when the user is finished this message, directly message is hung and get back in the free message chained list of message pool.
The message pool module can be used memory headroom effectively, distributes with release and directly wins from chained list and insert, and speed is rapid.
Consider when there is RAM leakage in when debugging, can very fast discovery and follow the tracks of it, the present invention designs three interface functions, is respectively:
OSAL_AllocateBuffer () // memory headroom of application in message pool
OSAL_DeallocateBuffer () // release message is put back into message in the message pool
OSAL_CloneBuffer () // clone's message according to the message of appointment, gets a untapped message body from the message pool of correspondence, then the content of message is cloned in the new message body
Step 102: the distribution of chain structure message;
Message chained list module is used for the distribution of chain type message, comprises sending and receiving message.
Message makes up by memory cache, therefore realizes by OSAL_AllocateBuffer () when creating a message.The message transmission of cross-thread realizes by OSAL_SendMsg () and similar function in OSAL, and is different according to message priority, and the message that sends to thread will be connected to head or the tail of subject thread message queue, as shown in Figure 3.
The priority of message has two kinds: general and preferential.
General message sends by OSAL_SendMsg (), and is linked to the last of subject thread message queue, adopts using in order of first in first out.
Prioritized messages sends by OSAL_SendPriorityMsg () or OSAL_SendReply (), and this means that also the message of answer all is prioritized messages certainly.Prioritized messages can be connected to the foremost of subject thread message queue, adopts using in order that last in, first out.
The reception of general message is the reception mechanism that realizes cross-thread message by functions such as OSAL_ReceivetMsg ().Simultaneously thread can use OSAL_ReceiveReply () to replace OSAL_ReceivetMsg () to obtain prioritized messages, and this mode can be used for thread and receive a general message that does not receive first from the known prioritized messages of subject thread from other threads.
The receiver function of message is considered different application under the different situations, mainly contain the answer of common receipt message, timing receipt message, receipt message, answer of timing receipt message etc.Commonly used have a following several types:
This function of OSAL_ReceiveMsg is to take out article one message from the Thread Messages chained list.If the message chained list is empty, invokes thread is hung up, until be waken up when in the message chained list message being arranged.And this function receives all types of message (general type/precedence type/answer type);
This function of OSAL_TimedReceiveMsg is to obtain article one message from the Thread Messages chained list.If the message chained list is empty, invokes thread is hung up, until overtime or be waken up when having message to arrive.
OSAL_PeekMsg(unblock formula) this function is to take out article one message from the Thread Messages chained list, but from the message chained list message is not deleted.
This function of OSAL_ReceiveReply is got a message of replying type (reply_type) from the Thread Messages chained list.If when not having such message in the message chained list, the thread that calls this function is suspended.Until when the message of reply_type type was arranged in the message chained list, invokes thread was waken up.
Above-mentioned OSAL_ReceiveReply function is only waited for the message of replying; Before unblocking, then receive equally if receive non-answer message.
Such as the answer message of task1 at wait task2, task3 has sent out a common message to task1 now, then this message then can be inserted into the afterbody of task1 message chained list automatically, and just activate a task task1(task1 is not still suspended state, waits for reply message)
This function of OSAL_TimedReceiveReply is got a message of replying type (reply_type) from the Thread Messages chained list.If when not having this kind of message in the message chained list, the thread that calls this function is suspended.Until have when the reply_type kind of message occurring in the message chained list or overtime, the line transfer journey is waken up.
Above-mentioned OSAL_TimedReceiveReply function is only waited for the message of replying; Before unblocking, then receive equally if receive non-answer message.
Such as the answer message of task1 at wait task2, task3 has sent out a common message to task1 now, then this message then can be inserted into the afterbody of task1 message chained list automatically, and just activate a task task1(task1 is not still suspended state, waits for reply message)
The transmission function of message considers that different application is arranged under the different situations, mainly contains common transmission message, timed sending message, the answer that sends message, answer of timed sending message etc.Commonly used have a following several types:
This function of OSAL_SendMsg sends message to subject thread, and this message is added the afterbody of subject thread message chained list to.
Wherein, call this function send-thread message, need to obtain an idle message piece by OSAL_AllocateBuffer () from message pool.
This function needs and OSAL_AllocateBuffer () supports the use.That is: message blocks of every acquisition can only be used an OSAL_SendMsg () function.Send same message content to different threads such as needs, can obtain repeatedly message blocks, then compose into identical value (also can use OSAL_CloneBuffer ()) to message blocks, call again OSAL_SendMsg () and send respectively.
This function of OSAL_SendMsgReqReply is to send the message that needs answer to subject thread, but invokes thread is not waited for the answer of subject thread.
This function of OSAL_SendMsgAndGetReply is to send the message that needs answer to subject thread, and waits for subject thread answer (do not receive message, this function can not return).
This function of OSAL_SendPriorityMsg is to send a prioritized messages to subject thread, and this message is added the gauge outfit of subject thread message chained list to.
This function of OSAL_SendReply is to reply message.Send a message to the gauge outfit of message chained list of the answer thread of message appointment.
This function of OSAL_SetSignature is that signature is set, the source of identification message.Such as, task1, task2 send message to task3 respectively.Task3 can't distinguish the source of message by OSAL_ReceiveMsg, if the user has this respect demand, can get final product head it off by the signature that this function arranges message.The signature value need to be done unified standard by the user and process.The information signature value of the message of task1 and task2 can not be identical in the above-mentioned example, otherwise can't distinguish the source of message.
Annotate: the value of Signature is that wherein 0xFFFF is used by inside between 0x0000～0xFFFF, does not re-use this value when using signature.The sending and receiving of message is applied in module, ErrorTrack module, RF Manager module, Tone Service module, led module, device management module etc.Application be very extensively and frequent.
Before sending message, use first OSAL_AllocateBuffer () to internal memory of message application, then the message that will send is sent to corresponding thread by OSAL_SendMsg ().Receipt message uses OSAL_ReceiveMsg () to receive by corresponding thread.If but when having this situation to occur, send message to task3 respectively such as task1, task2.Task3 can't distinguish the source of message by OSAL_ReceiveMsg, if the user has this respect demand, but the signature that can message be set by this function is the OSAL_SetSignature head it off.The signature value need to be done unified standard by the user and process.The information signature value of the message of task1 and task2 can not be identical in the above-mentioned example, otherwise can't distinguish the source of message.
Message application and the distribution method of chain structure provided by the invention, adopt application and the releasing mechanism of message pool, the distribution mechanisms of chain type message, solved application program to the Dependence Problem of operating system, strengthened the portable and stable of application program, reusability is high.Also solve simultaneously the otherness of different operating system entrance, be convenient to the expansion of function.
The above only is preferred embodiment of the present invention, not in order to limiting the present invention, all any modifications of doing within the spirit and principles in the present invention, is equal to and replaces and improvement etc., all should be included within protection scope of the present invention.
Claims (5)
1. the method for chain structure message application and distribution is characterized in that, comprises step:
A: the generation of chain structure message: the message pool module is according to the size of message, and then the memory headroom that disposable distribution one is continuous is divided into some with internal memory according to the size of message body, these pieces is coupled together with pointer again;
B: the distribution of chain structure message: message chained list module is different according to message priority, and the message that sends to thread will be connected to head or the tail of subject thread message queue.
2. the method for chain structure message as claimed in claim 1 application and distribution, it is characterized in that, also comprise between step a and the step b: the release of chain structure message: when the user uses assignment messages, directly from the free message chained list of message pool, take out a piece of news, when the user is finished this message, directly message is hung and get back in the free message chained list of message pool.
3. the method for chain structure message as claimed in claim 1 application and distribution is characterized in that, the message that sends to thread among the step b comprises: general message and prioritized messages;
Described general message linkage is last to the subject thread message queue, adopts the order of first in first out to send;
Described prioritized messages is connected to the foremost of subject thread message queue, adopts the order that last in, first out to send.
4. the method for chain structure message as claimed in claim 3 application and distribution is characterized in that, the reception of described chain structure message comprises: common receipt message, regularly answer and the regularly answer of receipt message of receipt message, receipt message.
5. the method for chain structure message as claimed in claim 3 application and distribution is characterized in that, the transmission of described chain structure message comprises: common transmission message, timed sending message, the answer that sends message and the answer of timed sending message.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012103359337A CN102880507A (en) | 2012-09-12 | 2012-09-12 | Method for applying and distributing chain structure message |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012103359337A CN102880507A (en) | 2012-09-12 | 2012-09-12 | Method for applying and distributing chain structure message |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102880507A true CN102880507A (en) | 2013-01-16 |
Family
ID=47481845
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2012103359337A Pending CN102880507A (en) | 2012-09-12 | 2012-09-12 | Method for applying and distributing chain structure message |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102880507A (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103176837A (en) * | 2013-03-27 | 2013-06-26 | 南京大学 | Lock-free message queue implementation method based on reversal single linked list |
| CN103473031A (en) * | 2013-01-18 | 2013-12-25 | 龙建 | Cooperative concurrent message bus, driving member assembly model and member disassembly method |
| CN103761141A (en) * | 2013-12-13 | 2014-04-30 | 北京奇虎科技有限公司 | Method and device for realizing message queue |
| CN104598208A (en) * | 2015-02-11 | 2015-05-06 | 四川天邑康和通信股份有限公司 | Singlechip operating system implementation method based on message queue |
| CN105511967A (en) * | 2015-12-28 | 2016-04-20 | 曙光云计算技术有限公司 | Resource object management method and device for cloud platform |
| CN106681847A (en) * | 2016-12-30 | 2017-05-17 | 深圳Tcl数字技术有限公司 | Message processing method and device based on Android system |
| CN108595282A (en) * | 2018-05-02 | 2018-09-28 | 广州市巨硅信息科技有限公司 | A kind of implementation method of high concurrent message queue |
| CN109120486A (en) * | 2018-08-28 | 2019-01-01 | 珠海格力电器股份有限公司 | WiFi module data transmission method, Transmission system, intelligent appliance data transmission system |
| CN109710542A (en) * | 2018-12-28 | 2019-05-03 | 北京像素软件科技股份有限公司 | A kind of completely N-ary tree construction method and device |
| CN110245006A (en) * | 2019-05-07 | 2019-09-17 | 深圳壹账通智能科技有限公司 | Processing method, device, equipment and the storage medium of block chain affairs |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1713138A (en) * | 2004-06-15 | 2005-12-28 | 中兴通讯股份有限公司 | Deadlock solution in multi-task operating system |
| CN1764187A (en) * | 2004-10-11 | 2006-04-26 | 三星电子株式会社 | The equipment and the method that are used for the socket communication between the application of operating system |
| CN1859325A (en) * | 2006-02-14 | 2006-11-08 | 华为技术有限公司 | News transfer method based on chained list process |
| CN101055533A (en) * | 2007-05-28 | 2007-10-17 | 中兴通讯股份有限公司 | Multithreading processor dynamic EMS memory management system and method |
| CN101140531A (en) * | 2007-10-10 | 2008-03-12 | 中兴通讯股份有限公司 | Quick-speed application EMS memory method |
| CN101504617A (en) * | 2009-03-23 | 2009-08-12 | 华为技术有限公司 | Data transmitting and receiving method and device based on processor sharing internal memory |
-
2012
- 2012-09-12 CN CN2012103359337A patent/CN102880507A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1713138A (en) * | 2004-06-15 | 2005-12-28 | 中兴通讯股份有限公司 | Deadlock solution in multi-task operating system |
| CN1764187A (en) * | 2004-10-11 | 2006-04-26 | 三星电子株式会社 | The equipment and the method that are used for the socket communication between the application of operating system |
| CN1859325A (en) * | 2006-02-14 | 2006-11-08 | 华为技术有限公司 | News transfer method based on chained list process |
| CN101055533A (en) * | 2007-05-28 | 2007-10-17 | 中兴通讯股份有限公司 | Multithreading processor dynamic EMS memory management system and method |
| CN101140531A (en) * | 2007-10-10 | 2008-03-12 | 中兴通讯股份有限公司 | Quick-speed application EMS memory method |
| CN101504617A (en) * | 2009-03-23 | 2009-08-12 | 华为技术有限公司 | Data transmitting and receiving method and device based on processor sharing internal memory |
Non-Patent Citations (1)
| Title |
|---|
| 樊龙龙加油: "Zigbee协议栈OSAL层API函数", 《HTTP://WENKU.BAIDU.COM/VIEW/C6A037F19E314332396893DD.HTML?RE=VIEW》 * |
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103473031A (en) * | 2013-01-18 | 2013-12-25 | 龙建 | Cooperative concurrent message bus, driving member assembly model and member disassembly method |
| WO2014110702A1 (en) * | 2013-01-18 | 2014-07-24 | Long Jian | Cooperative concurrent message bus, driving member assembly model and member disassembly method |
| CN103473031B (en) * | 2013-01-18 | 2015-11-18 | 龙建 | Collaborative concurrent type frog messaging bus, driving member composition model and component method for splitting |
| CN103176837B (en) * | 2013-03-27 | 2016-06-08 | 南京大学 | Lock irrelevant messages queue implementing method based on reversion single linked list |
| CN103176837A (en) * | 2013-03-27 | 2013-06-26 | 南京大学 | Lock-free message queue implementation method based on reversal single linked list |
| CN103761141A (en) * | 2013-12-13 | 2014-04-30 | 北京奇虎科技有限公司 | Method and device for realizing message queue |
| CN104598208A (en) * | 2015-02-11 | 2015-05-06 | 四川天邑康和通信股份有限公司 | Singlechip operating system implementation method based on message queue |
| CN104598208B (en) * | 2015-02-11 | 2016-01-27 | 四川天邑康和通信股份有限公司 | A kind of operating system of single-chip microcomputer implementation method of Effect-based operation queue |
| CN105511967A (en) * | 2015-12-28 | 2016-04-20 | 曙光云计算技术有限公司 | Resource object management method and device for cloud platform |
| CN106681847A (en) * | 2016-12-30 | 2017-05-17 | 深圳Tcl数字技术有限公司 | Message processing method and device based on Android system |
| CN106681847B (en) * | 2016-12-30 | 2020-08-11 | 深圳Tcl数字技术有限公司 | Message processing method and device based on Android system |
| CN108595282A (en) * | 2018-05-02 | 2018-09-28 | 广州市巨硅信息科技有限公司 | A kind of implementation method of high concurrent message queue |
| CN109120486A (en) * | 2018-08-28 | 2019-01-01 | 珠海格力电器股份有限公司 | WiFi module data transmission method, Transmission system, intelligent appliance data transmission system |
| CN109710542A (en) * | 2018-12-28 | 2019-05-03 | 北京像素软件科技股份有限公司 | A kind of completely N-ary tree construction method and device |
| CN109710542B (en) * | 2018-12-28 | 2021-03-16 | 北京像素软件科技股份有限公司 | Full N-way tree construction method and device |
| CN110245006A (en) * | 2019-05-07 | 2019-09-17 | 深圳壹账通智能科技有限公司 | Processing method, device, equipment and the storage medium of block chain affairs |
| CN110245006B (en) * | 2019-05-07 | 2023-05-02 | 深圳壹账通智能科技有限公司 | Method, device, equipment and storage medium for processing block chain transaction |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102880507A (en) | Method for applying and distributing chain structure message | |
| US7549151B2 (en) | Fast and memory protected asynchronous message scheme in a multi-process and multi-thread environment | |
| KR102011949B1 (en) | System and method for providing and managing message queues for multinode applications in a middleware machine environment | |
| US8443377B2 (en) | Parallel processing system running an OS for single processors and method thereof | |
| KR101951072B1 (en) | Inter-core communication apparatus and method | |
| US10884786B2 (en) | Switch device, switching method, and computer program product | |
| EP2552081A2 (en) | Interrupt management | |
| US20190102223A1 (en) | System, Apparatus And Method For Real-Time Activated Scheduling In A Queue Management Device | |
| CN1327349C (en) | Task level resource administration method for micro-kernel embedded real-time operation systems | |
| CN103218329A (en) | Digital signal processing data transfer | |
| CN110825690B (en) | Inter-core communication method and device of multi-core processor | |
| US20040015979A1 (en) | System and method for efficiently exchanging data among processes | |
| CN101963922A (en) | Task processing method and device | |
| CN101470636B (en) | Message read-write method and apparatus | |
| US6907606B1 (en) | Method for implementing event transfer system of real time operating system | |
| WO2013086702A1 (en) | Buffer resource management method and telecommunication equipment | |
| CN101189579B (en) | Method and device for using semaphores for multi-threaded processing | |
| JP2021082868A (en) | Communication device, communication method, and program | |
| EP2899644A1 (en) | Device and method for inter-core communication in multi-core processor | |
| Golchin et al. | Tuned pipes: end-to-end throughput and delay guarantees for USB devices | |
| JP7309579B2 (en) | Communication device, communication method and program | |
| JPH076043A (en) | Multithread server | |
| CN113767368A (en) | Resource acquisition method, related device and computer storage medium | |
| WO2012171398A1 (en) | Shared resource accessing method in real-time processing system, and real-time processing system | |
| CN106126452B (en) | The method that (SuSE) Linux OS based on IIC agreement is communicated with bare machine |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20130116 |
|
| RJ01 | Rejection of invention patent application after publication |