IP Library › Granted Patent US 12,099,461
Granted Patent B2
US 12,099,461 · App. 17/431,034 · Granted Sep 24, 2024

Multi-tile memory management

Inventors: Abhishek R. Appu (El Dorado Hills, CA); Altug Koker (El Dorado Hills, CA); Aravindh Anantaraman (Folsom, CA); Elmoustapha Ould-Ahmed-Vall (Chandler, AZ); Valentin Andrei (San Jose, CA); Nicolas Galoppo Von Borries (Portland, OR); Varghese George (Folsom, CA); Mike Macpherson (Portland, OR); Subramaniam Maiyuran (Gold River, CA); Joydeep Ray (Folsom, CA); Lakshminarayanan Striramassarma (Folsom, CA); Scott Janus (Loomis, CA); Brent Insko (Portland, OR); Vasanth Ranganathan (El Dorado Hills, CA); Kamal Sinha (Rancho Cordova, CA); Arthur Hunter (Cameron Park, CA); Prasoonkumar Surti (Folsom, CA); David Puffer (Tempe, AZ); James Valerio (North Plains, OR); Ankur N. Shah (Folsom, CA)
Assignee: INTEL CORPORATION
G06F15/7839G06F7/5443G06F7/575G06F7/588G06F9/3001G06F9/30014G06F9/30036G06F9/3004G06F9/30043G06F9/30047G06F9/30065G06F9/30079G06F9/3887G06F9/5011G06F9/5077G06F12/0215G06F12/0238G06F12/0246G06F12/0607G06F12/0802G06F12/0804G06F12/0811G06F12/0862G06F12/0866G06F12/0871G06F12/0875G06F12/0882G06F12/0888G06F12/0891G06F12/0893G06F12/0895G06F12/0897G06F12/1009G06F12/128G06F15/8046G06F17/16G06F17/18G06T1/20G06T1/60H03M7/46G06F9/3802G06F9/3818G06F9/3867G06F2212/1008G06F2212/1021G06F2212/1044G06F2212/302G06F2212/401G06F2212/455G06F2212/60G06N3/08G06T15/06
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,099,461
App. No.
17/431,034
Granted
Sep 24, 2024
Kind
B2
Abstract

Methods and apparatus relating to techniques for multi-tile memory management. In an example, an apparatus comprises a cache memory, a high-bandwidth memory, a shader core communicatively coupled to the cache memory and comprising a processing element to decompress a first data element extracted from an in-memory database in the cache memory and having a first bit length to generate a second data element having a second bit length, greater than the first bit length, and an arithmetic logic unit (ALU) to compare the data element to a target value provided in a query of the in-memory database. Other embodiments are also disclosed and claimed.

Claims (29)

1. An apparatus comprising:

a cache memory;

a high-bandwidth memory;

a shader core communicatively coupled to the cache memory and comprising a processing element to decompress a first data element extracted from an in-memory database in the cache memory and having a first bit length to generate a second data element having a second bit length, greater than the first bit length; and

an arithmetic logic unit (ALU) to compare the data element to a target value provided in a query of the in-memory database.

2. The apparatus of claim 1 , wherein shader core is to decompress the first data element from a bit length less than bits to a bit length of 8 bits.

3. The apparatus of claim 1 , wherein the shader core is to decompress the first data element from a bit length between 9 bits and 15 bits to a bit length of 16 bits.

4. The apparatus of claim 1 , wherein the shader core is to decompress the first data element from a bit length between 17 bits and 31 bits to a bit length of 32 bits.

5. The apparatus of claim 1 , wherein the shader core is to decompress the first data element from a bit length between 33 bits and 63 bits to a bit length of 64 bits.

6. The apparatus of claim 1 , wherein the arithmetic logic unit (ALU) is to perform a vector compare operation at the second bit length.

7. The apparatus of claim 6 , wherein the arithmetic logic unit (ALU) is to write a result of the vector compare operation as a bit vector.

8. A method comprising:

decompressing, in processing element of a shader core communicatively coupled to a cache memory, a first data element extracted from an in-memory database in the cache memory and having a first bit length to generate a second data element having a second bit length, greater than the first bit length; and

forwarding the second data element to an arithmetic logic unit (ALU) for comparison to a target value provided in a query of the in-memory database.

9. The method of claim 8 , wherein shader core is to decompress the first data element from a bit length less than bits to a bit length of 8 bits.

10. The method of claim 8 , wherein the shader core is to decompress the first data element from a bit length between 9 bits and 15 bits to a bit length of 16 bits.

11. The method of claim 8 , wherein the shader core is to decompress the first data element from a bit length between 17 bits and 31 bits to a bit length of 32 bits.

12. The method of claim 8 , wherein the shader core is to decompress the first data element from a bit length between 33 bits and 63 bits to a bit length of 64 bits.

13. The method of claim 8 , wherein the arithmetic logic unit (ALU) is to perform a vector compare operation at the second bit length.

14. The method of claim 13 , wherein the arithmetic logic unit (ALU) is to write a result of the vector compare operation as a bit vector.

15. A non-transitory computer-readable medium comprising one or more instructions that when executed on at least one processor configure the at least one processor to perform one or more operations to:

decompress, in processing element of a shader core communicatively coupled to a cache memory, a first data element extracted from an in-memory database in the cache memory and having a first bit length to generate a second data element having a second bit length, greater than the first bit length; and

forward the second data element to an arithmetic logic unit (ALU) for comparison to a target value provided in a query of the in-memory database.

16. The computer-readable medium of claim 15 , wherein shader core is to decompress the first data element from a bit length less than bits to a bit length of 8 bits.

17. The computer-readable medium of claim 15 , wherein the shader core is to decompress the first data element from a bit length between 9 bits and 15 bits to a bit length of 16 bits.

18. The computer-readable medium of claim 15 , wherein the shader core is to decompress the first data element from a bit length between 17 bits and 31 bits to a bit length of 32 bits.

19. The computer-readable medium of claim 15 , wherein the shader core is to decompress the first data element from a bit length between 33 bits and 63 bits to a bit length of 64 bits.

20. The computer-readable medium of claim 15 , wherein the arithmetic logic unit (ALU) is to perform a vector compare operation at the second bit length.

21. The computer-readable medium of claim 15 , wherein the arithmetic logic unit (ALU) is to write a result of the vector compare operation as a bit vector.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 13, 2021
From: APPU, ABHISHEK R.; KOKER, ALTUG; ANANTARAMAN, ARAVINDH; OULD-AHMED-VALL, ELMOUSTAPHA; ANDREI, VALENTIN; GALOPPO VON BORRIES, NICOLAS; GEORGE, VARGHESE; MACPHERSON, MIKE; MAIYURAN, SUBRAMANIAM; RAY, JOYDEEP; STRIRAMASSARMA, LAKSHMINARAYANAN; JANUS, SCOTT; INSKO, BRENT E.; RANGANATHAN, VASANTH; SINHA, KAMAL; HUNTER, ARTHUR; SURTI, PRASOONKUMAR; PUFFER, DAVID; VALERIO, JAMES; SHAH, ANKUR N.
To: INTEL CORPORATION
Reel/Frame 057184/0156 →
Continuity (4)
Provisional Application 62819337 · Mar 15, 2019
Provisional Application 62819435 · Mar 15, 2019
Provisional Application 62819361 · Mar 15, 2019
Related Publication 20220121421A1 · Apr 21, 2022