Method, device and network device for realizing SDRAM table search
A network device and table look-up technology, applied in the field of communications, can solve problems such as reducing table look-up performance and lack of flexibility, and achieve the effect of improving table look-up performance and increasing flexibility
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0038] The technical solution provided by Embodiment 1 of the present invention describes in detail the implementation solution of the SDRAM look-up table. like figure 1 As shown, the specific implementation method includes the following operations:
[0039] Step 11, judge the table lookup request, if the table lookup request is a read request, then perform step 12, if the table lookup request is a write request or a refresh request, then perform step 14;
[0040] Step 12, according to the bank number, according to the copy information of the table item to be checked in the table lookup request and the current state information of each bank, check each bank of a certain address of the SDRAM in sequence; when a certain bank storing the table item to be looked up When the table lookup operation is currently allowed, it is determined that the bank is the bank to be operated, and the subsequent banks are no longer checked, and step 13 is performed;
[0041] Step 13, read the tab...
Embodiment 2
[0047] Embodiment 2 of the present invention takes 36-bit RLDRAMII with tRC=20ns as an example to describe in detail the table look-up process of requesting to read entries of SDRAM. Each address of the RLDRAMII has 8 banks, and the bank numbers are bank0-bank7 respectively. Each bank corresponds to a counter, and the time period of the counter counting is a read cycle tRC; when the counter is in the counting state, it means that the corresponding bank is currently not allowed to perform a table lookup operation, and it is assigned a value of 0; When the counter stops counting, it means that the corresponding bank is currently allowed to perform table lookup operations, and it is assigned a value of 1. In Embodiment 2 of the present invention, the table lookup request carries 8 bits of information b0 to b7, and the 8 bits of information b0 to b7 correspond to the 8 banks (bank0 to bank7) in turn, and the bit value is 0 to indicate The corresponding bank does not store the tabl...
Embodiment 3
[0055] In the prior art, there are a variety of technical solutions for implementing the Reorder mechanism to choose from, and Embodiment 3 of the present invention only exemplifies one specific implementation method:
[0056] All input table look-up requests are sequentially stored in the pre-specified;
[0057] Define a number of queues in advance to store information related to table lookup requests. For example, define three queues, Q0, Q1, and Q2, and stipulate that the priority relationship of each queue request response is: Q2>Q1>Q0, that is, when all three queues are When there is a table lookup request that can be responded to, the table lookup request in the high priority will be executed first;
[0058] The way each queue obtains the table lookup request is: when Q2 is empty (that is, there is no table lookup request in the queue), it sends a forward message to Q1 and Q0, asking Q1 and Q0 to send the table lookup request to Q2 in turn, and at the same time from the ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 