Invention Grant
- Patent Title: Efficient support of sparse data structure access
- Patent Title (中): 有效支持稀疏数据结构访问
-
Application No.: US13995209Application Date: 2011-12-29
-
Publication No.: US09037804B2Publication Date: 2015-05-19
- Inventor: Simon C. Steely, Jr. , William C. Hasenplaugh , Joel S. Emer
- Applicant: Simon C. Steely, Jr. , William C. Hasenplaugh , Joel S. Emer
- Applicant Address: US CA Santa Clara
- Assignee: Intel Corporation
- Current Assignee: Intel Corporation
- Current Assignee Address: US CA Santa Clara
- Agency: Kenyon & Kenyon, LLP
- International Application: PCT/US2011/067839 WO 20111229
- International Announcement: WO2013/101060 WO 20130704
- Main IPC: G06F13/00
- IPC: G06F13/00 ; G06F12/08

Abstract:
Method and apparatus to efficiently organize data in caches by storing/accessing data of varying sizes in cache lines. A value may be assigned to a field indicating the size of usable data stored in a cache line. If the field indicating the size of the usable data in the cache line indicates a size less than the maximum storage size, a value may be assigned to a field in the cache line indicating which subset of the data in the field to store data is usable data. A cache request may determine whether the size of the usable data in a cache line is equal to the maximum data storage size. If the size of the usable data in the cache line is equal to the maximum data storage size the entire stored data in the cache line may be returned.
Public/Granted literature
- US20130297883A1 EFFICIENT SUPPORT OF SPARSE DATA STRUCTURE ACCESS Public/Granted day:2013-11-07
Information query