Method and apparatus for performing byte-code optimization during pauses
July 14, 2019. 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 ReferencesTask control means for a multi-tasking data processing system Adaptive page placement memory management system Module dependency based incremental compiler and method Computer memory product with preemptive multithreading software Method and apparatus for dynamically deoptimizing compiled activations Method and apparatus for dynamically optimizing byte-coded programs Apparatus and methods for optimally allocating currently available computer resources to future task instances versus continued execution of current task instances Mixed execution stack and exception handling Patent #: 6009517 InventorsApplicationNo. 353124 filed on 07/14/1999US Classes:717/140, Compiling code717/118, Bytecode (e.g., Java)717/151OptimizationExaminersPrimary: Powell, Mark R.Assistant: Das, Chameli C. Attorney, Agent or FirmInternational ClassG06F 717/05AbstractMethods and apparatus for dynamically compiling byte codes associated with methods during idle periods in the execution of a computer program are disclosed. The described methods are particularly suitable for use in computer systems that are arranged to execute both interpreted and compiled byte codes. In some embodiments, methods to be dynamically compiled are referenced in one or more lists. The lists may be prioritized to facilitate the compilation of the highest priority methods first. In one embodiment, a pair of compilation lists are provided with a first one of the compilation lists being created prior to processing the computer program while the other is created during the processing of the computer program.Other References
Field of SearchProcessing sequence control (i.e., microsequencing) | |
