Patents by Inventor Jesse Z. Fang

Jesse Z. Fang 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).

  • Method and apparatus for compiler-generated triggering of auxiliary codes
    Publication number: 20020199179
    Abstract: A method for executing a code is provided. The method includes receiving a trigger instruction, selecting an entry in a trigger table, the entry associated with the trigger instruction, and executing an auxiliary code referenced by the entry in the trigger table.
    Type: Application
    Filed: June 21, 2001
    Publication date: December 26, 2002
    Inventors: Daniel M. Lavery, Hong Wang, Gerolf F. Hoflehner, Shih-wei Liao, John Shen, Edward T. Grochowski, David C. Sehr, Jesse Z. Fang
  • Optimizing code based on resource sensitive hoisting and sinking
    Patent number: 6044221
    Abstract: A method and apparatus for optimizing code using resource based partial elimination techniques is disclosed. At least one location is identified in the code wherein the at least one location has available resources. One of the plurality of instructions is moved to the at least one location according to partial elimination techniques.
    Type: Grant
    Filed: May 9, 1997
    Date of Patent: March 28, 2000
    Assignee: Intel Corporation
    Inventors: Rajiv Gupta, David A. Berson, Jesse Z. Fang
  • Optimizing code by exploiting speculation and predication with a cost-benefit data flow analysis based on path profiling information
    Patent number: 5999736
    Abstract: A method and apparatus for optimizing execution of code is disclosed. The code is executed to generate path profiling information. At least one location is identified for relocating at least one of the plurality of instructions in the code, where the at least one location is enabled by one of predication and speculation. A cost and a benefit are calculated for relocating the at least one of the plurality of instructions to the at least one location, the cost and the benefit based on the path profiling information. The at least one of the plurality of instructions is moved to the at least one location when the benefit exceeds the cost, and one of predication and speculation is performed on the one of the plurality of instructions. The code is then reexecuted.
    Type: Grant
    Filed: May 9, 1997
    Date of Patent: December 7, 1999
    Assignee: Intel Corporation
    Inventors: Rajiv Gupta, David A. Berson, Jesse Z. Fang