Methods for accelerating hash-based compression and apparatuses using the same
First Claim
1. A method for accelerating hash-based compression, performed in a compression accelerator of a microprocessor, comprising:
- receiving, by a plurality of hash functions, a plurality of sub strings from an FSM (Finite-State Machine) in parallel;
mapping, by each hash function, the received substring to a hash index and directing a selector to connect to one of a plurality of match paths according to the hash index;
transmitting, by a matcher of each connected match path, a no-match message to the FSM when determining that a hash table does not contain the received sub string; and
transmitting, by the matcher of each connected match path, a match message and a match offset of the hash table to the FSM when determining that the hash table contains the received substring, wherein the match offset corresponds to the received substring.
1 Assignment
0 Petitions
Accused Products
Abstract
The invention introduces a method for accelerating hash-based compression, performed in a compression accelerator, comprising: receiving, by a plurality of hash functions, a plurality of substrings from an FSM (Finite-State Machine) in parallel; mapping, by each hash function, the received substring to a hash index and directing a selector to connect to one of a plurality of match paths according to the hash index; transmitting, by a matcher of each connected match path, a no-match message to the FSM when determining that a hash table does not contain the received substring; and transmitting, by the matcher of each connected match path, a match message and a match offset of the hash table to the FSM when determining that the hash table contains the received substring, wherein the match offset corresponds to the received substring.
4 Citations
20 Claims
-
1. A method for accelerating hash-based compression, performed in a compression accelerator of a microprocessor, comprising:
-
receiving, by a plurality of hash functions, a plurality of sub strings from an FSM (Finite-State Machine) in parallel; mapping, by each hash function, the received substring to a hash index and directing a selector to connect to one of a plurality of match paths according to the hash index; transmitting, by a matcher of each connected match path, a no-match message to the FSM when determining that a hash table does not contain the received sub string; and transmitting, by the matcher of each connected match path, a match message and a match offset of the hash table to the FSM when determining that the hash table contains the received substring, wherein the match offset corresponds to the received substring. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. An apparatus for accelerating hash-based compression, comprising:
-
an FSM (Finite-State Machine); and a hash matcher, coupled to the FSM, comprising; a plurality of hash functions; a selector, coupled to the hash functions; and a plurality of match paths, coupled to the selector, wherein the hash functions receives the substrings from the FSM, each hash function maps the received substring to a hash index and directs the selector to connect to one of the match paths according to the hash index, wherein a matcher of each connected match path, transmits a no-match message to the FSM when determining that a hash table does not contain the received substring, wherein the matcher of each connected match path transmits a match message and a match offset of the hash table to the FSM when determining that the hash table contains the received sub string, and wherein the match offset corresponds to the received substring. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19, 20)
-
Specification