Patent US2625471A successfully refreshed from Google Patents.
US4538241A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Address translation buffer
Assignee: Unisys Corp
•
Filing: 1983-07-14
•
Granted: 1985-08-27
•
Expires: 2003-07-14
Abstract
Abstract An apparatus is disclosed that translates virtual memory addresses into physical memory addresses. In particular, this apparatus comprises a plurality of rows of content addressable memory cells, a corresponding plurality of random access memory cells and another corresponding plurality of control circuits. The content addressable memory cells store the virtual memory addresses and the random access memory cells store the physical memory addresses. The control circuits are coupled to both the content addressable and the random access memory cells and are disposed for controlling the operation of the apparatus.
Inventors
- 👤 Burton L. Levin
- 👤 Andrew E. Phelps
- 👤 Hanan Potash
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-23 03:17
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/02; G06F12/08; G06F12/10; G06F12/1027
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
192 words
An apparatus for translating a selected number of a first group of numbers into another number selected from a second group of numbers, said apparatus comprising: a plurality of rows of content addressable memory means for storing said first group of numbers, including means for receiving said selected number from an external source and for providing a match signal indicating the row in which said selected number is stored; a corresponding plurality of rows of storage means for storing said second group of numbers including means for accessing the contents of the row of said storage means that corresponds to said match signal; wherein, said rows of content addressable memory and said rows of storage means are coupled together by coupling means to form respective shift registers; and a control circuit means couples to both said shift registers for rewriting said numbers from the row in both shift registers corresponding to said match signal, into the first row of both shift registers in response to said match signal and for shifting down by one row all of the numbers stored in both shift registers above the row corresponding to said match signal.
Claim 2
Independent Claim
192 words
An apparatus for translating a selected number of a first group of numbers into another number selected from a second group of numbers, said apparatus comprising: a plurality of rows of content addressable memory means for storing said first group of numbers, including means for receiving said selected number from an external source and for providing a match signal indicating the row in which said selected number is stored; a corresponding plurality of rows of storage means for storing said second group of numbers including means for accessing the contents of the row of said storage means that corresponds to said match signal; wherein, said rows of content addressable memory and said rows of storage means are coupled together by coupling means to form respective shift registers; and a control circuit means couples to both said shift registers for rewriting said numbers from the row in both shift registers corresponding to said match signal, into the first row of both shift registers in response to said match signal and for shifting down by one row all of the numbers stored in both shift registers above the row corresponding to said match signal.
Claim 3
Dependent Claim
36 words
An apparatus as in claim 1 wherein said control circuit includes means for generating a shift signal for shifting down one row all numbers stored in said apparatus above the row corresponding to said match signal.
Claim 4
Dependent Claim
31 words
An apparatus as in claim 2 wherein said control circuit includes means for inhibiting the generation of said shift signal for all rows below said row corresponding to said match signal.
Claim 5
Dependent Claim
38 words
An apparatus as in claim 1 wherein said control circuit includes means for generating an entry not present signal when a selected number is not stored in any of said plurality of rows of said content addressable memory.
Claim 6
Dependent Claim
27 words
An apparatus as in claim 1 wherein each of said rows of content addressable memory and storage means are serially coupled together by respective rows of transistors.
Claim 7
Dependent Claim
31 words
An apparatus as in claim 1 wherein each of said rows of storage means includes means for storing a valid signal indicating when said number that a row stores is valid.
Claim 8
Dependent Claim
33 words
An apparatus as in claim 1 further including a control state machine means for providing control signals to said apparatus in response to status signals from said apparatus and from external control signals.
Claim 9
Dependent Claim
16 words
An apparatus as in claim 7 wherein said control state machine includes a programmable control matrix.
Claim 10
Dependent Claim
87 words
An apparatus as in claim 1 wherein each of said rows of storage means includes means for storing a lock signal indicating when said number that a row stores should not be removed from that row, and wherein said control circuit includes means for transferring the contents of the last row of said shift registers to the first row and for shifting down by one row the contents of all rows above the last row in response to said lock signal being stored in said last row.
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) | 1988-08-26 | 1989-02-25 | 1989-08-27 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1992-08-26 | 1993-02-25 | 1993-08-27 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1996-08-26 | 1997-02-25 | 1997-08-27 | $7700.00 | Window Closed / Lapsed |