Abstract: A compression scheme can be selected for an input data stream based on characteristics of the input data stream. For example, when the input data stream is searched for pattern matches, input stream characteristics used to select a compression scheme can include one or more of: type and size of an input stream, a length of a pattern, a distance from a start of where the pattern is to be inserted to the beginning of where the pattern occurred previously, a gap between two pattern matches (including different or same patterns), standard deviation of a length of a pattern, standard deviation of a distance from a start of where the pattern is to be inserted to the beginning of where the pattern occurred previously, or standard deviation of a gap between two pattern matches. Criteria can be established whereby one or more characteristics are used to select a particular encoding scheme.

Abstract: In connection with compression of an input stream, multiple portions of the input stream are searched against previously received portions of the input stream to find any matches of character strings in the previously received portions of the input stream. In some cases, matches of longer character strings, as opposed to shorter character strings, can be selected for inclusion in an encoded stream that is to be compressed. Delayed selection can occur whereby among multiple matches, a match that is longer can be selected for inclusion in the encoded stream and non-selected a character string match is reverted to a literal. A search engine that is searching an input stream to identify a repeat pattern of characters can cease to search for characters that were included in the selected character string match.

Abstract: Technologies for data compression include a computing device having multiple search agents. Each search agent searches a history of an input stream in parallel for a match to the input stream starting at a position based on an index of the search agent. Each search agent generates in parallel a weight value associated with the corresponding match. The weight value is indicative of a length associated with the match and an encoded length associated with the match. The encoded length is indicative of a number of bits to encode the match. The computing device selects a match based on the weight values. The computing device may output a token for the selected match and encode the token using a Huffman coding. Each search agent may be embodied as a hardware component or a software component such as a thread or process. Other embodiments are described and claimed.

Abstract: In connection with compression of an input stream, multiple portions of the input stream are searched against previously received portions of the input stream to find any matches of character strings in the previously received portions of the input stream. In some cases, matches of longer character strings, as opposed to shorter character strings, can be selected for inclusion in an encoded stream that is to be compressed. Delayed selection can occur whereby among multiple matches, a match that is longer can be selected for inclusion in the encoded stream and non-selected a character string match is reverted to a literal. A search engine that is searching an input stream to identify a repeat pattern of characters can cease to search for characters that were included in the selected character string match.

Abstract: A compression scheme can be selected for an input data stream based on characteristics of the input data stream. For example, when the input data stream is searched for pattern matches, input stream characteristics used to select a compression scheme can include one or more of: type and size of an input stream, a length of a pattern, a distance from a start of where the pattern is to be inserted to the beginning of where the pattern occurred previously, a gap between two pattern matches (including different or same patterns), standard deviation of a length of a pattern, standard deviation of a distance from a start of where the pattern is to be inserted to the beginning of where the pattern occurred previously, or standard deviation of a gap between two pattern matches. Criteria can be established whereby one or more characteristics are used to select a particular encoding scheme.

Abstract: A compression engine includes sets of independent search engines. The sets of independent search engines concurrently perform searches for a longest match in a stream of uncompressed data. The searches are distributed amongst the sets of independent search engines on byte boundaries to load balance the use of the search engines.

Abstract: Technologies for data compression include a computing device having multiple search agents. Each search agent searches a history of an input stream in parallel for a match to the input stream starting at a position based on an index of the search agent. Each search agent generates in parallel a weight value associated with the corresponding match. The weight value is indicative of a length associated with the match and an encoded length associated with the match. The encoded length is indicative of a number of bits to encode the match. The computing device selects a match based on the weight values. The computing device may output a token for the selected match and encode the token using a Huffman coding. Each search agent may be embodied as a hardware component or a software component such as a thread or process. Other embodiments are described and claimed.

Abstract: Described are apparatuses, methods and storage media associated with performing deflate decompression using multiple parallel content addressable memory cells.

Abstract: Described are apparatuses, methods and storage media associated with performing deflate decompression using multiple parallel content addressable memory cells.