US5946718A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Shadow translation look-aside buffer and method of operation
Assignee: VIA Cyrix Inc
•
Filing: 1997-05-30
•
Granted: 1999-08-31
•
Expires: 2017-05-30
Abstract
Abstract For use in an x86-compatible processor having a physically-addressable cache and a primary translation look-aside buffer (primary TLB) that translates logical addresses into physical addresses for addressing the cache, a circuit and method for increasing a translation speed of the primary TLB and a computer system employing the circuit or the method. In one embodiment, the circuit includes a shadow TLB, located proximate the cache, that contains a copy of physical addresses stored in the primary TLB, the physical addresses retrievable from the shadow TLB thereby avoiding logic circuitry interposed between the primary TLB and the cache.
Inventors
- 👤 Daniel W. Green
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 21:26
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/02; G06F12/08; G06F12/10; G06F12/1027
Claims Analysis
Total Claims: 25
Claim 1
Independent Claim
79 words
For use in a processor having a physically-addressable cache and a primary translation look-aside buffer (primary TLB) that translates logical addresses into physical addresses for addressing said cache, a circuit for increasing a translation speed of said primary TLB, comprising: a shadow TLB, located proximate said cache, that contains a copy of physical addresses stored in said primary TLB, said physical addresses retrievable from said shadow TLB thereby avoiding logic circuitry interposed between said primary TLB and said cache.
Claim 2
Dependent Claim
79 words
For use in a processor having a physically-addressable cache and a primary translation look-aside buffer (primary TLB) that translates logical addresses into physical addresses for addressing said cache, a circuit for increasing a translation speed of said primary TLB, comprising: a shadow TLB, located proximate said cache, that contains a copy of physical addresses stored in said primary TLB, said physical addresses retrievable from said shadow TLB thereby avoiding logic circuitry interposed between said primary TLB and said cache.
Claim 3
Dependent Claim
23 words
The circuit as recited in claim 1 wherein said cache includes a tag array having multiple ones of said shadow TLB interleaved therein.
Claim 4
Dependent Claim
30 words
The circuit as recited in claim 2 wherein said cache is divided into separate, physically-addressable sectors and said tag array further has tag registers corresponding to each of said sectors.
Claim 5
Dependent Claim
37 words
The circuit as recited in claim 2 wherein said tag array further has at least one tag register and comparison circuitry that compares said multiple ones of said shadow TLB with said at least one tag register.
Claim 6
Dependent Claim
80 words
For use in a processor having a physically-addressable cache and a primary translation look-aside buffer (primary TLB) that translates logical addresses into physical addresses for addressing said cache, a circuit for increasing a translation speed of said primary TLB, comprising: shadow TLB means, located proximate said cache, for containing a copy of physical addresses stored in said primary TLB, said physical addresses retrievable from said shadow TLB means thereby avoiding logic circuitry interposed between said primary TLB and said cache.
Claim 7
Dependent Claim
80 words
For use in a processor having a physically-addressable cache and a primary translation look-aside buffer (primary TLB) that translates logical addresses into physical addresses for addressing said cache, a circuit for increasing a translation speed of said primary TLB, comprising: shadow TLB means, located proximate said cache, for containing a copy of physical addresses stored in said primary TLB, said physical addresses retrievable from said shadow TLB means thereby avoiding logic circuitry interposed between said primary TLB and said cache.
Claim 8
Dependent Claim
25 words
The circuit as recited in claim 5 wherein said cache includes means for storing tags having multiple ones of said shadow TLB means interleaved therein.
Claim 9
Dependent Claim
33 words
The circuit as recited in claim 6 wherein said cache is divided into separate, physically-addressable sectors and said means for storing tags further has tag register means corresponding to each of said sectors.
Claim 10
Dependent Claim
41 words
The circuit as recited in claim 6 wherein said means for storing tags further has at least one tag register means and means for comparing said multiple ones of said shadow TLB means with said at least one tag register means.
Claim 11
Dependent Claim
83 words
For use in a processor having a physically-addressable cache and a primary translation look-aside buffer (primary TLB) that translates logical addresses into physical addresses for addressing said cache, a method of increasing a translation speed of said primary TLB, comprising the steps of: making a copy of physical addresses stored in said primary TLB in a shadow TLB located proximate said cache; and retrieving said physical addresses from said shadow TLB thereby avoiding logic circuitry interposed between said primary TLB and said cache.
Claim 12
Dependent Claim
83 words
For use in a processor having a physically-addressable cache and a primary translation look-aside buffer (primary TLB) that translates logical addresses into physical addresses for addressing said cache, a method of increasing a translation speed of said primary TLB, comprising the steps of: making a copy of physical addresses stored in said primary TLB in a shadow TLB located proximate said cache; and retrieving said physical addresses from said shadow TLB thereby avoiding logic circuitry interposed between said primary TLB and said cache.
Claim 13
Dependent Claim
33 words
The method as recited in claim 9 wherein said step of making comprises the step of making multiple copies of said physical addresses in interleaved locations in a tag array of said cache.
Claim 14
Dependent Claim
31 words
The method as recited in claim 10 wherein said cache is divided into separate, physically-addressable sectors and said tag array further has a tag register corresponding to each of said sectors.
Claim 15
Dependent Claim
42 words
The method as recited in claim 10 wherein said tag array further has at least one tag register, said method further comprising the step of comparing said multiple ones of said shadow TLB means with said at least one tag register means.
Claim 16
Dependent Claim
153 words
A computer system, comprising: (a) a pipelined processor having at least one execution pipeline for executing instructions, said execution pipeline including ID (decode), AC (address calculation), and EX (execution) processing stages; (b) system memory for storing data or instructions; (c) a physically-addressable cache for storing portions of said data or ones of said instructions; (d) a translation look-aside buffer (primary TLB) that translates logical addresses into physical addresses for addressing said cache; (e) said processor including fetch logic that fetches said portions of said data or said ones of said instructions from said system memory; and (f) said processor further including a circuit for increasing a translation speed of said primary TLB, including: (i) a shadow TLB, located proximate said cache, that contains a copy of physical addresses stored in said primary TLB, said physical addresses retrievable from said shadow TLB thereby avoiding logic circuitry interposed between said primary TLB and said cache.
Claim 17
Dependent Claim
153 words
A computer system, comprising: (a) a pipelined processor having at least one execution pipeline for executing instructions, said execution pipeline including ID (decode), AC (address calculation), and EX (execution) processing stages; (b) system memory for storing data or instructions; (c) a physically-addressable cache for storing portions of said data or ones of said instructions; (d) a translation look-aside buffer (primary TLB) that translates logical addresses into physical addresses for addressing said cache; (e) said processor including fetch logic that fetches said portions of said data or said ones of said instructions from said system memory; and (f) said processor further including a circuit for increasing a translation speed of said primary TLB, including: (i) a shadow TLB, located proximate said cache, that contains a copy of physical addresses stored in said primary TLB, said physical addresses retrievable from said shadow TLB thereby avoiding logic circuitry interposed between said primary TLB and said cache.
Claim 18
Dependent Claim
23 words
The system as recited in claim 13 wherein said cache includes a tag array having multiple ones of said shadow TLB interleaved therein.
Claim 19
Dependent Claim
30 words
The system as recited in claim 14 wherein said cache is divided into separate, physically-addressable sectors and said tag array further has tag registers corresponding to each of said sectors.
Claim 20
Dependent Claim
37 words
The system as recited in claim 14 wherein said tag array further has at least one tag register and comparison circuitry that compares said multiple ones of said shadow TLB with said at least one tag register.
Claim 21
Independent Claim
147 words
A method of operating a computer system, comprising the steps of: (a) applying power to a pipelined processor having at least one execution pipeline for executing instructions, said execution pipeline including ID (decode), AC (address calculation), and EX (execution) processing stages; (b) storing data and instructions in system memory; (c) fetching said data or said instructions from said system memory into a physically-addressable cache; (d) providing logical addresses to a translation look-aside buffer (primary TLB) to generate physical addresses to address said cache; and (e) executing said instructions in said processor, said processor further including a circuit for increasing a translation speed of said primary TLB, including: (i) a shadow TLB, located proximate said cache, that contains a copy of physical addresses stored in said primary TLB, said physical addresses retrievable from said shadow TLB thereby avoiding logic circuitry interposed between said primary TLB and said cache.
Claim 22
Independent Claim
147 words
A method of operating a computer system, comprising the steps of: (a) applying power to a pipelined processor having at least one execution pipeline for executing instructions, said execution pipeline including ID (decode), AC (address calculation), and EX (execution) processing stages; (b) storing data and instructions in system memory; (c) fetching said data or said instructions from said system memory into a physically-addressable cache; (d) providing logical addresses to a translation look-aside buffer (primary TLB) to generate physical addresses to address said cache; and (e) executing said instructions in said processor, said processor further including a circuit for increasing a translation speed of said primary TLB, including: (i) a shadow TLB, located proximate said cache, that contains a copy of physical addresses stored in said primary TLB, said physical addresses retrievable from said shadow TLB thereby avoiding logic circuitry interposed between said primary TLB and said cache.
Claim 23
Dependent Claim
23 words
The method as recited in claim 17 wherein said cache includes a tag array having multiple ones of said shadow TLB interleaved therein.
Claim 24
Dependent Claim
30 words
The method as recited in claim 18 wherein said cache is divided into separate, physically-addressable sectors and said tag array further has tag registers corresponding to each of said sectors.
Claim 25
Dependent Claim
37 words
The method as recited in claim 19 wherein said tag array further has at least one tag register and comparison circuitry that compares said multiple ones of said shadow TLB with said at least one tag register.
References Cited (Backward Citations)
US5226133A
Cited
US5819114A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-08-30 | 2003-03-01 | 2003-08-31 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-08-30 | 2007-03-01 | 2007-08-31 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-08-30 | 2011-03-01 | 2011-08-31 | $7700.00 | Window Closed / Lapsed |