×

Set-associative cache memory having variable time decay rewriting algorithm

  • US 6,732,238 B1
  • Filed: 06/10/2002
  • Issued: 05/04/2004
  • Est. Priority Date: 06/08/2001
  • Status: Expired due to Fees
First Claim
Patent Images

1. A method of updating replacement information in a cache memory having a plurality of entries, the entries arranged in a plurality of ways, the method comprising:

  • determining whether a variable time decay (VTD) field of each of the plurality of entries, including an entry corresponding to a way just accessed, have all fully decayed;

    if all VTD fields have fully decayed, setting the VTD fields of all entries except the entry of the way just accessed to an undecayed state; and

    if all VTD fields are not fully decayed, decaying the VTD field of the entry of the way just accessed;

    wherein, at least two of the ways have a different number of entries.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×