Patents by Inventor James O. Hays

James O. Hays has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 6505296
    Abstract: A computer system includes a processor for executing a program and an interruption handler from a memory. The processor includes an instruction pointer indicating a memory location of a current executing instruction. The processor executes a trampoline check instruction in the program which tests a condition and if the condition is true, causes an interruption and supplies an address displacement. The interruption handler responds to the interruption and restarts execution of the program at a restart point indicating a memory location of a special handler in the program. The restart point is a sum of the address displacement and a value of the instruction pointer at the time of the interruption. If the condition is false, normal control flow of the program is continued.
    Type: Grant
    Filed: March 8, 2000
    Date of Patent: January 7, 2003
    Assignee: Hewlett-Packard Company
    Inventors: Dale C. Morris, Jonathan K. Ross, James O. Hays, Jerome C. Huck
  • Patent number: 6453427
    Abstract: An uncorrectable error is detected in the data of a computer system. The erroneous data is allowed to be stored in first and second caches of the computer system while the system runs first and second processes, the first process being associated with the data. The first process is terminated when an attempt is made to load the data from the cache. Meanwhile, the second process continues to run.
    Type: Grant
    Filed: December 31, 1998
    Date of Patent: September 17, 2002
    Assignee: Intel Corporation
    Inventors: Nhon T. Quach, John W. C. Fu, James O. Hays, Valentin Anders, Sorin Iacobovici, Alberto J. Munoz, Dean A. Mulla
  • Patent number: 6430670
    Abstract: The present invention generally relates to an apparatus and method for efficiently translating virtual addresses utilizing either single address space or multiple address space models in a virtual memory management system. In particular, a Virtual Hash Page Table (VHPT), an extension of the Translation Lookaside Buffer (TLB) hierarchy, is designed to enhance virtual address translation performance. Virtual Hash Page Table (VHPT) efficiently supports two different methods of operating systems use to translate virtual addresses to physical addresses. This directly benefits the highly frequented path of address resolution.
    Type: Grant
    Filed: November 1, 2000
    Date of Patent: August 6, 2002
    Assignee: Hewlett-Packard Co.
    Inventors: William R. Bryg, Stephen G. Burger, James O. Hays, John M. Kessenich, Jonathan K. Ross, Gary N. Hammond, Sunil Saxena, Koichi Yamada
  • Patent number: 6408373
    Abstract: A method and apparatus pre-validate regions in a virtual addressing scheme by storing both the virtual region number (VRN) bits and region identifiers (RIDs) in translation lookaside buffer (TLB) entries. By storing both the VRN bits and RIDs in TLB entries, the region registers can be bypassed when performing most TLB accesses, thereby removing region registers the critical path of the TLB look-up process and enhancing system performance. A TLB in accordance with the present invention includes entries having a valid field, a region pre-validation valid (rpV) field, a virtual region number (VRN) field, a virtual page number (VPN) field, a region identifier (RID) field, a protection and access attributes field, and a physical page number (PPN) field. In addition, a set of region registers contains the RIDs that are active at any given time.
    Type: Grant
    Filed: May 7, 2001
    Date of Patent: June 18, 2002
    Assignee: Institute for the Development of Emerging Architectures, LLC
    Inventors: Stephen G. Burger, James O. Hays, Jonathan K. Ross, William R. Bryg, Rajiv Gupta, Gary N. Hammond, Koichi Yamada
  • Patent number: 6393544
    Abstract: A method and apparatus calculate a page table index from a virtual address. Employs a combined hash algorithm that supports two different hash page table configurations. A “short format” page table is provided for each virtual region, is linear, has a linear entry for each translation in the region, and does not store tags or chain links. A single “long format” page table is provided for the entire system, supports chained segments, and includes hash tag fields. The method of the present invention forms an entry address from a virtual address, with the entry address referencing an entry of the page table. To form the entry address, first a hash page number is formed from the virtual address by shifting the virtual address right based on the page size of the region of the virtual address.
    Type: Grant
    Filed: October 31, 1999
    Date of Patent: May 21, 2002
    Assignee: Institute for the Development of Emerging Architectures, L.L.C.
    Inventors: William R. Bryg, Stephen G. Burger, Gary N. Hammond, James O. Hays, Jerome C. Huck, Jonathan K. Ross, Sunil Saxena, Koichi Yamada
  • Publication number: 20020010851
    Abstract: A computer system includes a processor for executing a program and an interruption handler from a memory. The processor includes an instruction pointer indicating a memory location of a current executing instruction. The processor executes a trampoline check instruction in the program which tests a condition and if the condition is true, causes an interruption and supplies an address displacement. The interruption handler responds to the interruption and restarts execution of the program at a restart point indicating a memory location of a special handler in the program. The restart point is a sum of the address displacement and a value of the instruction pointer at the time of the interruption. If the condition is false, normal control flow of the program is continued.
    Type: Application
    Filed: March 8, 2000
    Publication date: January 24, 2002
    Inventors: Dale C. Morris, Jonathan K. Ross, James O. Hays, Jerome C. Huck
  • Publication number: 20010049798
    Abstract: An uncorrectable error is detected in the data of a computer system. The erroneous data is allowed to be stored in first and second caches of the computer system while the system runs first and second processes, the first process being associated with the data. The first process is terminated when an attempt is made to load the data from the cache. Meanwhile, the second process continues to run.
    Type: Application
    Filed: December 31, 1998
    Publication date: December 6, 2001
    Inventors: NHON T. QUACH, JOHN W. C. FU, VALENTIN ANDERS, SORIN IACOBOVICI, ALBERTO J. MUNOZ, DEAN MULLA, JAMES O. HAYS
  • Publication number: 20010021969
    Abstract: A method and apparatus pre-validate regions in a virtual addressing scheme by storing both the virtual region number (VRN) bits and region identifiers (RIDs) in translation lookaside buffer (TLB) entries. By storing both the VRN bits and RIDs in TLB entries, the region registers can be bypassed when performing most TLB accesses, thereby removing region registers the critical path of the TLB look-up process and enhancing system performance. A TLB in accordance with the present invention includes entries having a valid field, a region pre-validation valid (rpV) field, a virtual region number (VRN) field, a virtual page number (VPN) field, a region identifier (RID) field, a protection and access attributes field, and a physical page number (PPN) field. In addition, a set of region registers contains the RIDs that are active at any given time.
    Type: Application
    Filed: May 7, 2001
    Publication date: September 13, 2001
    Inventors: Stephen G. Burger, James O. Hays, Jonathan K. Ross, William R. Bryg, Rajiv Gupta, Gary N. Hammond, Koichi Yamada
  • Patent number: 6230248
    Abstract: A method and apparatus pre-validate regions in a virtual addressing scheme by storing both the virtual region number (VRN) bits and region identifiers (RIDs) in translation lookaside buffer (TLB) entries. By storing both the VRN bits and RIDs in TLB entries, the region registers can be bypassed when performing most TLB accesses, thereby removing region registers the critical path of the TLB look-up process and enhancing system performance. A TLB in accordance with the present invention includes entries having a valid field, a region pre-validation valid (rpV) field, a virtual region number (VRN) field, a virtual page number (VPN) field, a region identifier (RID) field, a protection and access attributes field, and a physical page number (PPN) field. In addition, a set of region registers contains the RIDs that are active at any given time.
    Type: Grant
    Filed: October 12, 1998
    Date of Patent: May 8, 2001
    Assignee: Institute for the Development of Emerging Architectures, L.L.C.
    Inventors: Stephen G. Burger, James O. Hays, Jonathan K. Ross, William R. Bryg, Rajiv Gupta, Gary N. Hammon, Koichi Yamada
  • Patent number: 6216214
    Abstract: The present invention generally relates to an apparatus and method for efficiently translating virtual addresses utilizing either single address space or multiple address space models in a virtual memory management system. In particular, a Virtual Hash Page Table (VHPT), an extension of the Translation Lookaside Buffer (TLB) hierarchy, is designed to enhance virtual address translation performance. Virtual Hash Page Table (VHPT) efficiently supports two different methods of operating systems use to translate virtual addresses to physical addresses. This directly benefits the highly frequented path of address resolution.
    Type: Grant
    Filed: February 3, 1998
    Date of Patent: April 10, 2001
    Assignee: Institute for the Development of Emerging Architectures, L.L.C.
    Inventors: William R. Bryg, Stephen G. Burger, James O. Hays, John M. Kessenich, Jonathan K. Ross, Gary N. Hammond, Sunil Saxena, Koichi Yamada
  • Patent number: 5940872
    Abstract: A translation lookaside buffer (TLB) is provided including a first storage location in the TLB for storing at least a portion of a first virtual to physical memory translation. The first storage location in the TLB is both hardware-managed and software-managed. The TLB also includes a second storage location in the TLB for storing at least a portion of a second virtual to physical memory translation. The second storage location in the TLB is only software-managed.
    Type: Grant
    Filed: November 1, 1996
    Date of Patent: August 17, 1999
    Assignee: Intel Corporation
    Inventors: Gary N. Hammond, Koichi Yamada, Stephen G. Burger, James O. Hays, Jonathan K. Ross, William R. Bryg
  • Patent number: 5915117
    Abstract: The inventive system and method allows for software control of hardware drral of exceptions in speculative operations, and comprises three components. The first component is processor stored information which reflects the code generation strategy of applications and is used by hardware and the operating system to control exception deferral. The second component is processor stored information set by the operating system to specify to hardware which type of faults should be automatically deferred. The third component is further processor stored information which indicates to the hardware to defer certain exception causing aspects of the speculative operation, while performing other non excepting aspects of the speculative operation. The stored information is set after the operating system exception handler has unsuccessfully attempted fault resolution.
    Type: Grant
    Filed: October 13, 1997
    Date of Patent: June 22, 1999
    Assignee: Institute For The Development of Emerging Architectures, L.L.C.
    Inventors: Jonathan K. Ross, Jack D. Mills, James O. Hays, Stephen G. Burger, Dale C. Morris, Carol L. Thompson, Rajiv Gupta, Stefan M. Freudenberger, Gary N. Hammond, Ralph M. Kling