US3976978A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of generating addresses to a paged memory
Assignee: Bull HN Information Systems Inc
•
Filing: 1975-03-26
•
Granted: 1976-08-24
•
Expires: 1995-03-26
Abstract
Abstract An input-output processing system which performs communication and control functions in a larger data processing system includes a processor for address development to paged memory and program instruction execution for I/O command sequences. In generating memory addresses, instructions are provided an address syllable which references a processor register as an index and a displacement. The contents of the register and the displacement define a memory effective address. A scratchpad memory is provided for storing page table words in levels corresponding to priority levels of processes, and stored page table words are accessed according to the least significant bits of the page number of the effective address. A page base address is taken from an accessed page table word and is concatenated with the effective address to define an absolute memory address.
Inventors
- 👤 Garvin Wesley Patterson
- 👤 Marion G. Porter
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 14:00
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/02; G06F12/0223; G06F12/0292
Claims Analysis
Total Claims: 16
Claim 1
Independent Claim
125 words
In an input-output data processing system employing paged memory and executing a plurality of processes at multiple levels of priority, the method of efficiently developing memory addresses comprising the steps of: a. providing a scratchpad memory for page table words in levels corresponding to priority levels of processes, b. storing page table words in a level of said scratchpad memory at a position defined by the least significant bits of the page number of said page table word, and c. accessing said scratchpad memory for a stored page table word corresponding to a page number of an effective address by examining the location defined by the least significant bits of said page number at the level corresponding to the priority level of the executing process.
Claim 2
Dependent Claim
125 words
In an input-output data processing system employing paged memory and executing a plurality of processes at multiple levels of priority, the method of efficiently developing memory addresses comprising the steps of: a. providing a scratchpad memory for page table words in levels corresponding to priority levels of processes, b. storing page table words in a level of said scratchpad memory at a position defined by the least significant bits of the page number of said page table word, and c. accessing said scratchpad memory for a stored page table word corresponding to a page number of an effective address by examining the location defined by the least significant bits of said page number at the level corresponding to the priority level of the executing process.
Claim 3
Dependent Claim
58 words
The method of developing memory addresses as defined by claim 1 wherein said page table words each include reference to local and remote memory, steering to specific local and remote memory, access privileges, a page base address to said referenced memory, a page number identification, and a key identifying the process to which said page table word belongs.
Claim 4
Dependent Claim
51 words
The method of developing memory addresses as defined by claim 2 and including the step of verifying a fetched page table word from said scratchpad memory by comparing the most significant bits of said effective address page number and the most significant bits of said fetched page table word page number.
Claim 5
Dependent Claim
43 words
The method of developing memory addresses as defined by claim 3 wherein said step of verifying a fetched page table word further includes comparing a key identification number in said fetched page table word and a key identification number of the executing process.
Claim 6
Dependent Claim
49 words
The method of developing memory addresses as defined by claim 4 and including the step, responsive to lack of verification thus indicating nonavailability of the required page table word in said scratchpad memory, of fetching said required page table word from memory by means of a memory page table.
Claim 7
Dependent Claim
59 words
The method of developing memory addresses as defined by claim 1 wherein said effective address is generated from a process instruction including an address syllable which references a process register as an index and specifies a displacement value, and including the step of adding the value in said referenced register to said displacement value to form said effective address.
Claim 8
Dependent Claim
168 words
In an input-output data processing system which performs communication and control functions concurrently for a plurality of processes with assigned levels of priority including address development to paged memory, the method of generating memory addresses comprising the steps of: a. maintaining a plurality of page table words in a processor scratchpad memory in levels corresponding to priority levels of processes in execution, each of said page table words including reference to local and remote memory, steering to specific local and remote memory, a page base address in said referenced memory, a page number identification, and a key identifying the process to which said page table word belongs, b. generating an effective address from a process instruction including a page number and a page relative address, c. locating a page table word in said processor scratchpad memory corresponding to said page number, and d. concatenating said page base address from said page table word and said page relative address from said effective address to define an absolute memory address.
Claim 9
Dependent Claim
168 words
In an input-output data processing system which performs communication and control functions concurrently for a plurality of processes with assigned levels of priority including address development to paged memory, the method of generating memory addresses comprising the steps of: a. maintaining a plurality of page table words in a processor scratchpad memory in levels corresponding to priority levels of processes in execution, each of said page table words including reference to local and remote memory, steering to specific local and remote memory, a page base address in said referenced memory, a page number identification, and a key identifying the process to which said page table word belongs, b. generating an effective address from a process instruction including a page number and a page relative address, c. locating a page table word in said processor scratchpad memory corresponding to said page number, and d. concatenating said page base address from said page table word and said page relative address from said effective address to define an absolute memory address.
Claim 10
Dependent Claim
58 words
The method of developing memory addresses as defined by claim 7 wherein said page table words each include reference to local and remote memory, steering to specific local and remote memory, access privileges, a page base address to said referenced memory, a page number identification, and a key identifying the process to which said page table word belongs.
Claim 11
Dependent Claim
99 words
The method of generating memory addresses as defined by claim 8 wherein step c) includes fetching a page table word at a level of said scratchpad memory equal to the assigned level of the process in execution and at a location defined by the least significant bits of said page number, comparing the key of said fetched page table word with the key of the executing process for correct process verification, and comparing the most significant bits of said page number with the most significant bits of said page number of said fetched page table word for page verification.
Claim 12
Dependent Claim
51 words
The method of generating memory addresses as defined by claim 9 and including the step, responsive to lack of verification in step c) indicating nonavailability of the required page table word in said scratchpad memory, of fetching said required page table word from memory by means of a memory page table.
Claim 13
Dependent Claim
54 words
The method of generating memory addresses as defined by claim 7 wherein step b) comprises providing an address syllable as part of an instruction which references a processor register as an index and specifies a displacement value, and concatenating the value in said referenced register and said displacement value to form said effective address.
Claim 14
Dependent Claim
103 words
In a processor for an input/output data processing system which develops addresses to paged memory through the use of page table words which include reference to local and remote memory and a page base address in a reference memory, a scratchpad memory for page table words comprising: a plurality of storage areas, each of said plurality of storage areas having an assigned priority level; means for corresponding said priority levels to priority levels of processes being executed on said system; and, a plurality of page table word storage locations for each of said storage areas, each of said storage locations being individually accessible.
Claim 15
Dependent Claim
103 words
In a processor for an input/output data processing system which develops addresses to paged memory through the use of page table words which include reference to local and remote memory and a page base address in a reference memory, a scratchpad memory for page table words comprising: a plurality of storage areas, each of said plurality of storage areas having an assigned priority level; means for corresponding said priority levels to priority levels of processes being executed on said system; and, a plurality of page table word storage locations for each of said storage areas, each of said storage locations being individually accessible.
Claim 16
Dependent Claim
41 words
A scratchpad memory for page table words as defined by claim 12 wherein said storage locations are individually accessed in accordance with the least significant bits of a page number for which a page table word is required for address development.
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) | 1979-08-24 | 1980-02-23 | 1980-08-24 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1983-08-24 | 1984-02-23 | 1984-08-24 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1987-08-24 | 1988-02-23 | 1988-08-24 | $7700.00 | Window Closed / Lapsed |