US5325507A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Translation lookaside buffer shutdown scheme
Assignee: MIPS Tech LLC
•
Filing: 1993-02-18
•
Granted: 1994-06-28
•
Expires: 2013-02-18
Abstract
Abstract An apparatus for temporarily disabling a translation lookaside buffer in a computer system upon the occurrence of certain predefined system conditions. Such conditions may be of a first type which have been predetermined to indicate a greater risk that two or more virtual addresses stored in the TLB will simultaneously match the incoming virtual address, and/or of a second type in which access to the TLB is not needed. An example of the first type is a reference to an unmapped segment of memory. An example of the second type is the processing of a non-memory-access instruction. The apparatus may further include failsafe circuitry to shut down the TLB if at least a given number of matches occur at any time and for any reason, the given number being greater than 1. The apparatus prevents loss of data or damage to the chip where match comparisons are performed in parallel.
Inventors
- 👤 Danny L. Freitas
- 👤 Craig C. Hansen
- 👤 Christopher Rowen
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 06:08
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/0703; G06F11/0706; G06F11/073; G06F11/004; G06F11/0751; G06F12/00; G06F12/02; G06F12/08; G06F12/10; G06F12/1027; G06F12/1045; G06F11/0754; G06F11/076
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
174 words
A content addressable memory apparatus comprising: a plurality of tag registers; a plurality of data registers, each data register having an output enable for enabling contents of the data register onto an output bus; means for loading information into a first one of the tag registers independently of contents of a second one of the tag registers; a plurality of comparators, each of the comparators corresponding with a respective one of the tag registers and generating a match signal indicative of whether contents of the respective one of the tag registers matches an incoming tag signal; first detection means for activating a multiple match signal when at least a given number of the comparators generate match signals indicating contents of respective ones of the tag registers match the incoming tag signal, the given number being greater than one; and means for coupling each of the match signals to a respective one of the output enables, the means for coupling to all of the output enables being inhibited if the multiple match signal is active.
Claim 2
Dependent Claim
174 words
A content addressable memory apparatus comprising: a plurality of tag registers; a plurality of data registers, each data register having an output enable for enabling contents of the data register onto an output bus; means for loading information into a first one of the tag registers independently of contents of a second one of the tag registers; a plurality of comparators, each of the comparators corresponding with a respective one of the tag registers and generating a match signal indicative of whether contents of the respective one of the tag registers matches an incoming tag signal; first detection means for activating a multiple match signal when at least a given number of the comparators generate match signals indicating contents of respective ones of the tag registers match the incoming tag signal, the given number being greater than one; and means for coupling each of the match signals to a respective one of the output enables, the means for coupling to all of the output enables being inhibited if the multiple match signal is active.
Claim 3
Dependent Claim
39 words
The content addressable memory apparatus according to claim 1, wherein the first detection means operates in an analog fashion, and wherein the given number is at least equal to a number needed to exceed a threshold of electrical noise.
Claim 4
Dependent Claim
86 words
The content addressable memory apparatus according to claim 1, further comprising a second detection means for activating a first signal if a first system condition is present, a probability that contents of at least two of the tag registers will match the incoming tag signal having been predetermined to be greater when the first system condition is present than when the first system condition is not present; the means for coupling to all of the output enables being further inhibited if the first signal is active.
Claim 5
Dependent Claim
57 words
The content addressable memory apparatus according to claim 1, further comprising a third detection means for activating a second signal if a second system condition exists, the second system condition existing only when no address translation is required; the means for coupling to all of the output enables being further inhibited if the second signal is active.
Claim 6
Dependent Claim
121 words
The content addressable memory apparatus according to claim 1, further comprising: a second detection means for activating a first signal if a first system condition is present, a probability that the contents of at least two of the tag registers will match the incoming tag signal having been predetermined to be greater when the first system condition is present than when the first system condition is not present; and a third detection means for activating a second signal if a second system condition exists, the second system condition existing only when no address translation is required; the means for coupling to all of the output enables being further inhibited if the first signal is active or the second signal is active.
Claim 7
Dependent Claim
182 words
A content addressable memory apparatus comprising: a plurality of tag registers; a plurality of data registers, each data register having an output enable for enabling contents of the data register onto an output bus; means for loading information into a first one of the tag registers independently of contents of a second one of the rag registers; a plurality of comparators, each of the comparators corresponding with a respective one of the tag registers and generating a match signal indicative of whether contents of the respective one of the tag registers matches an incoming tag signal; first detection means for activating a multiple match signal when at least a given number of the comparators generate match signals indicating contents of respective ones of the tag registers match the incoming tag signal, the given number being greater than one; and means for coupling each of the match signals to a respective one of the output enables, the means for coupling to all of the output enables except a preselected one of the output enables being inhibited if the multiple match signal is active.
Claim 8
Dependent Claim
182 words
A content addressable memory apparatus comprising: a plurality of tag registers; a plurality of data registers, each data register having an output enable for enabling contents of the data register onto an output bus; means for loading information into a first one of the tag registers independently of contents of a second one of the rag registers; a plurality of comparators, each of the comparators corresponding with a respective one of the tag registers and generating a match signal indicative of whether contents of the respective one of the tag registers matches an incoming tag signal; first detection means for activating a multiple match signal when at least a given number of the comparators generate match signals indicating contents of respective ones of the tag registers match the incoming tag signal, the given number being greater than one; and means for coupling each of the match signals to a respective one of the output enables, the means for coupling to all of the output enables except a preselected one of the output enables being inhibited if the multiple match signal is active.
Claim 9
Dependent Claim
39 words
The content addressable memory apparatus according to claim 6, wherein the first detection means operates in an analog fashion, and wherein the given number is at least equal to a number needed to exceed a threshold of electrical noise.
Claim 10
Dependent Claim
93 words
The content addressable memory apparatus according to claim 6, further comprising a second detection means for activating a first signal if a first system condition is present, a probability that contents of at least two of the tag registers will match the incoming tag signal having been predetermined to be greater when the first system condition is present than when the system condition is not present; the means for coupling to all of the output enables except the preselected one of the output enables being further inhibited if the first signal is active.
Claim 11
Dependent Claim
65 words
The content addressable memory apparatus according to claim 6, further comprising a third detection means for activating a second signal if a second system condition exists, the second system condition existing only when no address translation is required; the means for coupling to all of the output enables except the preselected one of the output enables being further inhibited if the second signal is active.
Claim 12
Dependent Claim
129 words
The content addressable memory apparatus according to claim 6, further comprising: a second detection means for activating a first signal if a first system condition is present, a probability that the contents of at least two of the tag registers will match the incoming tag signal having been predetermined to be greater when the first system condition is present than when the first system condition is not present; and a third detection means for activating a second signal if a second system condition exists, the second system condition existing only when no address translation is required; the means for coupling to all of the output enables except the preselected one of the output enables being further inhibited if the first signal is active or the second signal is active.
References Cited (Backward Citations)
US3723976A
Cited
US3800286A
Cited
US3979726A
Cited
US4190885A
Cited
US4232968A
Cited
US4268907A
Cited
US4298929A
Cited
US4264953A
Cited
US4392200A
Cited
US4370710A
Cited
US4363095A
Cited
US4439829A
Cited
US4467717A
Cited
EP0127008A2
Cited
US4740889A
Cited
US4812969A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-06-27 | 1997-12-27 | 1998-06-28 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-06-27 | 2001-12-27 | 2002-06-28 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-06-27 | 2005-12-27 | 2006-06-28 | $7700.00 | Window Closed / Lapsed |