Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

A parallel Hash lookup table architecture and method

A technology of table lookup and table entry, applied in the data field, can solve problems such as poor lookup performance, and achieve the effects of improving efficiency, ensuring throughput, high efficiency, and high space utilization

Inactive Publication Date: 2019-01-11
TIANJIN CHIP SEA INNOVATION TECH CO LTD +1
View PDF5 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0008] In view of this, the present invention designs a Hash search architecture and method for parallel Hash calculations, which can effectively solve the above-mentioned poor search performance problems, and no longer need multiple loop comparisons, Hash calculations, and multiple reads Take RAM space, thereby greatly reducing the time of table lookup and improving the efficiency of Hash lookup

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A parallel Hash lookup table architecture and method
  • A parallel Hash lookup table architecture and method
  • A parallel Hash lookup table architecture and method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0036] It should be noted that, in the case of no conflict, the embodiments of the present invention and the features in the embodiments can be combined with each other.

[0037] 1. Hash architecture design

[0038] The present invention designs a Hash search architecture with parallel Hash calculation, multiple RAM storage spaces, RAM equal ratio size, and parallel comparison.

[0039] Such as figure 2 Shown is the architectural design of the present invention. described as follows:

[0040] 1) Look up the table Hash key value KEY, and determine the bit width as required;

[0041] 2) Hash functions 0-(n-1), a total of n, one-to-one correspondence with ram, n Hash functions need to choose different expressions, and minimize the correlation between each hash function;

[0042] 3) There are n RAMs in total, each of which is independent, corresponding to the previous Hash function one by one. The RAM is designed to have different space sizes, maintaining a proportional rela...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention provides a parallel Hash lookup table structure and method. The architecture comprises: a lookup Hash key value KEY determining a bit width according to requirements; n Hash functions, each choosing a different expression; n rams, independent of each other, corresponding to the Hash functions one by one; a Compare module, completing the comparison of n ram lookup results and the lookup key value KEY, and getting the correct look-up table content according to the comparison result, wherein each Hash function corresponds to a ram of different depths. The invention can effectively solve the problem of poor searching performance in the prior art and no longer needs multiple cyclic comparisons and hash calculations, and there is no need to read RAM space for multiple times, thereby greatly compressing the time of looking up table, and improving the efficiency of hash searching.

Description

technical field [0001] The invention belongs to data Background technique [0002] In actual engineering design, it is often encountered that a large range of data is stored and the corresponding content is searched. However, due to the uncertainty of data storage and the limitation of storage space, it is not guaranteed to reserve a large enough storage body to store all the data. . At this time, it is necessary to consider how to map a large range of data to a small range of storage, and quickly locate the lookup address when using it, and the Hash function is just a tool to achieve this operation. The actual Hash function refers to an algorithm that maps a large range to a small range. The purpose of this operation is to save space and make data easy to save. [0003] In the general scheme of implementing the Hash structure, a ram space twice the actual storage content is often used, and multiple Hash functions are used to solve the conflict problem in the process of ta...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06F16/22G06F16/2455
Inventor 刘长江吕平刘勤让沈剑良王盼朱珂宋克陶常勇陈艇杨堃李沛杰于洪张楠徐庆阳刘冬培
Owner TIANJIN CHIP SEA INNOVATION TECH CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com