Back to results
US 2021/0200680 A1Published application
Cache dynamic random access memory
AssigneeRambus Inc.
InventorsThomas Vogelsang, Frederick A. Ware, Michael Raymond Miller, Collins Williams
Life of this patent
Estimating the term…
Abstract
Disclosed is a dynamic random access memory that has columns, data rows, tag rows and comparators. Each comparator compares address bits and tag information bits from the tag rows to determine a cache hit and generate address bits to access data information in the DRAM as a multiway set associative cache.
Claims20
A dynamic random access memory (DRAM), comprising:
- DRAM having a plurality of columns, a plurality of data rows and a plurality of tag rows;
- and
- a plurality of comparators each to compare a first plurality of address bits and a first plurality of tag information bits from the plurality of tag rows to determine a cache hit and generate a second plurality of address bits to access data information in the DRAM as a multiway set associative cache, in a plurality of banks of the DRAM.
A set associative cache dynamic random access memory (DRAM), comprising:
- a plurality of banks, each bank comprising a plurality of mats, each mat comprising a plurality of DRAM cells in rows and columns;
- a majority of the rows comprising rows for data as data rows, a minority of the rows comprising rows for tags, as tag rows;
- and
- a plurality of comparators each having as inputs a first plurality of address bits and a first plurality of tag information bits from the tag rows to be compared to find a cache hit and generate a second plurality of address bits to access the data information in the DRAM as one of a plurality of ways of the set associative cache.
1 more element
A method of operating a set associative cache dynamic random access memory (DRAM), comprising:
- presenting a plurality of address bits of a set in the DRAM to each of a plurality of comparators in or adjacent to banks of the DRAM, wherein each bank has data rows and tag rows;
- comparing, in parallel in the plurality of comparators, the plurality of address bits and a first plurality of tag information bits from the tag rows to determine a cache hit;
- determining, based on the comparing, a second plurality of address bits;
- and
- reading from the data rows, based on the cache hit and the second plurality of address bits.
2 more elements
Dependencies are inferred from the claim text.