U.S. patents available from 1976 to present.
U.S. patent applications available from 2005 to present.

Method and apparatus for selecting ways to compile at runtime

Patent 6298477 Issued on October 2, 2001. Estimated Expiration Date: Icon_subject October 30, 2018. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.

Patent References

Compiler and method for avoiding unnecessary recompilation
Patent #: 5854932
Issued on: 12/29/1998
Inventor: Mariani, et al.

Method and apparatus for automatically logging compiler options and/or overriding compiler options
Patent #: 5960202
Issued on: 09/28/1999
Inventor: Granston, et al.

Method and apparatus for improving compiler performance during subsequent compilations of a source program Patent #: 6078744
Issued on: 06/20/2000
Inventor: Wolczko, et al.

Inventor

Application

No. 183499 filed on 10/30/1998

US Classes:

717/145, Including recompilation712/222, Floating point or vector717/148, Just-in-time compiling or dynamic compiling (e.g., compiling Java bytecode on a virtual machine)717/151Optimization

Examiners

Primary: Chaki, Kakali
Assistant: Zhen, Wei

Attorney, Agent or Firm

International Class

G06F 009/45

Abstract

Apparatus, methods, and computer program products are disclosed for determining how to compile a program at runtime. A bytecode instruction associated with the program that can be compiled in multiple ways is retrieved and compiled in a particular way, typically the default way. At runtime, a virtual machine determines whether another way of compiling the bytecode instruction is more desirable and, if so, the bytecode is then recompiled the other way. In some embodiments, the portion of the program that contains the bytecode instruction to be recompiled is placed in a queue with other instructions that are to be recompiled. The virtual machine may examine changing requirements of the program that have developed at the program's execution in which the requirements are derived from profile data on each of the multiple ways the program can be compiled. The bytecode instruction within the program may be recompiled in a more preferred way based upon the profile data.

Other References

  • Goldberg. What Every Computer Scientists Should Know About Floating-Point Arithmetic. ACM. pp. 5-48, Mar. 1991.
  • Johnson. Trap Architectures for Lisp Systems. ACM. pp. 79-86, 199
PatentsPlus Images
Enhanced PDF formats
loading...
PatentsPlus: add to cart
PatentsPlus: add to cartSearch-enhanced full patent PDF image
$9.95more info
PatentsPlus: add to cart
PatentsPlus: add to cartIntelligent turbocharged patent PDFs with marked up images
$16.95more info
 
Sign InRegister
Username  
Password   
forgot password?