CN102111332B - Method and controller for classified output of messages in communication system - Google Patents
Method and controller for classified output of messages in communication system Download PDFInfo
- Publication number
- CN102111332B CN102111332B CN2010106201237A CN201010620123A CN102111332B CN 102111332 B CN102111332 B CN 102111332B CN 2010106201237 A CN2010106201237 A CN 2010106201237A CN 201010620123 A CN201010620123 A CN 201010620123A CN 102111332 B CN102111332 B CN 102111332B
- Authority
- CN
- China
- Prior art keywords
- message
- queue
- output
- msgblockno
- idle
- 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.)
- Active
Links
Images
Abstract
The invention provides a method and a controller for the classified output of messages in a communication system, and mainly solves the problems that that a conventional method and a conventional controller have high demand on storage resources and high cost, and are low in utilization ratio and difficult to implement. The method for the classified output of the messages in the communication system comprises three steps, namely, system initialization, message writing and message reading. The controller for the classified output of the messages in the communication system comprises an input control unit, a memory unit, an output control unit, a message attribute list unit, an idle message block concordance list unit, a message searching list unit and an output control list unit. The methodand the controller for the classified output of the messages in the communication system, which are provided by the invention, have good flexibility, the number of output ports of a message queue management controller for classification is configurable, and the depth of output queue is configurable.
Description
Technical field
The invention belongs to computer hardware technology, relate to the hardware circuit implementation method of message queue management in switch and the communication node.
Background technology
In the high-speed communication system design, for efficiency of transmission, telecommunication service quality, message communicating transmission certainty, bandwidth isolation and the transmission of messages efficient that guarantees system, need in communication node, make up multipriority queue, then need to make up output queue in the switch, and the realization of these formations needs a large amount of memory resources.
Communications dispatching management must message based classification be stored realization, and is each message fixed allocation memory space in legacy communications system, and utilization ratio of storage resources is inadequate.Often be subject to the storage resources of FPGA at the hardware of switch and communication node, be difficult to realize extensive exchange and message deterministic schedule, the storage resources of FPGA has become the bottleneck of restriction communication system scale and communication bandwidth.
Each formation adopts Stand Alone Memory to distribute in traditional message queue storage administration, and each formation need to distribute fixing memory resource.For example during switch design, stop up for fear of begin chain, satisfy the linear speed transmission requirement, each input port need to be set up one group of fifo queue for each output port.In the Design of Communication Node, need to be one group of FIFO of each priority assignment.The method is large to the storage resource demands amount, and utilance is not high, and FPGA realizes that difficulty is large, and cost is high.
Summary of the invention
The invention provides a kind of communication system information classification output intent and controller, mainly solved the problem that existing method and controller are large to the storage resource demands amount, utilance is low, the realization difficulty is large, cost is high.
Technical solution of the present invention is as follows:
This communication system information classification output intent may further comprise the steps:
1] system initialization
1.1] the memory cell division
1.1.1] memory cell is for being used for depositing a slice storage area of message, is divided in logic a plurality of isometric message stores pieces, each message stores piece can be deposited a piece of news;
1.1.2] each message stores piece is in order from 0 open numbering;
1.1.3] each message stores block number and message storage address set up corresponding relation;
1.2] initialization of message attributes table
Set up a relevance memory content-addressable memory, the attribute list that gives information is in order to make up message identifier to the mapping relations of message output queue index;
1.3] initialization of idle message memory block concordance list
1.3.1] setting up an idle index queue, queue depth equates with message stores piece number, the unit is used for depositing message numbering in the formation, formation supported data reading and writing operation, and queue empty, full scale note are provided;
1.3.2] all message stores block numbers are joined idle index queue;
1.4] initialization of message look-up table
The message look-up table is a 2-d index table, the respectively corresponding current message memory block numbering of 2-d index table address and content and next message stores block number, the content of numbering as address search 2-d index table with the current message memory block is next message stores block number, and when the next message stores piece of certain message identical with this message stores block number, the tail of the queue that then to identify this message stores piece be the message output queue;
1.5] output control table initialization
Message stores piece number and team's message stores block number of all output queues recorded respectively in the output control table, and the message stores piece number with each output queue during system initialization sets to 0, and represents output queue for empty;
2] ablation process of message
Message is written in the idle message stores piece, and according to the sign of message, upgrades corresponding output queue information and message look-up table in the output control table;
3] message reads process
From output queue, read message, output control can take fair robin scheduling algorithm or, output control mainly realizes the classification output access according to the output chained list, the output queue number is configurable, typical number is: 2-256.The output control output queue degree of depth is configurable, and representative value is: 4,8,16.
The above step 2 is specifically:
A receives message, judges whether idle index queue is empty, if idle index queue is empty, expression does not have idle message stores piece, then directly abandons this message and returns, otherwise enter b;
B. from idle message memory block concordance list first idle message stores block number MsgBlockNo that looks ahead;
C. computation-free message stores block address, computing formula: MsgBlockAddr=MsgMaxLen * MsgBlockNo;
D. reserve front 4 bytes in the idle message memory block and be used for depositing message-length, deposit the content of message from the address of MsgBlockAddr+4, message is written in the idle message memory block, and carry out message-length and count, after message sink is complete, message-length is written to front 4 the byte places of idle message memory block;
E. resolve message identifier, look into the message attributes table according to message identifier, if hit, then obtain the output queue numbering, otherwise abandon this message, enter a;
F. search the corresponding message number of output control table according to the output queue numbering,
If when f1 message number equals the message stores piece maximum number of the output queue that system arranges, then enter and abandon this message, enter a;
If f2 message number is 0, then the message number is put 1, take out this idle message stores block number MsgBlockNo from idle message memory block concordance list, with the team head of message stores block number MsgBlockNo as this output queue; Message look-up table MsgBlockNo place is write MsgBlockNo, and representing MsgBlockNo is tail of the queue;
If f3 message number is not 0, then the message number is added 1, from this output queue team message stores block number, obtain next message stores block number by the message look-up table, until find tail of the queue MsgTailBlockNo;
H. after f2 and f3 step process, take out this idle message stores block number MsgBlockNo from idle message memory block concordance list, message look-up table MsgBlockNo place is write MsgBlockNo, representing MsgBlockNo is tail of the queue; The MsgTailBlockNo place is write MsgBlockNo, and the next message stores piece that represents MsgTailBlockNo message stores piece is MsgBlockNo, thereby message is joined the tail of the queue of this output queue.
The f of above-described step 2, searching next message stores block number is that cancellation ceases look-up table content MsgNextBlockNo as address read with current message memory block numbering, MsgNextBlockNo is next message stores block number; The foundation of judging tail of the queue is that the next message stores block number of current message memory block numbering is itself, and namely the content of message look-up table equates with its address.
The above described step 3 is specifically: judge whether the message number is 0 in the output queue, if be 0, then withdraws from; From output queue, obtain the message stores block number MsgBlockNo of team; Calculate the memory unit address of message stores piece according to team's message stores block number, computing formula: MsgBlockaddr=MsgMaxLen * MsgBlockNo; Be used for depositing message-length from front 4 bytes of MsgBlockaddr; Cancel the content of breath from the address read of MsgBlockaddr+4; Search the next message stores block number MsgNextBlockNo of MsgBlockNo from the message look-up table; The message number of output queue is subtracted 1, next message stores block number MsgNextBlockNo is set to team's head of current output queue.
Among the above described step 1.1.1, message stores block size (MsgMaxLen) value is 2
nByte, 64 to the 4K byte; Among the described step 1.1.2, the message stores block number is labeled as MsgBlockNo; Among the described step 1.1.3, message stores block address MsgBlockAddr determines according to message stores block number MsgBlockNo and message stores block size MsgMaxLen; In the described step 1.5, the message stores piece maximum number of output queue is by system's setting, and representative value is 4,8,16.
This communication system information classification o controller comprises Input Control Element, memory cell, output control unit, message attributes table unit, idle message memory block concordance list unit, message look-up table unit, output control table unit; The input of described Input Control Element is connected with the output of input signal, message attributes table unit, the output of idle message memory block concordance list unit respectively, and the output of Input Control Element is connected with the input of memory cell, message look-up table unit, the input of output control table unit respectively; The input of described memory cell is connected with the output of Input Control Element, and the output of memory cell is connected with the input of output control unit; The input of described output control unit is connected with the output of memory cell, the output of message look-up table unit, the output of output control table unit respectively; The output of output control unit is connected with output signal; The input of described message attributes table unit is connected with input signal.
The above memory cell is dual-ported memory.
Advantage of the present invention is as follows:
The present invention proposes a kind of implementation method of message queue Management Controller of shared storage resources, adopt chain structure to share storage administration mechanism, effectively improved the memory resource utilance, reduce hardware designs difficulty and cost, promoted the single chip design may scale, guaranteed that communication system has fine transmission service quality.
Communication system information classification output intent provided by the invention and controller, based on limited storage resources, adopt the message queue administrative mechanism of sharing storage resources, realize message classification o controller, effectively solve the bottleneck problem of storage resources, be conducive to realize exchanging more on a large scale and more deterministic scheduling message on existing fpga chip basis.
Communication system information classification output intent provided by the invention and controller efficiency of transmission are high, adopt hardware circuit to realize message queue management control, satisfy the requirement of communication high-speed transfer.
Communication system information classification output intent provided by the invention and controller resource overhead are little on the shared storage basis, adopt chain type management management, have improved utilization ratio of storage resources, reduce system to storage resource demands.
Communication system information classification output intent provided by the invention and controller dispatching algorithm are flexible, and the message queue Management Controller adopts the classification output of message, can support various dispatching algorithms to realize.
Communication system information classification output intent provided by the invention and controller design difficulty are little, Communication System Design scale in the Effective Raise single-chip, the internal system interconnection realizes simple, guarantees that communication system has fine transmission service quality, reduces the Communication System Design difficulty.
Communication system information classification output intent provided by the invention and controller flexibility are good, and the output port number of message queue Management Controller classification is configurable, and the output queue degree of depth is configurable, has good flexibility.
Description of drawings
Fig. 1 is message classification o controller functional block diagram;
Fig. 2 is message chain type management schematic diagram.
Embodiment
Principle of the present invention is as follows:
In the network switch or communication node hardware designs, communication system information classification o controller adopts shares storage and chained list way to manage, realizes message classification storage and retrieval.
Adopt shared memory cell as message stores, being used for depositing the message shared memory cell is the continuous storage area of a slice, is divided in logic a plurality of isometric message stores pieces, is numbered in order, and each message stores piece can be deposited a piece of news.
When system initialization, all message stores piece index are put in the idle message concordance list; Message is write fashionable, from idle message memory block concordance list, obtain message stores piece index, calculate the message stores block address, message content is written to corresponding message stores piece, search the message attributes table according to message identifier and obtain the output queue index, to the output control table, each output queue team message stores piece index, the precedence relationship of chain of messages table record message index are recorded in the output control table with the index upgrade of message stores piece; When message read, output control unit was mainly realized message classification output access according to output control table and message chained list, can obtain first message stores piece of message queue from the output control table, searched the message look-up table and obtained the subsequent message memory block.After from the message stores piece, reading message message stores piece index is put back in the idle message concordance list for receiving new message.
This communication system information classification output intent may further comprise the steps:
1] system initialization
1.1] the memory cell division
1.1.1] memory cell is for being used for depositing a slice storage area of message, is divided in logic a plurality of isometric message stores pieces, each message stores piece can be deposited a piece of news; Message stores block size (MsgMaxLen) value is 2
nByte, 64 to the 4K byte;
1.1.2] each message stores piece is in order from 0 open numbering; The message stores block number is labeled as MsgBlockNo;
1.1.3] each message stores block number and message storage address set up corresponding relation; Message stores block address MsgBlockAddr determines according to message stores block number MsgBlockNo and message stores block size MsgMaxLen;
1.2] initialization of message attributes table
Set up a relevance memory content-addressable memory, the attribute list that gives information is in order to make up message identifier to the mapping relations of message output queue index;
1.3] initialization of idle message memory block concordance list
1.3.1] setting up an idle index queue, queue depth equates with message stores piece number, the unit is used for depositing message numbering in the formation, formation supported data reading and writing operation, and queue empty, full scale note are provided;
1.3.2] all message stores block numbers are joined idle index queue;
1.4] initialization of message look-up table
The message look-up table is a 2-d index table, the respectively corresponding current message memory block numbering of 2-d index table address and content and next message stores block number, the content of numbering as address search 2-d index table with the current message memory block is next message stores block number, and when the next message stores piece of certain message identical with this message stores block number, the tail of the queue that then to identify this message stores piece be the message output queue;
It is bivariate table address and the respectively corresponding current message memory block numbering of content and next message stores block number specifically, with the content of current message memory block numbering as the address search bivariate table, be next message stores block number, set up the precedence relationship of message by the message chained list; In the system initialization process, the value of message look-up table address is written to corresponding address as content, represent that the next one of each message stores piece is itself, namely this message stores piece is tail of the queue;
1.5] output control table initialization
Message stores piece number and team's message stores block number of all output queues recorded respectively in the output control table, and the message stores piece number with each output queue during system initialization sets to 0, and represents output queue for empty; The message stores piece maximum number of output queue is by system's setting, and representative value is 4,8,16;
2] ablation process of message
Message is written in the idle message stores piece, and according to the sign of message, upgrades corresponding output queue information and message look-up table in the output control table; It is specifically:
A receives the message synchronization head, judges whether idle index queue is empty, if idle index queue is empty, expression does not have idle message stores piece, then directly abandons this message and returns, otherwise enter b;
B. from idle message memory block concordance list first idle message stores block number MsgBlockNo that looks ahead;
C. computation-free message stores block address, computing formula: MsgBlockAddr=MsgMaxLen * MsgBlockNo;
D. reserve front 4 bytes in the idle message memory block and be used for depositing message-length, deposit the content of message from the address of MsgBlockAddr+4, message is written in the idle message memory block, and carry out message-length and count, after message sink is complete, message-length is written to front 4 the byte places of idle message memory block;
E. resolve message identifier, look into the message attributes table according to message identifier, if hit, then obtain the output queue numbering, otherwise abandon this message, enter a;
F. search the corresponding message number of output control table according to the output queue numbering,
If when f1 message number equals the message stores piece maximum number of the output queue that system arranges, then enter and abandon this message, enter a;
If f2 message number is 0, then the message number is put 1, take out this idle message stores block number MsgBlockNo from idle message memory block concordance list, with the team head of message stores block number MsgBlockNo as this output queue; Message look-up table MsgBlockNo place is write MsgBlockNo, and representing MsgBlockNo is tail of the queue;
If f3 message number is not 0, then the message number is added 1, from this output queue team message stores block number, obtain next message stores block number by the message look-up table, until find tail of the queue MsgTailBlockNo;
Searching next message stores block number is that cancellation ceases look-up table content MsgNextBlockNo as address read with current message memory block numbering, and MsgNextBlockNo is next message stores block number; The foundation of judging tail of the queue is that the next message stores block number of current message memory block numbering is itself, and namely the content of message look-up table equates with its address;
H. after f2 and f3 step process, take out this idle message stores block number MsgBlockNo from idle message memory block concordance list, message look-up table MsgBlockNo place is write MsgBlockNo, representing MsgBlockNo is tail of the queue; The MsgTailBlockNo place is write MsgBlockNo, and the next message stores piece that represents MsgTailBlockNo message stores piece is MsgBlockNo, thereby message is joined the tail of the queue of this output queue.
3] message reads process
Read message from output queue, can adopt output control to adopt fair robin scheduling algorithm or priority scheduling algorithm, output control mainly realizes the classification output access according to the output chained list, and the output queue number is configurable, and typical number is: 2-256.The output control output queue degree of depth is configurable, and representative value is: 4,8,16, its specifically:
Judge whether the message number is 0 in the output queue, if be 0, then withdraws from; From output queue, obtain the message stores block number MsgBlockNo of team; Calculate the memory unit address of message stores piece according to team's message stores block number, computing formula: MsgBlockaddr=MsgMaxLen * MsgBlockNo; Be used for depositing message-length from front 4 bytes of MsgBlockaddr; Cancel the content of breath from the address read of MsgBlockaddr+4; Search the next message stores block number MsgNextBlockNo of MsgBlockNo from the message look-up table; The message number of output queue is subtracted 1, next message stores block number MsgNextBlockNo is set to team's head of current output queue.
This communication system information classification o controller comprises Input Control Element, memory cell, output control unit, message attributes table unit, idle message memory block concordance list unit, message look-up table unit, output control table unit; The input of described Input Control Element is connected with the output of input signal, message attributes table unit, the output of idle message memory block concordance list unit respectively, and the output of Input Control Element is connected with the input of memory cell, message look-up table unit, the input of output control table unit respectively; The input of described memory cell is connected with the output of Input Control Element, and the output of memory cell is connected with the input of output control unit; The input of described output control unit is connected with the output of memory cell, the output of message look-up table unit, the output of output control table unit respectively; The output of output control unit is connected with output signal; The input of described message attributes table unit is connected with input signal.
Input Control Element obtains idle message memory block index, and message is write in the idle message memory block, makes up output message chained list and output control table according to the targets of messages address.
Memory cell adopts dual-ported memory as sharing storage resources, is used for depositing message content;
Output control unit can obtain a plurality of output queue states, can read article one message in any output queue according to certain policy selection;
The message attributes table unit gives information and is identified to the mapping relations of message output queue index.
Idle message memory block numbering is mainly deposited in idle message memory block concordance list unit.
Message look-up table unit is used for searching the next message stores block number of current message memory block numbering.
Team's message stores block number and message stores piece number in the difference recording messages formation of output control table unit.When message stores piece number is 0, delegation classifies sky as, and when message stores piece number is not 0, representing has message in the formation, and team's message stores block number is article one message in the formation, can obtain subsequent message in the message queue by searching the message look-up table.
Claims (5)
1. a communication system information classification output intent is characterized in that, may further comprise the steps:
1] system initialization
1.1] the memory cell division
1.1.1] memory cell is for being used for depositing a slice storage area of message, is divided in logic at least one isometric message stores piece, each message stores piece can be deposited a piece of news;
1.1.2] each message stores piece is in order from 0 open numbering;
1.1.3] each message stores block number and message storage address set up corresponding relation;
1.2] initialization of message attributes table
Set up a relevance memory content-addressable memory, this table is for the message attributes table, in order to make up message identifier to the mapping relations of message output queue index;
1.3] initialization of idle message memory block concordance list
1.3.1] setting up an idle index queue, queue depth equates with message stores piece number, the unit is used for depositing the message stores block number in the formation, formation supported data reading and writing operation, and queue empty, full scale note are provided;
1.3.2] all message stores block numbers are joined idle index queue;
1.4] initialization of message look-up table
The message look-up table is a 2-d index table, the respectively corresponding current message memory block numbering of 2-d index table address and content and next message stores block number, the content of numbering as address search 2-d index table with the current message memory block is next message stores block number, and when the next message stores piece of certain message identical with this message stores block number, the tail of the queue that then to identify this message stores piece be the message output queue;
1.5] output control table initialization
Message stores block number number and team's message stores block number of all output queues recorded respectively in the output control table, and the message stores piece number with each output queue during system initialization sets to 0, and represents output queue for empty;
2] ablation process of message
Message is written in the idle message stores piece, and according to the sign of message, upgrades corresponding output queue information and message look-up table in the output control table;
Described step 2 is specifically:
A judges whether idle index queue is empty, if idle index queue is empty, expression does not have idle message stores piece, then directly abandons this message and returns, otherwise enter b after receiving message;
B. from idle message memory block concordance list first idle message stores block number MsgBlockNo that looks ahead;
C. computation-free message stores block address, computing formula: MsgBlockAddr=MsgMaxLen * MsgBlockNo, MsgMaxLen is the message stores block size;
D. reserve front 4 bytes in the idle message memory block and be used for depositing message-length, deposit the content of message from the address of MsgBlockAddr+4, message is written in the idle message memory block, and carry out message-length and count, after message sink is complete, message-length is written to front 4 the byte places of idle message memory block;
E. resolve message identifier, look into the message attributes table according to message identifier, if hit, then obtain the output queue numbering, otherwise abandon this message, enter a;
F. search the corresponding message number of output control table according to the output queue numbering;
If when f1 message number equals the message stores piece maximum number of the output queue that system arranges, then abandon this message, enter a;
If f2 message number is 0, then the message number is put 1, take out this idle message stores block number MsgBlockNo from idle message memory block concordance list, with the team head of message stores block number MsgBlockNo as this output queue; Message look-up table MsgBlockNo place is write MsgBlockNo, and representing MsgBlockNo is tail of the queue;
If f3 message number is not 0, then the message number is added 1, this output queue team message stores block number obtains next message stores block number by the message look-up table, until find tail of the queue MsgTailBlockNo;
H. after f2 and f3 step process, take out this idle message stores block number MsgBlockNo from idle message memory block concordance list, message look-up table MsgBlockNo place is write MsgBlockNo, representing MsgBlockNo is tail of the queue; The MsgTailBlockNo place is write MsgBlockNo, and the next message stores piece that represents MsgTailBlockNo message stores piece is MsgBlockNo, thereby message is joined the tail of the queue of this output queue;
3] message reads process
From output queue, read message.
2. communication system information according to claim 1 classification output intent, it is characterized in that: the f of described step 2, searching next message stores block number is that cancellation ceases look-up table content MsgNextBlockNo as address read with current message memory block numbering, and MsgNextBlockNo is next message stores block number; The foundation of judging tail of the queue is that the next message stores block number of current message memory block numbering is itself, and namely the content of message look-up table equates with its address.
3. communication system information according to claim 2 classification output intent is characterized in that: described step 3 specifically: judge whether the message number is 0 in the output queue, if be 0, then withdraws from; From output queue, obtain the message stores block number MsgBlockNo of team; Calculate the memory unit address of message stores piece according to team's message stores block number, computing formula: MsgBlockaddr=MsgMaxLen * MsgBlockNo; Front 4 bytes of MsgBlockaddr are used for depositing message-length; Cancel the content of breath from the address read of MsgBlockaddr+4; Search the next message stores block number MsgNextBlockNo of MsgBlockNo from the message look-up table; The message number of output queue is subtracted 1, next message stores block number MsgNextBlockNo is set to team's head of current output queue.
4. according to claim 1 to 3 arbitrary described communication system information classification output intents, it is characterized in that: described step 3 reads message from output queue, and fair robin scheduling algorithm or priority scheduling algorithm are adopted in its output control.
5. communication system information according to claim 4 classification output intent, it is characterized in that: among the described step 1.1.1, message stores block size (MsgMaxLen) value is 2
nByte, 64 to the 4K byte; Among the described step 1.1.2, the message stores block number is labeled as MsgBlockNo; Among the described step 1.1.3, message stores block address MsgBlockAddr determines according to message stores block number MsgBlockNo and message stores block size MsgMaxLen; In the described step 1.5, the message stores piece maximum number of output queue is by system's setting, and representative value is 4,8,16.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010106201237A CN102111332B (en) | 2010-12-31 | 2010-12-31 | Method and controller for classified output of messages in communication system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010106201237A CN102111332B (en) | 2010-12-31 | 2010-12-31 | Method and controller for classified output of messages in communication system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102111332A CN102111332A (en) | 2011-06-29 |
| CN102111332B true CN102111332B (en) | 2013-04-03 |
Family
ID=44175365
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010106201237A Active CN102111332B (en) | 2010-12-31 | 2010-12-31 | Method and controller for classified output of messages in communication system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102111332B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107222435B (en) * | 2016-03-21 | 2020-07-24 | 深圳市中兴微电子技术有限公司 | Method and device for eliminating exchange head resistance of message |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1474512A (en) * | 2002-08-09 | 2004-02-11 | 华为技术有限公司 | Method for increasing bandwidth utilization rate in data transmission process |
| CN101176318A (en) * | 2005-05-18 | 2008-05-07 | 皇家飞利浦电子股份有限公司 | Integrated circuit and method of arbitration in a network on an integrated circuit |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2004171177A (en) * | 2002-11-19 | 2004-06-17 | Renesas Technology Corp | Cache system and cache memory controller |
-
2010
- 2010-12-31 CN CN2010106201237A patent/CN102111332B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1474512A (en) * | 2002-08-09 | 2004-02-11 | 华为技术有限公司 | Method for increasing bandwidth utilization rate in data transmission process |
| CN101176318A (en) * | 2005-05-18 | 2008-05-07 | 皇家飞利浦电子股份有限公司 | Integrated circuit and method of arbitration in a network on an integrated circuit |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102111332A (en) | 2011-06-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102045258B (en) | Data caching management method and device | |
| US7283556B2 (en) | Method and system for managing time division multiplexing (TDM) timeslots in a network switch | |
| US10412021B2 (en) | Optimizing placement of virtual machines | |
| US7227841B2 (en) | Packet input thresholding for resource distribution in a network switch | |
| US7042891B2 (en) | Dynamic selection of lowest latency path in a network switch | |
| CN101252536B (en) | Router multi-queue data pack buffer management and output queue scheduling system | |
| JP5863076B2 (en) | Method, apparatus, and system for reconstructing and reordering packets | |
| CN100550847C (en) | A kind of method and device that solves the Hash conflict | |
| US7406041B2 (en) | System and method for late-dropping packets in a network switch | |
| US20020118692A1 (en) | Ensuring proper packet ordering in a cut-through and early-forwarding network switch | |
| US8891517B2 (en) | Switching device | |
| CN104731799B (en) | Main memory DBM device | |
| CN106612236B (en) | Many-core network processor and message scheduling method and system of micro-engine thereof | |
| CN101499956B (en) | Hierarchical buffer zone management system and method | |
| CN109861931A (en) | A kind of storage redundant system of high speed Ethernet exchange chip | |
| CN113411270A (en) | Message buffer management method for time-sensitive network | |
| CN108984280A (en) | A kind of management method and device, computer readable storage medium of chip external memory | |
| CN106789734B (en) | Control system and method for macro frame in exchange control circuit | |
| CN105426260A (en) | Distributed system supported transparent interprocess communication system and method | |
| CN103117962B (en) | A kind of spaceborne Shared memory switch device | |
| CN102111332B (en) | Method and controller for classified output of messages in communication system | |
| CN111611180B (en) | Dynamic shared buffer area supporting multiple protocols | |
| CN101753580B (en) | Packet processing chip and data storage and forwarding method thereof | |
| CN201976132U (en) | Message classifying and outputting controller of communication system | |
| US8670454B2 (en) | Dynamic assignment of data to switch-ingress buffers |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |