Intel Corporation

Sudhakar Kamma

Abhishek R Appu

Altug Koker

Prasoonkumar Surti

Joydeep Ray

Vasanth Ranganathan

Karthik Vaidyanathan

Niranjan L Cooray

Karol A Szerszen

Eric G Liskay

Abhishek Rhisheekesan

Shashank Lakshminarayana

Rajasekhar Pantangi

Priyanka Ladda

Elmoustapha Ould-Ahmed-Vall

Subramaniam M Maiyuran

Varghese George

Nicolas C Galoppo Von Borries

Aravindh V Anantaraman

Mike MacPherson

Valentin Andrei

Jayakrishna P S

K Pattabhiraman

Methods and apparatus relating to techniques for data compression. In an example, an apparatus comprises a processor receive a data compression instruction for a memory segment; and in response to the data compression instruction, compress a sequence of identical memory values in response to a determination that the sequence of identical memory values has a length which exceeds a threshold. Other embodiments are also disclosed and claimed.

Compression techniques

An apparatus to facilitate memory data compression is disclosed. The apparatus includes a memory and having a plurality of banks to store main data and metadata associated with the main data and a memory management unit (MMU) coupled to the plurality of banks to perform a hash function to compute indices into virtual address locations in memory for the main data and the metadata and adjust the metadata virtual address locations to store each adjusted metadata virtual address location in a bank storing the associated main data.

Memory compression hashing mechanism

Examples described herein relate to a decompression engine that can request compressed data to be transferred over a memory bus. In some cases, the memory bus is a width that requires multiple data transfers to transfer the requested data. In a case that requested data is to be presented in-order to the decompression engine, a re-order buffer can be used to store entries of data. When a head-of-line entry is received, the entry can be provided to the decompression engine. When a last entry in a group of one or more entries is received, all entries in the group are presented in-order to the decompression engine. In some examples, a decompression engine can borrow memory resources allocated for use by another memory client to expand a size of re-order buffer available for use. For example, a memory client with excess capacity and a slowest growth rate can be chosen to borrow memory resources from.

Programmable re-order buffer for decompression

Growing community of inventors

El Dorado Hills, CA, United States of America

Sudhakar Kamma