×

Virtual memory address translation mechanism with controlled data persistence

  • US 4,638,426 A
  • Filed: 09/19/1983
  • Issued: 01/20/1987
  • Est. Priority Date: 12/30/1982
  • Status: Expired
First Claim
Patent Images

1. A method for converting virtual memory addresses supplied by an associated central processing unit into real memory addresses within a large hierarachical memory system wherein the virtual memory address space is significantly larger than the actual memory which method comprises;

  • the CPU generating a first virtual address comprising a segment identifier field, a page offset field, and a byte offset field,utilizing the segment identifier field to access a set of segment registers pointed to by the segment identifier field,accessing the contents of the addressed segment register and concatenating the contents of same with the page offset and byte offset fields of said first virtual address to form a significantly larger second virtual address, wherein portions of said second virtual address obtained from said segment registers and the page offset portion of said first virtual address comprise a virtual page address to be utilized as a search argument in a subsequent address translation procedure which procedure comprisesutilizing a subset of said virtual page address as the search argument in a set of high speed translation-look-aside buffers,comparing a complete virtual address stored at an accessed location of said translation look-aside buffers with the complete virtual address utilized as the search argument and accessing an associated real page address in the main memory from the translation look-aside buffers if the virtual address comparison is successful,in the event of an unsuccessful search for the virtual address in said translation look-aside buffers, continuing the search in a specified segment of storage in main memory (page frame tables) includinghashing said virtual page address,accessing the page frame tables in main memory as a function at said hashed address, determining if the desired virtual address is at the hashed address and if notdetermining if the hashed address is the initial member of a linked list of virtual addresses, all of which would produce the same hashed address,continuing the search for the desired virtual address in said linked address list in said page frame tables until either the desired complete virtual address is found or it is determined that no such address is present,accessing the real page address associated with said complete virtual page address, if found, in said page frame tables and utilizing said real page address as the requested real memory address.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×