Method and device for table entry lookup

Abstract

The present disclosure provides a method and device for table entry search, wherein the method is applied to search for a target value corresponding to a keyword in an FPGA chip, including: acquiring a keyword; searching a first table stored in the FPGA chip corresponding to a first index The first group number and the first group validity identifier, the first table is used to store the group number of the large group to which the value corresponding to each keyword belongs and the group validity identifier of the large group, and the first index is determined by the first part of the keyword. Obtain; if the first identification is effective, then look up the table entry corresponding to the second index in the second table stored in the FPGA chip, each table entry is used to store the numerical value, and each group validity is marked as an effective large group including multiple A table entry, the second index is obtained from the second part of the keyword and the first group number; the target value is determined according to the value in the table entry. The technical solution provided by the present disclosure reduces the number of searches, improves the search speed, and achieves balanced optimization of area and speed.

Description

technical field [0001] The present disclosure relates to the technical field of search algorithms, and in particular, to a method and device for table entry search. Background technique [0002] Area and speed are eternal topics in FPGA (Field Programmable Gate Array, Field Programmable Gate Array) design. How to deal with the balance between area and speed is very important in FPGA design. On the one hand, to increase the processing speed, more resources need to be consumed, that is, a larger area is required; on the other hand, in order to reduce the area, the processing speed needs to be reduced. When designing a search algorithm based on an FPGA, saving resources as much as possible and increasing processing speed have become the top priorities. [0003] In practical applications, when transmitting packets, the number of packets of a certain type in each flow will be processed after reaching the threshold N. The corresponding threshold N needs to be configured according...

AI Technical Summary

Problems solved by technology

[0005] In view of this, the embodiments of the present disclosure provide a method and device for table item search, to solve the problem that the direct search method has a large area and the binary search method is slow when searching in an FPGA chip

Images