Use of non-count data and index hashing to reduce false hits in a non-tagged, n-way cache
US6622209B2 · kind B2 · utility
2Cited by
14References
8Claims
0Family size
Assignee
Inventor
Key dates
| Filing date | Sep 30, 2002 |
| Grant date | Sep 16, 2003 |
| Priority date | — |
| Expiry date | Sep 30, 2022 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F12/0864
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
In one embodiment of the invention, data values which are provided to a non-tagged, n-way cache are written into the cache in a non-count form. Whereas a counter tends to quickly saturate to one extreme or the other (e.g., all zeros or all ones), or briefly take on a value which approaches an extreme, a non-count data value (e.g., branch prediction history bits) tends to assume a wider variety of values.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.