As part of bypass decoding syntax elements for a set of coefficients in response to reaching a maximum number of regular coded bins, a video decoder is configured to receive a prefix value for a transform coefficient; decode the prefix value using Golomb-Rice coding; in response to a length of the prefix value being equal to a threshold value, receive a suffix value for the transform coefficient; decode the suffix value using exponential Golomb coding; and determine a level value for the transform coefficient based on the decoded prefix value and the decoded suffix value.

A train-linking lossless data compressor examines a block of data and uses a same coder to generate a same code when all data values in the input block are identical. When the input data is not all the same value, then a Gaussian coder, a Laplace coder, and a delta coder are activated in parallel. The three compressed code lengths are compared and the smallest code length is output as the compressed code when it is smaller than a copy code length. The copy code is a tag followed by copying all the data in the input block. When the smallest of the three compressed code lengths is larger than the copy code length, the file is not compressible, and the copy code is output. No frequency table is required so latency is low. The delta coder subtracts data values from an average value of the last data block.

Embodiments are generally directed apparatuses, methods, techniques and so forth determine an access level of operation based on an indication received via one or more network links from a pod management controller, and enable or disable a firmware update capability for a firmware device based on the access level of operation, the firmware update capability to change firmware for the firmware device. Embodiments may also include determining one or more configuration settings of a plurality of configuration settings to enable for configuration based on the access level of operation, and enable configuration of the one or more configuration settings.

As part of bypass decoding syntax elements for a set of coefficients in response to reaching a maximum number of regular coded bins, a video decoder is configured to receive a prefix value for a transform coefficient; decode the prefix value using Golomb-Rice coding; in response to a length of the prefix value being equal to a threshold value, receive a suffix value for the transform coefficient; decode the suffix value using exponential Golomb coding; and determine a level value for the transform coefficient based on the decoded prefix value and the decoded suffix value.

In various examples, metadata may be generated corresponding to compressed data streams that are compressed according to serial compression algorithms—such as arithmetic encoding, entropy encoding, etc.—in order to allow for parallel decompression of the compressed data. As a result, modification to the compressed data stream itself may not be required, and bandwidth and storage requirements of the system may be minimally impacted. In addition, by parallelizing the decompression, the system may benefit from faster decompression times while also reducing or entirely removing the adoption cycle for systems using the metadata for parallel decompression.

A database management system is described that can encode data to generate a plurality of data vectors. The database management system can perform the encoding by using a dictionary. The database management system can adaptively reorder the plurality of data vectors to prepare for compression of the plurality of data vectors. During a forward pass of the adaptive reordering, most frequent values of a data vector of the plurality of data vectors can be moved-up in the data vector. During a backward pass of the adaptive reordering, content within a rest range of a plurality of rest ranges can be rearranged within the plurality of data vectors according to frequencies of the content. The reordering according to frequency can further sort the rest range by value. Related apparatuses, systems, methods, techniques, computer programmable products, computer readable media, and articles are also described.

Technologies for dynamically managing resources in disaggregated accelerators include an accelerator. The accelerator includes acceleration circuitry with multiple logic portions, each capable of executing a different workload. Additionally, the accelerator includes communication circuitry to receive a workload to be executed by a logic portion of the accelerator and a dynamic resource allocation logic unit to identify a resource utilization threshold associated with one or more shared resources of the accelerator to be used by a logic portion in the execution of the workload, limit, as a function of the resource utilization threshold, the utilization of the one or more shared resources by the logic portion as the logic portion executes the workload, and subsequently adjust the resource utilization threshold as the workload is executed. Other embodiments are also described and claimed.

Herein are fine grained updates to pieces of JavaScript object notation (JSON) documents by database statements that can update, delete, and insert parts of JSON documents. In an embodiment, a computer receives a request that specifies a modification of a JSON document that is stored in a compressed format in persistent storage. The modification adds additional content to the JSON document, and/or replaces an old value in the JSON document with a new value that is not a same size as the old value. The modification is recorded in a change log. The change log is eventually applied to the compressed format of the JSON document in the persistent storage without entirely rewriting the compressed format of the JSON document in the persistent storage.

An image compression method and an image compressor are provided. The image compression method compresses the image data based on the fixed-length code (FLC) to generate the compressed data, and includes the following steps: determining whether a characteristic value of the image data meets a condition; encoding only the luminance component of the image data to generate the compressed data when the characteristic value meets the condition; encoding the luminance and chrominance components of the image data to generate the compressed data when the characteristic value does not meet the condition; and storing the compressed data.

A data compression technique involves: selecting, from a data block, a plurality of bit strings as sample data. The technique further involves: determining a set of characters included in the sample data. Each character in the set of characters is represented by at least one bit string among the plurality of bit strings. The technique further involves: compressing the data block if statistical characteristics of the set of characters match predetermined statistical characteristics. Accordingly, incompressible data can be filtered out efficiently and accurately, so as to utilize computing resources more efficiently.