A compute device to generate deterministic compressed streams receives a current string to be matched to one or more prior instances of the current string, the current string being located within an input buffer and the one or more prior instances located within a history buffer. The compute device identifies a limited subset of index memory designated for storing pointers to the prior instances, identifying a reserved slop region in the index memory, and compares the current string to a prior instance, locating the at least one prior instance using at least one pointer to the at least one prior instance. The at least one pointer is stored within the limited subset of the index memory, and the compute device also prohibits use of any pointers stored in the reserved slop region of the index memory. Other embodiments are described and claimed.

An apparatus and method for performing efficient lossless compression. For example, one embodiment of an apparatus comprises: first compression circuitry to identify and replace one or more repeated bit strings from an input data stream with distances to the one or more repeated bit strings, the first compression circuitry to generate a first compressed data stream comprising literal-length data identifying a first instance of each repeated bit string and distance data comprising distances from the first instance to each repeated instance of the repeated bit string; second compression circuitry to perform sorting, tree generation, and length calculations for literal-length values and distance values of the first compressed data stream, the second compression circuitry comprising: variable length code mapping circuitry to map each literal-length value and distance value to a variable length code; header generation circuitry to generate a header for a final compressed bit stream using the length calculations; and a transcoder to substitute the variable length codes in place of the literal-length and distance values to generate a compressed bit stream body, wherein the transcoder operates in parallel with the header generation circuitry; and bit stream merge circuitry to combine the header with the compressed bit stream body to generate a final lossless compressed bitstream.

Technologies for composing a managed node with multiple processors on multiple compute sleds to cooperatively execute a workload include a memory, one or more processors connected to the memory, and an accelerator. The accelerator further includes a coherence logic unit that is configured to receive a node configuration request to execute a workload. The node configuration request identifies the compute sled and a second compute sled to be included in a managed node. The coherence logic unit is further configured to modify a portion of local working data associated with the workload on the compute sled in the memory with the one or more processors of the compute sled, determine coherence data indicative of the modification made by the one or more processors of the compute sled to the local working data in the memory, and send the coherence data to the second compute sled of the managed node.

A storage control apparatus generates an evaluated compression dictionary from a compression dictionary. The compression dictionary includes, for each of different values included in original data of compressed data, a value and a compression code. The evaluated compression dictionary includes, for each value in the compression dictionary, a value and a compression code. The compressed data includes a compression code for each value in the original data. The storage control apparatus performs, in generation or update of the evaluated compression dictionary, condition evaluation of the value. A compression code of a value determined to correspond to the search condition in the condition evaluation is a condition satisfied code. The storage control apparatus is configured to, in the search, for a compression code in the search range of the compressed data: output, when there is an evaluation dictionary record including a condition satisfied code matching the compression code, a value in the evaluation dictionary record; and output, when there is no evaluation dictionary record including a condition satisfied code matching the compression code, a value that means inconsistency.

A computerized system and method of compressing symbolic information organized into a plurality of documents, each document having a plurality of symbols, the system and method including: (i) automatically identifying a plurality of sequential (also referred to as adjacent) and/or non-sequential symbol (also referred to as non-adjacent) pairs in an input document; (ii) counting the number of appearances of each unique symbol pair; and (iii) producing a compressed document that includes a replacement symbol at each position associated with one of the plurality of symbol pairs, at least one of which corresponds to a non-sequential symbol pair. For each non-sequential pair the compressed document includes corresponding indicia indicating a distance between locations of the non-sequential symbols of the pair in the input document.

Example data compressors disclosed herein include a hash unit to identify a hash table entry matching a hash index determined for a current position of a data stream undergoing data compression, the hash table entry identifying one or more prior positions of the data stream. Disclosed example data compressors also include a match engine to perform data matching based on the current position of the data stream and the one or more prior positions of the data stream to determine a primary match result and a backward match result for the current position of the data stream. Disclosed example data compressors further include a results evaluator to determine an output match result for the current position of the data stream based on the primary match result for the current position of the data stream and a backward match result determined for a subsequent position of the data stream.

In one embodiment, an apparatus comprises a first compression engine to receive a first compressed data block from a second compression engine that is to generate the first compressed data block by compressing a first plurality of repeated instances of data that each have a length greater than or equal to a first length. The first compression engine is further to compress a second plurality of repeated instances of data of the first compressed data block that each have a length greater than or equal to a second length, the second length being shorter than the first length, wherein each compressed repeated instance of the first and second pluralities of repeated instances comprises a location and length of a data instance that is repeated. The apparatus further comprises a memory buffer to store the compressed first and second plurality of repeated instances of data.

An encoding apparatus reads text data of an encoding target, encodes each character or word in the text data of the encoding target by using a bit map type index in which an appearance position is associated with each of the encoded characters or words, appearing on the text data of the encoding target, as bit map data, and updates the bit map type index with respect to the encoded character or word.

An apparatus includes a processor that detects a match sequence that matches with a preceding partial sequence in input data, a relative position of the match sequence with respect to the partial sequence, and a match length which is a length of the match sequence; retains the relative position encoded lastly; selects one of a plurality of encoding formats based on closeness indicated by the relative position, the encoding formats being set such that the number of bits to be allocated to the relative position varies among the encoding formats; and encodes the input data by arranging codes in byte unit and omitting, depending on the encoding format selected, the relative position when the relative position is the same as the relative position encoded lastly and retained by the processor.

Technologies for flexibly compressing data include a computing device having an accelerator complex that is to receive a compression job request and schedule the compression job request for one or more hardware compression resources of the accelerator complex. The accelerator complex is further to perform the compression job request with the one or more hardware compression resources in response to scheduling the compression job request and to communicate uncompressed data and compressed data with an I/O subsystem of the computing device in response to performing the compression job request. Other embodiments are described and claimed.