CN108768884A - A kind of wireless communication data processing method based on buffer circle - Google Patents

A kind of wireless communication data processing method based on buffer circle Download PDF

Info

Publication number
CN108768884A
CN108768884A CN201810389701.7A CN201810389701A CN108768884A CN 108768884 A CN108768884 A CN 108768884A CN 201810389701 A CN201810389701 A CN 201810389701A CN 108768884 A CN108768884 A CN 108768884A
Authority
CN
China
Prior art keywords
pointer
buffering area
data
write
buffer circle
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
Application number
CN201810389701.7A
Other languages
Chinese (zh)
Inventor
孙瑞玮
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
JIANGSU ZHONGKE CORES ELECTRONIC TECHNOLOGY CO LTD
Original Assignee
JIANGSU ZHONGKE CORES ELECTRONIC TECHNOLOGY CO LTD
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by JIANGSU ZHONGKE CORES ELECTRONIC TECHNOLOGY CO LTD filed Critical JIANGSU ZHONGKE CORES ELECTRONIC TECHNOLOGY CO LTD
Priority to CN201810389701.7A priority Critical patent/CN108768884A/en
Publication of CN108768884A publication Critical patent/CN108768884A/en
Pending legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/50Queue scheduling
    • H04L47/62Queue scheduling characterised by scheduling criteria
    • H04L47/622Queue service order
    • H04L47/6225Fixed service order, e.g. Round Robin
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02Addressing or allocation; Relocation
    • G06F12/08Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/0802Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
    • G06F12/0893Caches characterised by their organisation or structure
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/50Queue scheduling
    • H04L47/62Queue scheduling characterised by scheduling criteria
    • H04L47/6245Modifications to standard FIFO or LIFO
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/90Buffering arrangements
    • H04L49/901Buffering arrangements using storage descriptor, e.g. read or write pointers
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/90Buffering arrangements
    • H04L49/9031Wraparound memory, e.g. overrun or underrun detection
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/10Flow control between communication endpoints
    • H04W28/14Flow control between communication endpoints using intermediate storage
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W88/00Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
    • H04W88/08Access point devices

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The wireless communication data processing method based on buffer circle that the invention discloses a kind of, includes the following steps:(1)Initialize installation;(2)Write data;(3)Read data.Through the above way, the present invention is based on the wireless communication data processing methods of buffer circle to pass through to carrying out length limitation before data write-in, and it is data cached in receiving terminal, in addition the small base station of wireless communication system is considered, write-in for multithreading and multi-process or reading module, between writing module and reading intermodule carries out critical zone processing, processing speed and safety to data provide certain ensure, coordination and the consistency treatment of data are carried out for reading in and reading module, also save memory headroom simultaneously, there are extensive market prospects in popularizing for the wireless communication data processing method based on buffer circle.

Description

A kind of wireless communication data processing method based on buffer circle
Technical field
The present invention relates to the communications fields, more particularly to a kind of wireless communication data processing side based on buffer circle Method.
Background technology
In a wireless communication system, sending and receiving for mass data is treated as difficult point, if directly invoking memory Distribution and release, Memory Allocation frequent so not only increase overhead, more so that memory fragmentation is on the increase, very not It is run steadily in the long term conducive to our server.Perhaps we can use memory pool, but for this according to stringent elder generation Into sequential processes are first gone out, block size is not small, and block size is also and for skimble-scamble Memory Allocation situation, more Use a kind of scheme being called buffer circle.
Buffer circle is a good technology, does not have to frequent storage allocation, and in most cases, memory Reusability but also we can do more things with less memory block.When two intermodules of program are communicated It waits, buffering area becomes the mechanism being commonly used.The characteristics of circle queue is need not to carry out dynamic memory release and divide Match, uses the memory headroom Reusability of fixed size.
Usually there are one read pointer and a write pointers for buffer circle.Read pointer is directed toward number readable in buffer circle According to write pointer is directed toward buffering area writeable in buffer circle.Buffering area can be realized by mobile read pointer and write pointer Digital independent and write-in.In general, the reading user of buffer circle can only influence read pointer, and write user only It can influence write pointer.If only there are one reading users and one to write user, then need not add mutual exclusion protection mechanism can To ensure the correctness of data.If there is multiple read-write users access buffer circle, then mutual exclusion protection mechanism must be added To ensure multiple user's exclusive reference buffer circles.
In buffer circle adds and reads the dynamic process of data, if without departing from loop buffer space buffer, Simultaneously also without " the bothering " of other processes, then data or Safe Cache.When read pointer and equal write pointer, show Buffering area is empty, as long as and write pointer behind read pointer when, show that buffering area has been expired.It is 8 to buffer buffer, but be written Speed, which is more than the speed read, gradually to exceed the range of buffering area, so protection mechanism is added, although present annular is slow Punching has following status inquiry mechanism:
(1)For push(Data are written)Operation, waiting list has had space before needing to operate, that is to say, that queue does not have There is full state.Until this state occurs, just continue the operation of push, otherwise, push operations are hung up,
(2)For get(Read data)Operation, waiting list has data before needing to operate, that is to say, that queue is not sky State.Until this state occurs, just continue the operation of get, otherwise, get operations are hung up.
But for LTE microcomputer platforms, unpredictable system data errors are there is also, so being written in data Length restriction is carried out to data before, the excessive data in buffer area meeting temporal cache is interrupted except restriction, is equivalent to and adds Level cache is entered, to control writing speed, avoiding too fast data from being written causes data jamming the unstable of system occur.
It is exactly " the bothering " of process or interruption for the alternatively possible problem, because for real time operating system, In order to ensure real-time, may there are other processes or interruption to interrupt data transmission at any time, that is, data may be in buffering area It is destroyed when being handled, it is logical using microcomputer station at this time it is necessary to carry out critical protection for our data buffer zone Letter system related mechanism realizes critical protection.
Invention content
The invention mainly solves the technical problem of providing a kind of wireless communication data processing side based on buffer circle Method, by carrying out length limitation before to data write-in, and it is data cached in receiving terminal, in addition consider that wireless communication system is small Base station, the write-in for multithreading and multi-process or reading module, between writing module and reading intermodule carries out critical zone Processing, processing speed to data and safety provide it is certain ensure, for read in and read module carry out data coordination and Consistency treatment, while memory headroom is also saved, in the universal of the wireless communication data processing method based on buffer circle On have extensive market prospects.
In order to solve the above technical problems, the present invention provides a kind of wireless communication data processing side based on buffer circle Method includes the following steps:
(1)Initialize installation:
Read pointer P_R, write pointer P_W, system semaphore pointer Buf_sem, buffering area count pick up value flag are set, and system exists Apply for one section of memory headroom when initialization first, write pointer P_W and read pointer P_R are directed toward to the ground of memory BOB(beginning of block) respectively It is initialized as 0 at location, by system semaphore pointer Buf_sem, buffering area count pick up value flag is initialized as 0;
(2)Write data:
When data are written to buffer circle, the size of buffering area count pick up value flag and buffering area is first determined whether,
If buffering area count pick up value flag is more than buffering area, which, which will be blocked, waits until that buffering area has It can be just waken up when space,
If buffering area count pick up value flag is less than buffering area, system temporarily enters critical zone and carries out critical protection to system, Anti- locking system generates interruption, the buffer data of this task is destroyed to avoid other tasks, then by buffering area count pick up Value flag+1, the value that will be written are put at the address that write pointer P_W is directed toward, then by write pointer P_W+1, judge whether to be equal to The end of buffering, if it is then write pointer P_W is directed toward at the first address of buffering area, by system semaphore pointer Buf_sem + 1, it exits critical zone write operation and finishes;
(3)Read data:
When reading data to buffer circle, first determine whether the value of system semaphore pointer Buf_sem can use, if being The value of system semaphore pointer Buf_sem is less than 0, then this task enters blocked state, is just continued to execute when having semaphore, If the value of system semaphore pointer Buf_sem is more than 0, system enters critical zone and carries out critical protection to system, then Read pointer P_R is directed toward the value at address and taken out, make read pointer P_R+1, then judges to read to refer to by buffering area count pick up value flag-1 Whether needle P_R has been directed to the end of buffer circle, if it is, read pointer P_R is directed toward to the beginning of buffer circle, with The read operation of buffer circle can be realized in upper end of operation backed off after random critical zone, the value for returning to taking-up.
Circular buffer is gone to since program initialization, until data reading terminates meeting logarithm before entering caching Critical section protection is carried out according to processing procedure, the position that can temporarily retain outside access address is accessed when there is process in outside or interrupts, Pending data processing terminates that external progress or interrupt unit program can be executed.
The beneficial effects of the invention are as follows:The present invention is based on the wireless communication data processing methods of buffer circle to pass through logarithm Length limitation is carried out before according to write-in, and data cached in receiving terminal, the small base station of wireless communication system is in addition considered, for more The write-in or reading module of thread and multi-process between writing module and read intermodule progress critical zone processing, to data Processing speed and safety provide it is certain ensure, coordination and the consistency treatment of data are carried out for reading in and reading module, Memory headroom is also saved simultaneously, is had widely in popularizing for the wireless communication data processing method based on buffer circle Market prospects.
Description of the drawings
To describe the technical solutions in the embodiments of the present invention more clearly, make required in being described below to embodiment Attached drawing is briefly described, it should be apparent that, drawings in the following description are only some embodiments of the invention, for For those of ordinary skill in the art, without creative efforts, it can also be obtained according to these attached drawings other Attached drawing, wherein:
Fig. 1 is the flow signal of one preferred embodiment of wireless communication data processing method based on buffer circle of the present invention Figure.
Specific implementation mode
The technical scheme in the embodiments of the invention will be clearly and completely described below, it is clear that described implementation Example is only a part of the embodiment of the present invention, instead of all the embodiments.Based on the embodiments of the present invention, this field is common All other embodiment that technical staff is obtained without making creative work belongs to the model that the present invention protects It encloses.
Referring to Fig. 1, the embodiment of the present invention includes:
A kind of wireless communication data processing method based on buffer circle, includes the following steps:
(1)Initialize installation:
Read pointer P_R, write pointer P_W, system semaphore pointer Buf_sem, buffering area count pick up value flag are set, and system exists Apply for one section of memory headroom when initialization first, write pointer P_W and read pointer P_R are directed toward to the ground of memory BOB(beginning of block) respectively It is initialized as 0 at location, by system semaphore pointer Buf_sem, buffering area count pick up value flag is initialized as 0;
(2)Write data:
When data are written to buffer circle, the size of buffering area count pick up value flag and buffering area is first determined whether,
If buffering area count pick up value flag is more than buffering area, which, which will be blocked, waits until that buffering area has It can be just waken up when space,
If buffering area count pick up value flag is less than buffering area, system temporarily enters critical zone and carries out critical protection to system, Anti- locking system generates interruption, the buffer data of this task is destroyed to avoid other tasks, then by buffering area count pick up Value flag+1, the value that will be written are put at the address that write pointer P_W is directed toward, then by write pointer P_W+1, judge whether to be equal to The end of buffering, if it is then write pointer P_W is directed toward at the first address of buffering area, by system semaphore pointer Buf_sem + 1, exit critical zone write operation and finish, the operation in this critical zone take have to it is very short because shielding in system at this time It is disconnected, can not multitask running again, reduce the efficiency of system, this is very fearful in the very high operating system of requirement of real-time 's;
(3)Read data:
When reading data to buffer circle, first determine whether the value of system semaphore pointer Buf_sem can use, if being The value of system semaphore pointer Buf_sem is less than 0, then this task enters blocked state, is just continued to execute when having semaphore, If the value of system semaphore pointer Buf_sem is more than 0, system immediately enters critical zone and carries out critical protection to system, Read pointer P_R is directed toward the value at address and taken out, makes read pointer P_R+1, then judge by then buffering area count pick up value flag-1 Whether read pointer P_R has been directed to the end of buffer circle, if it is, read pointer P_R is directed toward opening for buffer circle Head exits critical zone after the above end of operation at once, and the read operation of buffer circle can be realized in the value for returning to taking-up.
Advantageous effect the present invention is based on the wireless communication data processing method of buffer circle is:
By carrying out length limitation before to data write-in, and it is data cached in receiving terminal, in addition consider wireless communication system Small base station, the write-in for multithreading and multi-process or reading module, between writing module and reading intermodule progress is critical Area is handled, and the processing speed and safety to data provide certain guarantee, and the coordination of data is carried out for reading in and reading module And consistency treatment, while also saving memory headroom.
Example the above is only the implementation of the present invention is not intended to limit the scope of the invention, every to utilize this hair Equivalent structure or equivalent flow shift made by bright description is applied directly or indirectly in other relevant technology necks Domain is included within the scope of the present invention.

Claims (1)

1. a kind of wireless communication data processing method based on buffer circle, which is characterized in that include the following steps:
(1)Initialize installation:
Read pointer P_R, write pointer P_W, system semaphore pointer Buf_sem, buffering area count pick up value flag are set, and system exists Apply for one section of memory headroom when initialization first, write pointer P_W and read pointer P_R are directed toward to the ground of memory BOB(beginning of block) respectively It is initialized as 0 at location, by system semaphore pointer Buf_sem, buffering area count pick up value flag is initialized as 0;
(2)Write data:
When data are written to buffer circle, the size of buffering area count pick up value flag and buffering area is first determined whether,
If buffering area count pick up value flag is more than buffering area, which, which will be blocked, waits until that buffering area has It can be just waken up when space,
If buffering area count pick up value flag is less than buffering area, system temporarily enters critical zone and carries out critical protection to system, Anti- locking system generates interruption, the buffer data of this task is destroyed to avoid other tasks, then by buffering area count pick up Value flag+1, the value that will be written are put at the address that write pointer P_W is directed toward, then by write pointer P_W+1, judge whether to be equal to The end of buffering, if it is then write pointer P_W is directed toward at the first address of buffering area, by system semaphore pointer Buf_sem + 1, it exits critical zone write operation and finishes;
(3)Read data:
When reading data to buffer circle, first determine whether the value of system semaphore pointer Buf_sem can use, if being The value of system semaphore pointer Buf_sem is less than 0, then this task enters blocked state, is just continued to execute when having semaphore, If the value of system semaphore pointer Buf_sem is more than 0, system enters critical zone and carries out critical protection to system, then Read pointer P_R is directed toward the value at address and taken out, make read pointer P_R+1, then judges to read to refer to by buffering area count pick up value flag-1 Whether needle P_R has been directed to the end of buffer circle, if it is, read pointer P_R is directed toward to the beginning of buffer circle, with The read operation of buffer circle can be realized in upper end of operation backed off after random critical zone, the value for returning to taking-up.
CN201810389701.7A 2018-04-27 2018-04-27 A kind of wireless communication data processing method based on buffer circle Pending CN108768884A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810389701.7A CN108768884A (en) 2018-04-27 2018-04-27 A kind of wireless communication data processing method based on buffer circle

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810389701.7A CN108768884A (en) 2018-04-27 2018-04-27 A kind of wireless communication data processing method based on buffer circle

Publications (1)

Publication Number Publication Date
CN108768884A true CN108768884A (en) 2018-11-06

Family

ID=64012100

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810389701.7A Pending CN108768884A (en) 2018-04-27 2018-04-27 A kind of wireless communication data processing method based on buffer circle

Country Status (1)

Country Link
CN (1) CN108768884A (en)

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109710313A (en) * 2018-12-19 2019-05-03 珠海格力电器股份有限公司 Communication instruction processing method and system
CN111008164A (en) * 2019-12-04 2020-04-14 天津七一二通信广播股份有限公司 Inter-node multi-cache type communication method based on storage mapping type bus
CN111538607A (en) * 2020-06-22 2020-08-14 北京翼辉信息技术有限公司 Message communication method and device based on boundary protection
CN111767154A (en) * 2020-06-19 2020-10-13 北京思特奇信息技术股份有限公司 Lock-free circular queue implementation method for non-blocking communication
CN111865824A (en) * 2020-06-19 2020-10-30 重庆川仪自动化股份有限公司 Method and system for designing double-pointer annular buffer area in serial port communication
CN111966498A (en) * 2020-08-27 2020-11-20 南京电研电力自动化股份有限公司 Power distribution room Internet of things gateway data rapid processing method and system and storage medium
CN112235206A (en) * 2019-12-20 2021-01-15 青岛鼎信通讯股份有限公司 Annular buffer queue data receiving mechanism based on single chip microcomputer
CN112235204A (en) * 2020-10-13 2021-01-15 中移(杭州)信息技术有限公司 Data reporting method, system, electronic equipment and storage medium
CN112732429A (en) * 2021-01-18 2021-04-30 国汽智控(北京)科技有限公司 Task scheduling method, device, equipment and storage medium
CN112882831A (en) * 2021-02-04 2021-06-01 浙江大华技术股份有限公司 Data processing method and device
CN114168365A (en) * 2021-12-07 2022-03-11 中国船舶重工集团公司第七0七研究所 Real-time data recording method based on stm32f450 processor
CN116126500A (en) * 2023-02-13 2023-05-16 安徽理工大学 Method for optimizing dispatching efficiency of massive remote sensing images

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1472663A (en) * 2002-07-30 2004-02-04 深圳市中兴通讯股份有限公司上海第二 Method for delivering shared critical region data
CN1540523A (en) * 2003-10-30 2004-10-27 中兴通讯股份有限公司 Quick method for reading/writing buffer in single task
US20100293553A1 (en) * 2005-08-30 2010-11-18 Alexey Kukanov Fair scalable reader-writer mutual exclusion
CN102591815A (en) * 2011-12-27 2012-07-18 Tcl集团股份有限公司 Method and device for using annular data buffer to read and write batch data
CN102999378A (en) * 2012-12-03 2013-03-27 中国科学院软件研究所 Read-write lock implement method

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1472663A (en) * 2002-07-30 2004-02-04 深圳市中兴通讯股份有限公司上海第二 Method for delivering shared critical region data
CN1540523A (en) * 2003-10-30 2004-10-27 中兴通讯股份有限公司 Quick method for reading/writing buffer in single task
US20100293553A1 (en) * 2005-08-30 2010-11-18 Alexey Kukanov Fair scalable reader-writer mutual exclusion
CN102591815A (en) * 2011-12-27 2012-07-18 Tcl集团股份有限公司 Method and device for using annular data buffer to read and write batch data
CN102999378A (en) * 2012-12-03 2013-03-27 中国科学院软件研究所 Read-write lock implement method

Cited By (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109710313A (en) * 2018-12-19 2019-05-03 珠海格力电器股份有限公司 Communication instruction processing method and system
CN111008164A (en) * 2019-12-04 2020-04-14 天津七一二通信广播股份有限公司 Inter-node multi-cache type communication method based on storage mapping type bus
CN112235206A (en) * 2019-12-20 2021-01-15 青岛鼎信通讯股份有限公司 Annular buffer queue data receiving mechanism based on single chip microcomputer
CN111767154A (en) * 2020-06-19 2020-10-13 北京思特奇信息技术股份有限公司 Lock-free circular queue implementation method for non-blocking communication
CN111865824A (en) * 2020-06-19 2020-10-30 重庆川仪自动化股份有限公司 Method and system for designing double-pointer annular buffer area in serial port communication
CN111538607A (en) * 2020-06-22 2020-08-14 北京翼辉信息技术有限公司 Message communication method and device based on boundary protection
CN111966498A (en) * 2020-08-27 2020-11-20 南京电研电力自动化股份有限公司 Power distribution room Internet of things gateway data rapid processing method and system and storage medium
CN111966498B (en) * 2020-08-27 2023-08-25 南京电研电力自动化股份有限公司 Rapid processing method, system and storage medium for gateway data of Internet of things in power distribution room
CN112235204A (en) * 2020-10-13 2021-01-15 中移(杭州)信息技术有限公司 Data reporting method, system, electronic equipment and storage medium
CN112732429A (en) * 2021-01-18 2021-04-30 国汽智控(北京)科技有限公司 Task scheduling method, device, equipment and storage medium
CN112882831A (en) * 2021-02-04 2021-06-01 浙江大华技术股份有限公司 Data processing method and device
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
CN116126500A (en) * 2023-02-13 2023-05-16 安徽理工大学 Method for optimizing dispatching efficiency of massive remote sensing images
CN116126500B (en) * 2023-02-13 2024-03-29 安徽理工大学 Method for optimizing dispatching efficiency of massive remote sensing images

Similar Documents

Publication Publication Date Title
CN108768884A (en) A kind of wireless communication data processing method based on buffer circle
US7844760B2 (en) Schedule and data caching for wireless transmission
US9003082B2 (en) Information processing apparatus, arithmetic device, and information transferring method
US8739164B2 (en) Automatic suspend atomic hardware transactional memory in response to detecting an implicit suspend condition and resume thereof
US7647416B2 (en) Full hardware based TCP/IP traffic offload engine(TOE) device and the method thereof
JP2011216118A (en) Data processing apparatus and method for executing data processing instruction
US20140129784A1 (en) Methods and systems for polling memory outside a processor thread
US20080201615A1 (en) Apparatus and computer program product for implementing atomic data tracing
US6944736B2 (en) Managing latencies in accessing memory of computer systems
US11507524B2 (en) RTOS/OS architecture for context switching that solves the diminishing bandwidth problem and the RTOS response time problem using unsorted ready lists
CN112559436B (en) Context access method and system of RDMA communication equipment
EP3598310B1 (en) Network interface device and host processing device
CN111209123A (en) Local storage IO protocol stack data interaction method and device
CN112559210B (en) Shared resource read-write mutual exclusion method based on RTX real-time system
CN109062857B (en) Novel message controller capable of realizing communication among multiple processors at high speed and communication method thereof
CN110858164B (en) Inter-process communication method, device and computer readable medium
US20030005252A1 (en) Managing latencies in accessing memory of computer systems
CN103559079A (en) Shared memory based data access method and device
WO2007135532A2 (en) Method and system for managing buffers pool
CN110990169B (en) Structure and method for inter-process byte stream communication by using shared memory
CN102117261A (en) Communication method between inner processors of chip
CN111767154B (en) Method for realizing non-lock ring queue for non-blocking communication
US8799530B2 (en) Data processing system with a host bus adapter (HBA) running on a PCIe bus that manages the number enqueues or dequeues of data in order to reduce bottleneck
CN106598755B (en) Processor and DCC communication system
CN109542811B (en) Data communication processing method

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20181106