Patent US3030019A successfully refreshed from Google Patents.
← Back to Patent Explorer
US3909798A Expired / Lapsed US ⏱️ 0.0 years remaining

Virtual addressing method and apparatus

Assignee: Raytheon Co
•
Filing: 1974-01-25
•
Granted: 1975-09-30
•
Expires: 1994-01-25
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Method and apparatus are disclosed to implement an improved virtual addressing technique whereby access, whenever permissible, to a bulk memory may be effected, on demand, by any one of a plurality of processors in a digital computer system, each such processor being capable of providing either a page location code or an entry location code as an address for the bulk memory. In addition, method and apparatus are disclosed to determine whether or not instructions required to execute any required step in a program are available at the processor and, if not, to fetch such instructions from bulk memory. Still further, method and apparatus are disclosed either to store all entries on any fetched pages in a memory at each demanding processor, the address of each fetched page in such memory being determined in any one of a number of ways, or to apply fetched entries directly to an arithmetic unit in the demanding processor.

Inventors

  • 👤 Steven J Wallach
  • 👤 Alan J Deerfield
  • 👤 Stanley M Nissen

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-22 22:53
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/02; G06F12/08; G06F12/10; G06F12/1072; G06F12/14; G06F12/1416; G06F12/1425

Claims Analysis

Total Claims: 4
Claim 1
Independent Claim 375 words
In a digital computer system including memory devices forming a bulk memory and a local memory, wherein locations in any one of a plurality of memory devices making up a said bulk memory may be virtually addressed to provide, on demand during execution of any selected one of a plurality of programs, instructions and operands from different ones of such memory devices for application to, respectively, said local memory and an arithmetic unit included within a processor, the improvement comprising: a. means for storing a set of logical statements as contiguous translation index words on an integral number of pages in one portion of the local memory, each one of such logical statements containing, at least: i. a bulk memory location code field; ii. a local memory page address field; iii. a page or operand code field; and iv. a present or not present code field; b. means, respsonsive to the contents of the code and address fields in each one of the logical statements as such statements are read, for addressing the bulk memory with, alternatively: i. a fetch operand command word containing, at least, a bulk memory address defining the location of an operand to be fetched from bulk memory; or ii. a fetch page of instructions command word containing, at least, a bulk memory page address defining the location of a page of instructions to be fetched from bulk memory; c. means, responsive to each fetch operand command word, for: i. receiving the operand commanded to be fetched from bulk memory; and ii. enabling the arithmetic unit to process the fetched operand; d. means, responsive to each fetch page of instructions command word, for i. receiving the page of instruction commands to be fetched from bulk memory; ii. means, further responsive to each fetch page of instructions command word, for overlaying such page of instructions on a selected page in local memory; iii. means, further responsive to each fetch page of instructions command word, for entering a present code in the p''''present or not present'''' code field of the current logical statement; and iv. means, further responsive to each fetch page of instructions command word, for enabling the arithmetic unit to be operated in accordance with successive ones of the fetched instructions.
Claim 2
Dependent Claim 375 words
In a digital computer system including memory devices forming a bulk memory and a local memory, wherein locations in any one of a plurality of memory devices making up a said bulk memory may be virtually addressed to provide, on demand during execution of any selected one of a plurality of programs, instructions and operands from different ones of such memory devices for application to, respectively, said local memory and an arithmetic unit included within a processor, the improvement comprising: a. means for storing a set of logical statements as contiguous translation index words on an integral number of pages in one portion of the local memory, each one of such logical statements containing, at least: i. a bulk memory location code field; ii. a local memory page address field; iii. a page or operand code field; and iv. a present or not present code field; b. means, respsonsive to the contents of the code and address fields in each one of the logical statements as such statements are read, for addressing the bulk memory with, alternatively: i. a fetch operand command word containing, at least, a bulk memory address defining the location of an operand to be fetched from bulk memory; or ii. a fetch page of instructions command word containing, at least, a bulk memory page address defining the location of a page of instructions to be fetched from bulk memory; c. means, responsive to each fetch operand command word, for: i. receiving the operand commanded to be fetched from bulk memory; and ii. enabling the arithmetic unit to process the fetched operand; d. means, responsive to each fetch page of instructions command word, for i. receiving the page of instruction commands to be fetched from bulk memory; ii. means, further responsive to each fetch page of instructions command word, for overlaying such page of instructions on a selected page in local memory; iii. means, further responsive to each fetch page of instructions command word, for entering a present code in the p''''present or not present'''' code field of the current logical statement; and iv. means, further responsive to each fetch page of instructions command word, for enabling the arithmetic unit to be operated in accordance with successive ones of the fetched instructions.
Claim 3
Dependent Claim 139 words
The improvement as claimed in claim 1 wherein the overlaying means includes: a. decoder means, responsive to different selected ones of selected instructions in the local memory encountered during execution of a program, for producing an enabling signal on different ones of a plurality of lines; b. a like plurality of latching means, each one thereof being actuated by an enabling signal on a different one of the plurality of lines; and c. a like plurality of address selectors, each one thereof being enabled by a different one of the plurality of latching means, responsive to the number of fetch page of instructions command words generated by reading logical statements when the corresponding one of the plurality of latching means is actuated to produce a page address in local memory for each page of instructions fetched from bulk memory.
Claim 4
Dependent Claim 67 words
The improvement as in claim 1 wherein each one of the logical statements includes additionally, an access control field for an access control code to enable or inhibit access to bulk memory, such improvement comprising, additionally, decoding means, responsive to the access control code in each logical statement read during execution of a program, for enabling or, alternatively, inhibiting transmission of a commond word to bulk memory.

References Cited (Backward Citations)

US3614746A Cited
US3611307A Cited
US3720920A Cited
US3693165A Cited
US3761881A Cited
US3723976A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1978-09-29 1979-03-31 1979-09-30 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1982-09-29 1983-03-31 1983-09-30 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1986-09-29 1987-03-31 1987-09-30 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag