Technologies for performing speculative decompression
AssigneeIntel Corporation
InventorsVinodh Gopal, James D. Guilford, Kirk S. Yap
Life of this patent
Estimating the term…
Abstract
Technologies for performing speculative decompression include a managed node to decode a variable size code at a present position in compressed data with a deterministic decoder and concurrently perform speculative decodes over a range of subsequent positions in the compressed data, determine the position of the next code, determine whether the position of the next code is within the range, and output, in response to a determination that the position of the next code is within the range, a symbol associated with the deterministically decoded code and another symbol associated with a speculatively decoded code at the position of the next code.
Claims25
A managed node for speculatively decompressing data, the managed node comprising:
- a deterministic decoder;
- one or more speculative decoders;
- and
- a decompression manager to:
- decode a variable size code at a present position in compressed data with the deterministic decoder and concurrently perform speculative decodes over a range of subsequent positions in the compressed data with the one or more speculative decoders, wherein the range of subsequent positions are determined as a function of the present position and a determined smallest code size;
- determine a position of a next code by adding a size of the deterministically decoded code to the present position;
- determine whether the position of the next code is within the range;
- and
- output, in response to a determination that the position of the next code is within the range, a first symbol associated with the deterministically decoded code and a second symbol associated with a speculatively decoded code at the position of the next code.
One or more non-transitory, machine-readable storage media comprising a plurality of instructions stored thereon that, when executed by a managed node, cause the managed node to:
- decode a variable size code at a present position in compressed data with a deterministic decoder and concurrently perform speculative decodes over a range of subsequent positions in the compressed data with one or more speculative decoders, wherein the subsequent positions are determined as a function of the present position and a determined smallest code size;
- determine a position of a next code by adding a size of the deterministically decoded code to the present position;
- determine whether the position of the next code is within the range;
- and
- output, in response to a determination that the position of the next code is within the range, a first symbol associated with the deterministically decoded code and a second symbol associated with a speculatively decoded code at the position of the next code.
A method for speculatively decompressing data, the method comprising:
- decoding, by a managed node, a variable size code at a present position in compressed data with a deterministic decoder and concurrently performing speculative decodes over a range of subsequent positions in the compressed data with one or more speculative decoders, wherein the range of subsequent positions are determined as a function of the present position and a determined smallest code size;
- determining, by the managed node, a position of a next code by adding a size of the deterministically decoded code to the present position;
- determining, by the managed node, whether the position of the next code is within the range;
- and
- outputting, by the managed node and in response to a determination that the position of the next code is within the range, a first symbol associated with the deterministically decoded code and a second symbol associated with a speculatively decoded code at the position of the next code.
Dependencies are inferred from the claim text.