Patent US5553264A successfully refreshed from Google Patents.
US5553264A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for efficient cache refilling by the use of forced cache misses
Assignee: Enterasys Networks Inc
•
Filing: 1994-06-24
•
Granted: 1996-09-03
•
Expires: 2014-06-24
Abstract
Abstract In the present invention, one of the bits in the tag value in the cache is hard-wired, for example, to 0, at such a position in the cache that that bit is always set to 0 when a tag is stored in the cache (or forced to 0 when a tag is read from the cache). Instructions executed by the processor can specify a read outside the cache, i.e. of the most recent data written to the main memory by some DMA agent, by specifying a read address with the designated bit equal to one. In this way, a cache miss is forced, allowing the processor to read the most recent data from the main memory of the system and to cache the data. As the cache is refilled from the main memory, the hard-wired tag bit of course remains set to zero. So later processor instructions that read data within the same cache refill block would use the normal address of that data (having the designated bit set to zero). These subsequent reads will not force a cache miss. Instructions executed by the processor can flush the cache by reading a sequence of addresses in which the designated tag bit is one. Since the designated bit is 0 in all cache tags, there will be misses on all words, so the entire cache will be filled from the main memory.
Inventors
- 👤 Cuneyt M. Ozveren
- 👤 Robert J. Walsh
- 👤 Greg Waters
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 23:30
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/02; G06F12/08; G06F12/0802; G06F12/0806; G06F12/0808
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
138 words
An apparatus for forcing a cache miss, comprising: a CPU having a comparator means; a main memory linked to said CPU; a cache memory having a cache address, said cache address having a first plurality of fields where at least one of said first plurality of fields is set to a fixed value; and, address means of said CPU for specifying a read address, said read address having a second plurality of fields, said address means specifying said at least one said of second plurality of fields a comparison value, said comparator means of said CPU compares said fixed value with said comparison value, said CPU reads data from said cache memory if said fixed value equals said comparison value, said CPU reads data from said main memory if said fixed value does not equal said comparison value.
Claim 2
Independent Claim
138 words
An apparatus for forcing a cache miss, comprising: a CPU having a comparator means; a main memory linked to said CPU; a cache memory having a cache address, said cache address having a first plurality of fields where at least one of said first plurality of fields is set to a fixed value; and, address means of said CPU for specifying a read address, said read address having a second plurality of fields, said address means specifying said at least one said of second plurality of fields a comparison value, said comparator means of said CPU compares said fixed value with said comparison value, said CPU reads data from said cache memory if said fixed value equals said comparison value, said CPU reads data from said main memory if said fixed value does not equal said comparison value.
Claim 3
Dependent Claim
13 words
An apparatus as claimed in claim 1, wherein said fixed value is zero.
Claim 4
Dependent Claim
42 words
An apparatus as claimed in claim 1, wherein said address means further includes a cache flushing means, said cache flushing means providing said CPU with a sequence of main memory addresses, said CPU flushing said cache upon reading said sequence of addresses.
Claim 5
Independent Claim
137 words
A method for forcing a cache miss, comprising the steps of: setting at least one of a plurality of fields of a cache address of said cache memory to a fixed value; executing instructions in a CPU, wherein the instructions specify a memory read address, said memory read address having a plurality of memory address fields, setting by said instructions at least one of said memory address fields to a comparison value; comparing said fixed value in said fields of said cache memory address with said comparison value in said memory address fields by a comparator in said CPU; reading data from said cache memory in response to said comparison value equalling said fixed value; and, reading data from a main memory linked to said CPU in response to said comparison value not equalling said fixed value.
Claim 6
Independent Claim
137 words
A method for forcing a cache miss, comprising the steps of: setting at least one of a plurality of fields of a cache address of said cache memory to a fixed value; executing instructions in a CPU, wherein the instructions specify a memory read address, said memory read address having a plurality of memory address fields, setting by said instructions at least one of said memory address fields to a comparison value; comparing said fixed value in said fields of said cache memory address with said comparison value in said memory address fields by a comparator in said CPU; reading data from said cache memory in response to said comparison value equalling said fixed value; and, reading data from a main memory linked to said CPU in response to said comparison value not equalling said fixed value.
Claim 7
Dependent Claim
11 words
The method of claim 4, wherein said fixed value is zero.
Claim 8
Dependent Claim
30 words
The method of claim 4, further comprising: executing instructions in said CPU specifying a sequence of main memory addresses, said CPU flushing said cache upon reading said sequence of addresses.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-09-03 | 2000-03-04 | 2000-09-03 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-09-03 | 2004-03-04 | 2004-09-03 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-09-03 | 2008-03-04 | 2008-09-03 | $7700.00 | Window Closed / Lapsed |