CN102130833A - Memory management method and system of traffic management chip chain tables of high-speed router - Google Patents
Memory management method and system of traffic management chip chain tables of high-speed router Download PDFInfo
- Publication number
- CN102130833A CN102130833A CN2011100594434A CN201110059443A CN102130833A CN 102130833 A CN102130833 A CN 102130833A CN 2011100594434 A CN2011100594434 A CN 2011100594434A CN 201110059443 A CN201110059443 A CN 201110059443A CN 102130833 A CN102130833 A CN 102130833A
- Authority
- CN
- China
- Prior art keywords
- message
- node
- linked list
- queue
- list
- 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
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a memory management method of traffic management chip chain tables of a high-speed router, comprising the following steps: establishing M queue chain tables for each message queue, and storing the M queue chain tables in a plugged quad data rate (QDR) cache, wherein M is more than or equal to N/K, M is an integer, N represents reading time delay of the QDR, and K represents the time that the traffic management chip is required to process one chain table node; when the messages are enqueued, storing chain table nodes of the messages in the M queue chain tables; and when the messages are dequeued, finding out corresponding chain table nodes from the M queue chain tables, and reading messages data in accordance with the chain table nodes. The method is used to realize the stream of reading operation for the chain table nodes, hide reading time delay, and improve the processing speed of the messages. The invention also discloses a memory management system of traffic management chip chain tables of a high-speed router, comprising a queue chain table establishment module, a message enqueuing management module and a message dequeuing management module.
Description
Technical field
The present invention relates to the memory management method of grouping converter in the data communication technology, relate in particular to a kind of high speed router traffic management chip storage of linked list management method and system.
Background technology
Along with network capacity constantly increases with professional,, generally special traffic management chip is set and finishes management high-speed data-flow in router interior for the high speed that realizes message is transmitted; In the traffic management chip, earlier scheduling behind the message data buffer memory is exported.For high-end router equipment, basic demand is the data message of buffer memory 200ms linear speed at least, under the 40Gbps environment, wants the 8Gbits buffer memory capacity at least.The plug-in buffer memory message data of traffic management chip meeting adopts chained list administrative message data at chip internal.The external memory space of the corresponding a slice fixed size of each chained list node, according to the number of chained list node, decision is stored in chip internal or outside with chained list node.
Chip need provide the 100MPPS packet switched capabilities, under the 250M system clock, needs chained list node of 2 period treatment at least.Because chained list node is many, need be stored in plug-in QDR (Quad DateRate, the 4 haplotype data multiplying powers) buffer memory, and there is read latency in QDR, the scope of read latency is 7-15 cycle, therefore can not accomplish chained list node of 2 period treatment.In the prior art, still there is not the mature technique scheme to address this problem at present.
Summary of the invention
The technical problem to be solved in the present invention is at problems of the prior art and defective, a kind of high speed router traffic management chip storage of linked list management method and system are provided, can realize read operation flowing water, hide read latency, improve message processing speed chained list node.
For this reason, the present invention has adopted following technical scheme:
A kind of high speed router traffic management chip storage of linked list management method comprises the steps:
For M queue linked list set up in each message queue, and described queue linked list is stored in the plug-in buffer memory; M is more than or equal to N/K, and M is integer, and wherein N is the time-delay of reading of described plug-in buffer memory, and k is the time that a chained list node is handled in the requirement of traffic management chip;
When message is joined the team, the chained list node of this message is left in described M the queue linked list of its correspondence;
When message goes out group, from M queue linked list of this message, find corresponding chained list node, and read corresponding message data according to this chained list node.
Further, described plug-in buffer memory refers to the QDR buffer memory.
Further, the value of M satisfies: if N/K is an integer, then M equals N/K, if N/K is not an integer, then M equals N/K+1.
Further, described when message is joined the team, the chained list node of this message is left in described M the queue linked list of its correspondence, specifically comprise:
When a message is joined the team, find described M queue linked list of its correspondence according to the queue number of message, and, judge what chained list nodes this message needs according to the length of message;
With the chained list node applied for adding in the described M queue linked list of poll successively, upgrade the tail node pointer value of a described M queue linked list successively.
Further, described when message goes out group, from M queue linked list of this message, find corresponding chained list node, and read corresponding message data according to this chained list node, specifically comprise:
When message goes out group, according to the queue number that goes out team, read the first node pointer numerical value of described M queue linked list of its correspondence successively, first node corresponding memory space data are read, obtain chained list node, and read corresponding message data according to chained list node;
Upgrade the first node pointer numerical value of every queue linked list after reading numerical value, and the node of this free time address correspondence is added to the afterbody of idle chained list.
A kind of high speed router traffic management chip storage of linked list management system comprises that queue linked list sets up join the team administration module and message of module, message and go out group administration module;
Wherein, described queue linked list is set up module and is used for, and for M queue linked list set up in each message queue, and described queue linked list is stored in the plug-in buffer memory; M is more than or equal to N/K, and M is integer, and wherein N is the time-delay of reading of described plug-in buffer memory, and k is the time that a chained list node is handled in the requirement of traffic management chip;
The described message administration module of joining the team is used for, and when message is joined the team, the chained list node of this message is left in described M the queue linked list of its correspondence;
Described message goes out group administration module and is used for, and when message goes out group, finds corresponding chained list node from M queue linked list of this message, and reads corresponding message data according to this chained list node.
Further, described plug-in buffer memory refers to the QDR buffer memory.
Further, the value of M satisfies: if N/K is an integer, then M equals N/K, if N/K is not an integer, then M equals N/K+1.
Beneficial effect of the present invention is:
The invention provides a kind of multilinked list structure management spatial cache, a plurality of chained lists can make read operation flowing water, hidden read latency, improved message processing speed, satisfy the requirement of high speed processing message data, thereby improved effective solution for the management of the storage of linked list of high speed router traffic management chip.The present invention is convenient to hardware and is realized, adapts to the high-speed high capacity cache management.It is simple that the present invention simultaneously also has realization, the advantage that is easy to promote the use of.
Description of drawings
Fig. 1 is a high speed router traffic management chip storage of linked list management principle schematic;
Fig. 2 is a high speed router traffic management chip storage of linked list management method schematic flow sheet of the present invention;
Fig. 3 is the corresponding one by one schematic diagram of memory space and idle chained list;
Fig. 4 is the basic descriptor information schematic diagram of queue linked list;
Fig. 5 is the formation schematic flow sheet of joining the team;
Fig. 6 is a queue linked list node connection diagram;
Fig. 7 is that a formation message goes out group schematic flow sheet;
Fig. 8 is that a formation goes out a chained list node link schematic diagram behind the packet;
Fig. 9 is that a formation goes out team and reads chained list node flowing water schematic diagram;
Figure 10 is a high speed router traffic management chip storage of linked list management system structural representation of the present invention.
Embodiment
Below in conjunction with the drawings and specific embodiments the present invention is described in further detail.
Fig. 1 is a high speed router traffic management chip storage of linked list management principle schematic, as shown in the figure, high speed router traffic management chip comprises queue linked list management subsystem, queue scheduling subsystem, chained list node storage subsystem and metadata cache management subsystem.When message was joined the team, queue linked list management subsystem was set up chained list and is given the storage of metadata cache management subsystem with message data for the message of joining the team, and chained list node is stored in the chained list node storage subsystem; When going out group, which formation message is the queue scheduling subsystem determine go out team, and the notification queue linked list management system, and the queue linked list management system is obtained out group message address information from this queue linked list node, give metadata cache management subsystem, read message data from metadata cache management subsystem.
The general chained list node that adopts the formation of QDR buffer memory, time-delay is read in the existence of QDR buffer memory, supposes that the time-delay of reading of QDR buffer memory is N, supposes that it is K that the traffic management chip requires the time of a chained list node of processing; Then the queue linked list number that message queue needs among the present invention be " N/K " (if can divide exactly is exactly this numerical value, if aliquant then this numerical value adds " 1 "), and certainly, the queue linked list number of message queue needs can also be for greater than " N/K ".Adopt the multilinked list structure, operation can be got up by flowing water between a plurality of chained list nodes of same message queue, reaches the effect that reduces the time-delay of QDR cache read, satisfies the chained list node processing time of traffic management chip regulation.Set forth below that message is joined the team and the interpolation and the delete procedure of chained list node when going out group.
Suppose that the queue linked list number that every formation needs is M.When each message is joined the team, find its corresponding M queue linked list, judge promptly which queue linked list this message should add to, and, judge what chained list nodes this message needs according to the length of message according to the queue number of message; With the chained list node applied for adding in this M queue linked list of poll successively, upgrade the tail node pointer value of queue linked list successively then; So just finished joining the team of a message, the chained list node of this message has been added in the corresponding queues chained list; The process of setting up of each queue linked list similarly repeats no more.
When message goes out group, according to the queue number that goes out team, read the first node pointer numerical value of this queue linked list successively, first node corresponding memory space data are read, upgrade the first node pointer numerical value of every queue linked list after reading numerical value, and add the node of this free time address correspondence the afterbody of idle chained list to, so that utilize next time.
Fig. 2 is a high speed router traffic management chip storage of linked list management method schematic flow sheet of the present invention, and as shown in the figure, high speed router traffic management chip storage of linked list management method of the present invention specifically comprises the steps:
1, set up M queue linked list for each message queue, and be stored in the plug-in buffer memory, the basic descriptor information of queue linked list is stored in the sheet of high speed router traffic management chip.In the present embodiment, plug-in buffer memory adopts the QDR buffer memory.
If N/K is an integer, then M is not less than N/K, if N/K is not an integer, then M is not less than N/K+1, that is: M is more than or equal to N/K, and M is an integer.Wherein N is the time-delay of reading of QDR buffer memory, and k is the time that a chained list node is handled in the requirement of traffic management chip.The value of M preferably satisfies: if N/K is an integer, then M equals N/K, if N/K is not an integer, then M equals N/K+1.
2, when message is joined the team, find described M queue linked list of its correspondence according to the queue number of message, and, judge what chained list nodes this message needs according to the length of message.
3, with the chained list node applied for adding in the described M queue linked list of poll successively, upgrade the tail node pointer value of a described M queue linked list successively.
4, when message goes out group, according to the queue number that goes out team, read the first node pointer numerical value of described M queue linked list of its correspondence successively, first node corresponding memory space data are read, obtain chained list node, and read corresponding message data according to chained list node.
5, read numerical value and upgrade the first node pointer numerical value of every queue linked list afterwards, and the node of this free time address correspondence is added to the afterbody of idle chained list.
Mode with specific embodiment is described further the present invention program below.
Among this embodiment, the present invention adopts 4 list structures, is 8 cycles because read the QDR buffer delay, node of the fastest per two period treatment, so each queue linked list uses 4 child lists just can realize read operation flowing water.
The initial idle chained list node of the memory space of metadata cache management subsystem and queue linked list management subsystem is one to one among Fig. 1, as shown in Figure 3, the figure illustrates, the memory space of metadata cache management subsystem is divided into the N piece, then in queue linked list management subsystem, initial idle chained list node also is divided into N, is to concern one to one between them.N is the natural number greater than 1.
The basic descriptor information of the queue linked list of each formation is stored in the sheet, as shown in Figure 4, it comprises that the head and the tail node of 4 queue linked lists, one 4 go out group activation flag, one 4 the activation flag of joining the team, 41 the empty flag bit of queue linked list and 1 queue empty indicate.Have only 41 empty the sign when all being " 1 " of queue linked list, this formation is empty.When joining the team, according to message queue number, select 4 corresponding queue linked lists, read the activation flag of joining the team of this formation and judge which queue linked list the message chained list node should add in, when this chained list node is the tail node of this message, the bag tail tag will of this chained list node is set to " 1 ", otherwise is " 0 ".When going out group, read the basic descriptor information of chained list according to the queue number that goes out team, obtain the first node pointer numerical value of which queue linked list according to group activation flag judgement that goes out of reading, this first node pointer numerical value corresponding memory space message data is read, until the tail node message data of this message is read, just might more the swap out queue number of team reads the message data of another formation; When the head and the tail node of queue linked list equates, this queue linked list is labeled as sky, when all 4 queue linked lists all were empty, 4 queue linked list overall labelings of this formation were empty.Demonstrating message below joins the team and goes out group process.
Message is joined the team flow process as shown in Figure 5, after the idle chained list node of message application, begin to add, judge whether this queue linked list is empty from first packet node, if be empty just with this idle chain table address as the queue linked list owner pointer, judge then whether this node is the bag tail, if the bag tail then finishes to join the team, otherwise continue to add next node, upgrade the queue linked list tail pointer, judge whether this bag is the bag tail, and the like add in the chained list end fully to up to the node of this bag and join the team; When if first packet node adds, this formation non-NULL then adds to this node in the formation and upgrades the queue linked list tail pointer, judges that whether this bag is the bag tail, if the bag tail then finishes this time to join the team, adds end otherwise continue to add until this message node.The message node number of supposing the N-5 formation is 20, and the order that this 20 message node is joined the team is followed successively by 0 to 19, supposes when formation N-5 is initial to be empty queue.First node application of this formation to the idle node address be 0, this moment this formation the activity of joining the team chained list be masked as " 0001 ", then this address " 0 " is stored into the owner pointer of queue linked list 1; The idle node address that second node application arrived is " 1 "; The activity of the joining the team chained list of this formation this moment is masked as " 0010 ", then this address " 1 " is stored into the owner pointer of queue linked list 2; And the like, these 20 nodes to be added in 4 queue linked lists of N-5 formation, the on-link mode (OLM) of 4 queue linked list reality of final n-5 formation is as shown in Figure 6.Stored the next node address pointer numerical value that this node points in each chained list node, when going out group, seek out the next node address and then must obtain by reading a last node content.The node of 4 queue linked list links of N-5 formation correspondence is respectively: the node of queue linked list 1 link is 0,4,8,12 and 16, and the head and the tail node of this queue linked list is stored the 0th and the 12nd node data pointer respectively; The node of queue linked list 2 links is 1,5,9,13 and 17, and the head and the tail node of this queue linked list is stored the 1st and the 13rd node data pointer respectively; The node of queue linked list 3 links is 2,6,10,14 and 18, and the head and the tail node of this queue linked list is stored the 2nd and the 14th node data pointer respectively; The node of queue linked list 4 links is 3,7,11,15 and 19, and the head and the tail node of this queue linked list is stored the 3rd and the 15th node data pointer respectively.
The flow process that message goes out team satisfies the formation that group condition and provides out team's request as shown in Figure 7, searches the head and the tail pointer of queue linked list according to going out group queue number, judges which queue linked list to begin to obtain the chained list node data from according to going out group activation flag; Read after the chained list node data, judge the whether bag tail of this message of this node, if, finish this and go out team, wait for that the request of next formation goes out team once more; Otherwise, obtain the chained list node data from another queue linked list according to going out group activation flag judgement.If going out the queue number of team is N-5, and the chained list of N-5 formation this moment as shown in Figure 6.Find the head and the tail pointer of this queue linked list according to queue number N-5, go out group activation flag this moment and be " 0001 ", then from the first node reading of data of queue linked list 1, first node address " 0 " and message length are sent to metadata cache management subsystem, the message in this node corresponding stored space is read; It is data cached for the QDR of " 0 " to read the address, data such as the address pointer " 4 " read and bag tail tag will are write the first node of queue linked list 1, add the address afterbody of idle chained list to for the node of " 0 " simultaneously, wait for reusing this free buffer space when joining the team.Judge according to the first node bag tail tag will before upgrading whether preceding first node is the bag tail, if then finish this time to go out team; If not, then go out group activation flag for " 0010 ", obtain the first node data of queue linked list 2, finish message and go out team, it to go out group process the same with queue linked list 1 first node processing process, go out team fully up to a message.Need 5 chained list node spaces if N-5 formation this time goes out the message of team, then this message go out the N-5 formation after the team fully chained list as shown in Figure 8.
When going out group, handle chained list node data 2 cycles of the fastest needs, the head and the tail pointer data of queue linked list is stored in the sheet, in the QDR buffer memory of node pointer storage outside sheet, there is read latency in the QDR buffer memory, the single linked list structure does not satisfy chained list node data of 2 period treatment, therefore adopts multilinked list structure head it off.The read latency of QDR buffer memory is 8 cycles, and 4 list structures can satisfy the sequential requirement of flowing water, 4 chained list stream treatment processes when Fig. 9 has shown group.
Figure 10 is a high speed router traffic management chip storage of linked list management system structural representation of the present invention, as shown in the figure, high speed router traffic management chip storage of linked list management system of the present invention comprises that queue linked list sets up join the team administration module and message of module, message and go out group administration module.
Wherein, queue linked list is set up module and is used to each message queue to set up M queue linked list, and is stored in the plug-in buffer memory, in the present embodiment, plug-in buffer memory is the QDR buffer memory, and the basic descriptor information of queue linked list is stored in the sheet of high speed router traffic management chip.If N/K is an integer, then M is not less than N/K, if N/K is not an integer, then M is not less than N/K+1, and wherein N is the time-delay of reading of QDR buffer memory, and k is the time that a chained list node is handled in the requirement of traffic management chip.The value of M preferably satisfies: if N/K is an integer, then M equals N/K, if N/K is not an integer, then M equals N/K+1.
The message administration module of joining the team is used for, and when message is joined the team, the chained list node of this message is left in its corresponding M queue linked list.
Message goes out group administration module and is used for, and when message goes out group, finds corresponding chained list node from M queue linked list of this message, and reads corresponding message data according to this chained list node.
The specific embodiments of high speed router traffic management chip storage of linked list management system can be referring to top to the specifying of high speed router traffic management chip storage of linked list management method, and they are consistent, repeat no more herein.
Above-described specific embodiment, purpose of the present invention, technical scheme and beneficial effect are further described, institute it should be noted, the above only is specific embodiments of the invention, and those skilled in the art can carry out various changes and modification to the present invention and not break away from the spirit and scope of the present invention.Like this, if of the present invention these are revised and modification belongs within the scope of the technical scheme of claim record of the present invention and equivalent technologies thereof, then the present invention also is intended to comprise these changes and modification interior.
Claims (8)
1. a high speed router traffic management chip storage of linked list management method is characterized in that, comprises the steps:
For M queue linked list set up in each message queue, and described queue linked list is stored in the plug-in buffer memory; M is more than or equal to N/K, and M is integer, and wherein N is the time-delay of reading of described plug-in buffer memory, and k is the time that a chained list node is handled in the requirement of traffic management chip;
When message is joined the team, the chained list node of this message is left in described M the queue linked list of its correspondence;
When message goes out group, from M queue linked list of this message, find corresponding chained list node, and read corresponding message data according to this chained list node.
2. high speed router traffic management chip storage of linked list management method according to claim 1 is characterized in that described plug-in buffer memory refers to 4 haplotype data multiplying power buffer memorys.
3. high speed router traffic management chip storage of linked list management method according to claim 1 is characterized in that, the value of M satisfies:
If N/K is an integer, then M equals N/K, if N/K is not an integer, then M equals N/K+1.
4. according to claim 1 or 2 or 3 described high speed router traffic management chip storage of linked list management methods, it is characterized in that, described when message is joined the team, the chained list node of this message is left in described M the queue linked list of its correspondence, comprising:
When a message is joined the team, find described M queue linked list of its correspondence according to the queue number of message, and, judge what chained list nodes this message needs according to the length of message;
With the chained list node applied for adding in the described M queue linked list of poll successively, upgrade the tail node pointer value of a described M queue linked list successively.
5. according to claim 1 or 2 or 3 described high speed router traffic management chip storage of linked list management methods, it is characterized in that, described when message goes out group, from M queue linked list of this message, find corresponding chained list node, and read corresponding message data according to this chained list node, comprising:
When message goes out group, according to the queue number that goes out team, read the first node pointer numerical value of described M queue linked list of its correspondence successively, first node corresponding memory space data are read, obtain chained list node, and read corresponding message data according to chained list node;
Upgrade the first node pointer numerical value of every queue linked list after reading numerical value, and the node of this free time address correspondence is added to the afterbody of idle chained list.
6. a high speed router traffic management chip storage of linked list management system is characterized in that, comprises that queue linked list sets up join the team administration module and message of module, message and go out group administration module;
Wherein, described queue linked list is set up module and is used for, and for M queue linked list set up in each message queue, and described queue linked list is stored in the plug-in buffer memory; M is more than or equal to N/K, and M is integer, and wherein N is the time-delay of reading of described plug-in buffer memory, and k is the time that a chained list node is handled in the requirement of traffic management chip;
The described message administration module of joining the team is used for, and when message is joined the team, the chained list node of this message is left in described M the queue linked list of its correspondence;
Described message goes out group administration module and is used for, and when message goes out group, finds corresponding chained list node from M queue linked list of this message, and reads corresponding message data according to this chained list node.
7. high speed router traffic management chip storage of linked list management system according to claim 6 is characterized in that described plug-in buffer memory refers to 4 haplotype data multiplying power buffer memorys.
8. according to claim 6 or 7 described high speed router traffic management chip storage of linked list management systems, it is characterized in that the value of M satisfies: if N/K is an integer, then M equals N/K, if N/K is not an integer, then M equals N/K+1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011100594434A CN102130833A (en) | 2011-03-11 | 2011-03-11 | Memory management method and system of traffic management chip chain tables of high-speed router |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011100594434A CN102130833A (en) | 2011-03-11 | 2011-03-11 | Memory management method and system of traffic management chip chain tables of high-speed router |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102130833A true CN102130833A (en) | 2011-07-20 |
Family
ID=44268727
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2011100594434A Pending CN102130833A (en) | 2011-03-11 | 2011-03-11 | Memory management method and system of traffic management chip chain tables of high-speed router |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102130833A (en) |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103166845A (en) * | 2013-03-01 | 2013-06-19 | 华为技术有限公司 | Data processing method and device |
| CN103543988A (en) * | 2013-10-23 | 2014-01-29 | 华为终端有限公司 | Method for processing array information, method and device of controlling information to enter arrays |
| CN104125168A (en) * | 2013-04-27 | 2014-10-29 | 中兴通讯股份有限公司 | A scheduling method and system for shared resources |
| WO2014173297A1 (en) * | 2013-04-26 | 2014-10-30 | Mediatek Inc. | Output queue of multi-plane network device and related method of managing output queue having multiple packet linked lists |
| CN104572498A (en) * | 2014-12-26 | 2015-04-29 | 曙光信息产业(北京)有限公司 | Cache management method for message and device |
| CN105516023A (en) * | 2014-09-24 | 2016-04-20 | 华为技术有限公司 | Message forwarding method and apparatus |
| WO2016179968A1 (en) * | 2015-05-13 | 2016-11-17 | 深圳市中兴微电子技术有限公司 | Queue management method and device, and storage medium |
| CN106254270A (en) * | 2015-06-15 | 2016-12-21 | 深圳市中兴微电子技术有限公司 | A kind of queue management method and device |
| CN106330741A (en) * | 2015-06-15 | 2017-01-11 | 深圳市中兴微电子技术有限公司 | Message transmission method and device |
| CN111309846A (en) * | 2018-12-12 | 2020-06-19 | 中国移动通信集团四川有限公司 | Index processing method, device, equipment and medium |
| CN112543197A (en) * | 2020-12-04 | 2021-03-23 | 中船重工（武汉）凌久电子有限责任公司 | Method for realizing hardware encryption and decryption of IPSEC under XFRM framework |
| CN112600764A (en) * | 2020-12-07 | 2021-04-02 | 盛科网络（苏州）有限公司 | Scheduling method, device and storage medium of cut-through forwarding mode |
| CN113067778A (en) * | 2021-06-04 | 2021-07-02 | 新华三半导体技术有限公司 | Flow management method and flow management chip |
| CN114185693A (en) * | 2021-11-22 | 2022-03-15 | 西安空间无线电技术研究所 | Self-repairable multi-node aggregation shared queue management method |
| CN114579812A (en) * | 2022-03-14 | 2022-06-03 | 上海壁仞智能科技有限公司 | Method and device for managing linked list queue, task management method and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1858734A (en) * | 2005-12-28 | 2006-11-08 | 华为技术有限公司 | Data storaging and searching method |
| US20090100075A1 (en) * | 2007-10-10 | 2009-04-16 | Tobias Karlsson | System and method of mirroring a database to a plurality of subscribers |
| CN101635682A (en) * | 2009-08-05 | 2010-01-27 | 中兴通讯股份有限公司 | Storage management method and storage management system |
-
2011
- 2011-03-11 CN CN2011100594434A patent/CN102130833A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1858734A (en) * | 2005-12-28 | 2006-11-08 | 华为技术有限公司 | Data storaging and searching method |
| US20090100075A1 (en) * | 2007-10-10 | 2009-04-16 | Tobias Karlsson | System and method of mirroring a database to a plurality of subscribers |
| CN101635682A (en) * | 2009-08-05 | 2010-01-27 | 中兴通讯股份有限公司 | Storage management method and storage management system |
Cited By (24)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103166845A (en) * | 2013-03-01 | 2013-06-19 | 华为技术有限公司 | Data processing method and device |
| US9313148B2 (en) | 2013-04-26 | 2016-04-12 | Mediatek Inc. | Output queue of multi-plane network device and related method of managing output queue having multiple packet linked lists |
| CN105164983B (en) * | 2013-04-26 | 2019-02-22 | 联发科技股份有限公司 | The related management method of the output queue of the output queue and stage construction network equipment of stage construction network equipment |
| WO2014173297A1 (en) * | 2013-04-26 | 2014-10-30 | Mediatek Inc. | Output queue of multi-plane network device and related method of managing output queue having multiple packet linked lists |
| CN105164983A (en) * | 2013-04-26 | 2015-12-16 | 联发科技股份有限公司 | Output queue of multi-plane network device and related method of managing output queue having multiple packet linked lists |
| CN104125168A (en) * | 2013-04-27 | 2014-10-29 | 中兴通讯股份有限公司 | A scheduling method and system for shared resources |
| CN103543988B (en) * | 2013-10-23 | 2017-05-10 | 华为终端有限公司 | Method for processing array information, method and device of controlling information to enter arrays |
| CN103543988A (en) * | 2013-10-23 | 2014-01-29 | 华为终端有限公司 | Method for processing array information, method and device of controlling information to enter arrays |
| CN105516023A (en) * | 2014-09-24 | 2016-04-20 | 华为技术有限公司 | Message forwarding method and apparatus |
| CN104572498A (en) * | 2014-12-26 | 2015-04-29 | 曙光信息产业(北京)有限公司 | Cache management method for message and device |
| WO2016179968A1 (en) * | 2015-05-13 | 2016-11-17 | 深圳市中兴微电子技术有限公司 | Queue management method and device, and storage medium |
| CN106302238A (en) * | 2015-05-13 | 2017-01-04 | 深圳市中兴微电子技术有限公司 | A kind of queue management method and device |
| CN106254270A (en) * | 2015-06-15 | 2016-12-21 | 深圳市中兴微电子技术有限公司 | A kind of queue management method and device |
| CN106330741A (en) * | 2015-06-15 | 2017-01-11 | 深圳市中兴微电子技术有限公司 | Message transmission method and device |
| CN106330741B (en) * | 2015-06-15 | 2020-04-24 | 深圳市中兴微电子技术有限公司 | Message transmission method and device |
| CN111309846A (en) * | 2018-12-12 | 2020-06-19 | 中国移动通信集团四川有限公司 | Index processing method, device, equipment and medium |
| CN111309846B (en) * | 2018-12-12 | 2023-09-05 | 中国移动通信集团四川有限公司 | Index processing method, device, equipment and medium |
| CN112543197A (en) * | 2020-12-04 | 2021-03-23 | 中船重工（武汉）凌久电子有限责任公司 | Method for realizing hardware encryption and decryption of IPSEC under XFRM framework |
| CN112600764A (en) * | 2020-12-07 | 2021-04-02 | 盛科网络（苏州）有限公司 | Scheduling method, device and storage medium of cut-through forwarding mode |
| CN112600764B (en) * | 2020-12-07 | 2022-04-15 | 苏州盛科通信股份有限公司 | Scheduling method, device and storage medium of cut-through forwarding mode |
| CN113067778A (en) * | 2021-06-04 | 2021-07-02 | 新华三半导体技术有限公司 | Flow management method and flow management chip |
| CN114185693A (en) * | 2021-11-22 | 2022-03-15 | 西安空间无线电技术研究所 | Self-repairable multi-node aggregation shared queue management method |
| CN114579812A (en) * | 2022-03-14 | 2022-06-03 | 上海壁仞智能科技有限公司 | Method and device for managing linked list queue, task management method and storage medium |
| CN114579812B (en) * | 2022-03-14 | 2023-09-15 | 上海壁仞智能科技有限公司 | Management method and device of linked list queue, task management method and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102130833A (en) | Memory management method and system of traffic management chip chain tables of high-speed router | |
| US8930593B2 (en) | Method for setting parameters and determining latency in a chained device system | |
| CN104794100A (en) | Heterogeneous multi-core processing system based on on-chip network | |
| CN101635682B (en) | Storage management method and storage management system | |
| CN110995598B (en) | Variable-length message data processing method and scheduling device | |
| CN101873253A (en) | Buffered crossbar switch system | |
| JP2011505036A5 (en) | ||
| CN101515841B (en) | Method for data packet transmission based on RapidIO, device and system | |
| CN103748845B (en) | Packet sending and receiving method, device and system | |
| CN106537858B (en) | A kind of method and apparatus of queue management | |
| CN102395958B (en) | Concurrent processing method and device for data packet | |
| CN101252536A (en) | Router multi-queue data pack buffer management and output queue scheduling system | |
| CN106789734B (en) | Control system and method for macro frame in exchange control circuit | |
| CN103139732A (en) | Improved short message sending method and system | |
| CN102843298A (en) | Method and system for achieving priority of Openflow switchboard chip flow tables | |
| CN102508803A (en) | Matrix transposition memory controller | |
| CN101604261A (en) | The method for scheduling task of supercomputer | |
| CN101902390B (en) | Unicast and multicast integrated scheduling device, exchange system and method | |
| CN103220230B (en) | Support the dynamic shared buffer method that message crossbar stores | |
| CN104572498A (en) | Cache management method for message and device | |
| CN105516023A (en) | Message forwarding method and apparatus | |
| CN115955441A (en) | Management scheduling method and device based on TSN queue | |
| CN1885827A (en) | Message storage forwarding method and message storage forwarding circuit | |
| CN209514612U (en) | A kind of communication system | |
| CN110688209B (en) | Binary tree-based large-window access flow scheduling buffer structure and method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20151027 Address after: 518057 Nanshan District Guangdong high tech Industrial Park, South Road, science and technology, ZTE building, Ministry of Justice Applicant after: ZTE Corporation Applicant after: SHENZHEN ZTE MICROELECTRONICS TECHNOLOGY CO., LTD. Address before: 518057 Nanshan District Guangdong high tech Industrial Park, South Road, science and technology, ZTE building, Ministry of Justice Applicant before: ZTE Corporation |
|
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20110720 |