US5129070A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of using the memory in an information processing system of the virtual addressing type, and apparatus for performing the method
Assignee: Bull SAS
•
Filing: 1990-10-03
•
Granted: 1992-07-07
•
Expires: 2010-10-03
Abstract
Abstract The method and apparatus for using the memory in an information processing system of the virtual addressing type is characterized in that a first memory domain DX is organized around a logical address of NX bits in size. In the memory domain DX, a plurality of address spaces EAX of identical structure is defined and relative addressing of a size NL less than NX is allowed. One of the address spaces EAX (hereinafter the current address space EAC) is assigned temporarily and interchangeably to a second memory domain DL organized around an address that is NL bits in size.
Inventors
- 👤 Michel Dorotte
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 13:59
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/02; G06F12/0223; G06F12/0292; G06F12/08; G06F12/0802; G06F12/0877; G06F12/0886; G06F12/10; G06F12/109
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
245 words
A method of operating a memory in an information processing system of the virtual addressing type, said method comprising the steps of: organizing a first memory domain DX of a first address size NX having NX bits usable to logically address memory locations of said first memory domain, defining in the memory domain DX a plurality of interchangeable address spaces EAX of identical structure of a second address size NL having NL bits usable to logically address memory locations of said interchangeable address spaces EAX, where NL is lower than NX, constructing a first addressing format FX1 of the size NX for access to the spaces EAX by extension of a second addressing format FL of the size NL used for relative addressing of memory locations in said interchangeable address spaces EAX by means of a complementary zone containing at least one field intended to receive an identifier of the corresponding interchangeable address spaces EAX, assigning one of the interchangeable address spaces EAX as a current address space EAC temporarily and interchangeably to a second memory domain DL using the second addressing format FL and selecting a bit pattern of said second addressing format FL for discriminating between the first addressing format FX1 and the second addressing format FL to control access to the said current address space EAC in said second memory domain DL, and storing in a register CSR the identifier of the interchangeable address space EAX assigned as current address space EAC.
Claim 2
Independent Claim
245 words
A method of operating a memory in an information processing system of the virtual addressing type, said method comprising the steps of: organizing a first memory domain DX of a first address size NX having NX bits usable to logically address memory locations of said first memory domain, defining in the memory domain DX a plurality of interchangeable address spaces EAX of identical structure of a second address size NL having NL bits usable to logically address memory locations of said interchangeable address spaces EAX, where NL is lower than NX, constructing a first addressing format FX1 of the size NX for access to the spaces EAX by extension of a second addressing format FL of the size NL used for relative addressing of memory locations in said interchangeable address spaces EAX by means of a complementary zone containing at least one field intended to receive an identifier of the corresponding interchangeable address spaces EAX, assigning one of the interchangeable address spaces EAX as a current address space EAC temporarily and interchangeably to a second memory domain DL using the second addressing format FL and selecting a bit pattern of said second addressing format FL for discriminating between the first addressing format FX1 and the second addressing format FL to control access to the said current address space EAC in said second memory domain DL, and storing in a register CSR the identifier of the interchangeable address space EAX assigned as current address space EAC.
Claim 3
Dependent Claim
49 words
The method of claim 1, characterized in that the memory domain DL includes a permanent address space EAPCB identical in structure to the said interchangeable address spaces EAX, the permanent address space EAPCB being markable in the memory domain DX by an identifier having a value equal to zero.
Claim 4
Dependent Claim
91 words
The method of claim 2, further comprising the steps of: utilizing procedure descriptions PD of identical basic structure for the address spaces of size NL, the spaces EAX and as applicable the permanent space EAPCB, defining descriptors of a change of address space (CASD), identical in basic structure to that of the procedure descriptors PD; and beginning with a process that can be executed in a given address space, authorizing a callup of a procedure APE that can be executed in another address space, via a descriptor of the CASD type.
Claim 5
Dependent Claim
42 words
The method of claim 3, characterized in that the CASD descriptors include a field intended to receive the identifier of another address space NEA containing a called procedure APE and the called procedure including a pointer in said another address space NEA.
Claim 6
Dependent Claim
58 words
The method of claim 4, incorporating a first and a second process execution mode, said second process execution mode (32/64 mode) supporting both address sizes NX and NL, both execution modes being automatically switchable from one to the other upon a procedure callup by identification in a procedure descriptor of a code type characteristic of a CASD descriptor.
Claim 7
Dependent Claim
37 words
The method of claim 1, characterized in that the address spaces of the first and second memory domains are of the segmented type, optionally having a plurality of sizes and/or sharable by a plurality of programmed processes.
Claim 8
Dependent Claim
30 words
The method of claim 1, characterized in that a plurality of segments accessible from a different addressing format FX2 of size NX is defined in the first memory domain DX.
Claim 9
Dependent Claim
27 words
The method of claim 7, characterized in that the format FX2 incorporates a version AA64 enabling absolute addressing in a physical memory of the information processing system.
Claim 10
Dependent Claim
20 words
The method of claim 1, incorporating a first process execution mode (32/64 mode) supporting both address sizes NX and NL.
Claim 11
Dependent Claim
45 words
The method of claim 9 including a second process execution mode (32 mode) supporting the second addressing format NL, both process executing modes (the 32 mode and the 32/64 mode) being switchable from one to the other, either automatically by dynamic change or by programming.
Claim 12
Dependent Claim
132 words
The method of claim 11, including a process for executing elementary instructions, which uses base registers as address registers of the information processing system further comprising the steps of: defining two sets of base registers Bri of address size NL and NX in a memory zone BREM comprising a set of bits BREMi organizing a mark for the contents of each bit BREMi which is representative of the address size NL and NX of an address loaded into or drawn from the corresponding register BRi; simultaneously with the loading of the drawing of the said address, executing a compatibility verification of the address loaded or drawn by checking the corresponding bit BREMi, and if applicable, effecting an automatic address reduction or extension, with change, as a consequence, of the corresponding bit BREMi.
References Cited (Backward Citations)
DE2046834A1
Cited
US3820078A
Cited
US4385352A
Cited
US4177510A
Cited
US4297743A
Cited
US4206503A
Cited
US4363091A
Cited
US4258419A
Cited
US4876639A
Cited
EP0208429A2
Cited
EP0230354A2
Cited
US4970639A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1995-07-07 | 1996-01-06 | 1996-07-07 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-07-07 | 2000-01-06 | 2000-07-07 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-07-07 | 2004-01-06 | 2004-07-07 | $7700.00 | Window Closed / Lapsed |