A storage device utilizing internal compression codecs may reduce the overall amount of data required for storage within the memory devices, increasing storage device life spans and available storage space. Data provided to the storage device is compressed prior to storage and decompressed upon retrieval. The data may be formatted at a fixed length to streamline compression processing. The processing time of the compression codecs may be minimized through the use of hardware-based resources when needed. These compression codec storage devices may include one or more communication channels suitable for connection with a host, memory devices within a memory array, and controllers configured to transfer host data from the host-computing device to the memory array. Internal compression codecs can be configured to retrieve host data from one or more buffers, compress the host data with a fixed-input compression method, and store the compressed data within one or more memory devices.

A compute device to manage workflow to disaggregated computing resources is provided. The compute device comprises a compute engine receive a workload processing request, the workload processing request defined by at least one request parameter, determine at least one accelerator device capable of processing a workload in accordance with the at least one request parameter, transmit a workload to the at least one accelerator device, receive a work product produced by the at least one accelerator device from the workload, and provide the work product to an application.

A system is disclosed for providing low data rate broadcast services. Different types of broadcast packets are detected among data packets received an external network. The different types broadcast packets contain different a different broadcast content. When a particular type of broadcast packet is detected, a transmit data rate is selected and Walsh codes are assigned for achieving the transmit data rate. Data packets corresponding to the broadcast packets are compressed, and at least one RLC block containing the compressed data packets is created. The RLC blocks are transmitted from a satellite using the assigned Walsh codes.

A lossless data compressor of an aspect includes a first lossless data compressor circuitry coupled to receive input data. The first lossless data compressor circuitry is to apply a first lossless data compression approach to compress the input data to generate intermediate compressed data. The apparatus also includes a second lossless data compressor circuitry coupled with the first lossless data compressor circuitry to receive the intermediate compressed data. The second lossless data compressor circuitry is to apply a second lossless data compression approach to compress at least some of the intermediate compressed data to generate compressed data. The second lossless data compression approach different than the first lossless data compression approach. Lossless data decompressors are also disclosed, as are methods of lossless data compression and decompression.

Methods, systems, and computer programs for compressing nucleic acid sequence data. A method can include obtaining nucleic acid sequence data representing: (i) a read sequence, and (ii) a plurality of quality scores, determining whether the read sequence includes at least one “N” base, based on a determination that the read sequence includes at least one “N” base, generating, by one or more computers, a first encoding data set by using a first encoding process to encode each set of four quality scores of the read sequence into a single byte of memory, and using a second encoding process to encode the first encoded data set, thereby compressing the data to be compressed.

Techniques are provided herein for more efficiently storing images that have a common subject, such as product images that share the same product in the image. Each image undergoes an adaptive tiling procedure to split the image into a plurality of tiles, with each tile identifying a region of the image having pixels with the same content. The tiles across multiple images can then be clustered together and those tiles having identical content are removed. Once all duplicate tiles have been removed from the set of all tiles across the images, the tiles are once again clustered based on their encoding scheme and certain encoding parameters. Tiles within each cluster are compressed using the best compression technique for the tiles in each corresponding cluster. By removing duplicative tile content between numerous images of the same subject, the total amount of data that needs to be stored is reduced.

A system and method for concurrent encryption and lossless compression of data with an algorithm executing on a computer platform. The lossless compression component of the algorithm consists of preprocessing the data with a Burrows-Wheeler transformation followed by an inversion ranking transformation in advance of employing an entropy coder, such as binary arithmetic coder. The frequency vector of the Inversion Ranking transformation is then encrypted and transmitted along with the compressed data with only the frequency vector encrypted. Since the frequency vector is required for decompression, no further encryption of the compressed data is necessary to secure the compressed file.

Embodiments include performing decompression of a file. Aspects include receiving a compressed input stream for the file and processing the compressed input stream, by two or more pipelines in parallel, to create an output vector, wherein each pipeline includes a first decoder and a second decoder. Aspects also include writing, by each of the two or more pipelines, entries onto a scratchpad in an order defined by the output vector and writing one or more entries from the scratchpad to a main history buffer based on a determination that a validity field of the one or more entries has a value of true.

A compute device to manage workflow to disaggregated computing resources is provided. The compute device comprises a compute engine receive a workload processing request, the workload processing request defined by at least one request parameter, determine at least one accelerator device capable of processing a workload in accordance with the at least one request parameter, transmit a workload to the at least one accelerator device, receive a work product produced by the at least one accelerator device from the workload, and provide the work product to an application.

Technologies for an accelerator interface over Ethernet are disclosed. In the illustrative embodiment, a network interface controller of a compute device may receive a data packet. If the network interface controller determines that the data packet should be pre-processed (e.g., decrypted) with a remote accelerator device, the network interface controller may encapsulate the data packet in an encapsulating network packet and send the encapsulating network packet to a remote accelerator device on a remote compute device. The remote accelerator device may pre-process the data packet (e.g., decrypt the data packet) and send it back to the network interface controller. The network interface controller may then send the pre-processed packet to a processor of the compute device.