Patent CH375678A successfully refreshed from Google Patents.
Patent DE212585C successfully refreshed from Google Patents.
Patent US5649140A successfully refreshed from Google Patents.
US5649140A
Expired / Lapsed
US
⏱️ 0.0 years remaining
System for use in translating virtual addresses into absolute addresses
Assignee: International Business Machines Corp
•
Filing: 1995-03-31
•
Granted: 1997-07-15
•
Expires: 2015-03-31
Abstract
Abstract In a processing system, a translation is facilitated between a virtual address and an absolute address. The system includes multiple registers and a mechanism for loading them with a first set of address translation parameters. An adder sums a translation origin register with an offset register to produce a base-plus-offset value. A logic circuit selectively combines selected registers and the base-plus-offset value to produce an address of a translation table entry which facilitates a determination of the absolute address. This determination includes performing one or more of prefixing, windowing, zoning and memory begin. A latency of the system from a presentation of the translation origin register to the adder to the output of the translation table entry from the logic circuit is at most one clock cycle.
Inventors
- 👤 Karl Jean Duvalsaint
- 👤 Mark Steven Farrell
- 👤 Barry Watson Krumm
- 👤 Donald William McCauley
- 👤 Charles Franklin Webb
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-06 15:52
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/02; G06F12/08; G06F12/10; G06F12/109
Claims Analysis
Total Claims: 16
Claim 1
Independent Claim
220 words
A system, in a processor, for use in translating a virtual address to an absolute address, said processor operating according to a clock, said system comprising: a plurality of registers wherein said plurality of registers comprises a plurality of first registers and a plurality of corresponding minus one registers, said plurality of minus one registers for storing parameter values of one less than corresponding values in the corresponding ones of said plurality of first registers; means for loading said plurality of registers with a first set of address translation parameters; an adder for adding a translation table origin ("tto") to an offset, an output of said adder comprising a base-plus-offset value; and a logic circuit coupled to and operative with said adder for determining at least a portion of an address of a translation table entry ("atte") and for performing at least one of windowing, prefixing, zoning and memory begin, said logic circuit using said base-plus-offset value and one or more of said first set of address translation parameters from said plurality of registers during said determining and said performing, wherein a latency of said system from a presentation of said tto to said adder to an output of said portion of said atte from said logic circuit is at most one clock cycle of said clock of said processor.
Claim 2
Independent Claim
220 words
A system, in a processor, for use in translating a virtual address to an absolute address, said processor operating according to a clock, said system comprising: a plurality of registers wherein said plurality of registers comprises a plurality of first registers and a plurality of corresponding minus one registers, said plurality of minus one registers for storing parameter values of one less than corresponding values in the corresponding ones of said plurality of first registers; means for loading said plurality of registers with a first set of address translation parameters; an adder for adding a translation table origin ("tto") to an offset, an output of said adder comprising a base-plus-offset value; and a logic circuit coupled to and operative with said adder for determining at least a portion of an address of a translation table entry ("atte") and for performing at least one of windowing, prefixing, zoning and memory begin, said logic circuit using said base-plus-offset value and one or more of said first set of address translation parameters from said plurality of registers during said determining and said performing, wherein a latency of said system from a presentation of said tto to said adder to an output of said portion of said atte from said logic circuit is at most one clock cycle of said clock of said processor.
Claim 3
Dependent Claim
52 words
The system of claim 1, wherein each of said plurality of minus one registers corresponds to one of said plurality of first registers, and wherein said means for loading further comprises means for loading each of said plurality of minus one registers with a value of its corresponding first register less one.
Claim 4
Dependent Claim
56 words
The system of claim 2, wherein said logic circuit comprises means for comparing at least one of said plurality of first registers and at least one of said plurality of corresponding minus one registers to said tto, said means for comparing having a plurality of outputs which determine a source of the portion of said atte.
Claim 5
Dependent Claim
59 words
The system of claim 3, wherein said means for comparing comprises a plurality of comparators, and wherein each of said at least one of said plurality of first registers and each of said at least one of said plurality of corresponding minus one registers are individually connected to an input of a different comparator of said plurality of comparators.
Claim 6
Dependent Claim
49 words
The system of claim 4, wherein said logic circuit further comprises means for selecting a first plurality of outputs from said plurality of outputs of said comparators, said first plurality of outputs corresponding to one of said plurality of first registers and said plurality of corresponding minus one registers.
Claim 7
Dependent Claim
45 words
The system of claim 5, wherein said adder comprises an intermediate bit carry output, said intermediate bit carry output being connected to said means for selecting said first plurality of outputs such that said means for selecting said first plurality of outputs is responsive thereto.
Claim 8
Dependent Claim
49 words
The system of claim 6, wherein said logic circuit further comprises an output multiplexer which determines said portion of said atte, and wherein said first plurality of outputs are coupled to a plurality of selection inputs of said output multiplexer to facilitate selection of said portion of said atte.
Claim 9
Dependent Claim
51 words
The system of claim 7, wherein said output multiplexer comprises a plurality of data inputs of which one data input is selectable as said portion of said atte, and wherein said plurality of selection inputs facilitate selection of said one data input which is selectable as said portion of said atte.
Claim 10
Dependent Claim
24 words
The system of claim 8, wherein a first data input of said plurality of data inputs is connected to an output of said adder.
Claim 11
Dependent Claim
19 words
The system of claim 8, wherein a second data input of said plurality of data inputs comprises said offset.
Claim 12
Dependent Claim
41 words
The system of claim 8, wherein said first plurality of registers comprises a WR0 register and a WR1 register, and wherein a third data input of said plurality of data inputs comprises one of said WR0 register and said WR1 register.
Claim 13
Dependent Claim
28 words
The system of claim 8, wherein a fourth data input of said plurality of data inputs is coupled to a selected prefix register of said plurality of registers.
Claim 14
Dependent Claim
29 words
The system of claim 12, wherein said selected prefix register comprises one of an HPFX register, a G1PFX register, a G2PFX register, a G1PFX+MB/ZO register and a G2PFX+MB/ZO register.
Claim 15
Dependent Claim
44 words
The system of claim 13, wherein said G1PFX+MB/ZO register comprises a G1PFX value added to at most one of a MB value and a ZO value by said adder such that said logic circuit correspondingly performs at most one of zoning and memory begin.
Claim 16
Dependent Claim
44 words
The system of claim 13, wherein said G2PFX+MB/ZO register comprises a G2PFX value added to at most one of a MB value and a ZO value by said adder such that said logic circuit correspondingly performs at most one of zoning and memory begin.
References Cited (Backward Citations)
US3768080A
Cited
US4459661A
Cited
US4347565A
Cited
US4521846A
Cited
US4494189A
Cited
US4695950A
Cited
US4695948A
Cited
US4945479A
Cited
US4816991A
Cited
US4774659A
Cited
US5230045A
Cited
US4843541A
Cited
US5023773A
Cited
US4965720A
Cited
US5210840A
Cited
US5226132A
Cited
US5278961A
Cited
US5230069A
Cited
US5317754A
Cited
US5341485A
Cited
US5335333A
Cited
US5371867A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-07-14 | 2001-01-13 | 2001-07-15 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-07-14 | 2005-01-13 | 2005-07-15 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-07-14 | 2009-01-13 | 2009-07-15 | $7700.00 | Window Closed / Lapsed |