US PATENT SUBCLASS 395 / 709
.~.~.~ Optimization (e.g., removing redundancy)

Current as of: June, 1999
Click HD for Main Headings
Click for All Classes

Internet Version by PATENTEC © 1999      Terms of Use


395 /   HD   INFORMATION PROCESSING SYSTEM ORGANIZATION

701  DF  SOFTWARE PROGRAM DEVELOPMENT TOOL (E.G., INTEGRATED CASE TOOL OR STAND ALONE DEVELOPMENT TOOL) {5}
705  DF  .~ Program code translator or compiler {3}
708  DF  .~.~ Analyzing syntax, data, or an expression for compilation {1}
709.~.~.~ Optimization (e.g., removing redundancy)

DEFINITION

Classification: 395/709

Optimization (e.g., removing redundancy):

(under subclass 708) Subject matter comprising means or steps for making program code compilation or execution more efficient with respect to a performance parameter such as speed, memory usage or other resource usage.

(1) Note. This subclass is for optimizing compilers. For the purpose of this definition it should be understood that optimization steps may occur during any phase of the compilation. And, if a compiler does not perform an optimization, it's code would still run, however, not as efficiently as code that has been optimized with respect to a parameter or set of parameters. Further, for the purpose of this definition a "fast" compiler is considered to be an optimizing compiler in this subclass.

(2) Note. This subclass is for optimizing compilers. Classification is proper here if the compiler addresses some specified performance cost function. For example, optimizing should be to reduce or eliminate redundant code, redundant arithmetic operations or unnecessary memory accesses. These types of optimizations result in a smaller executable target program. In contrast, optimizing to decrease target program execution time by using inline code to eliminate the overhead of function calls will satisfy speed requirements but result in a much larger executable program. Generic systems dealing with cost functions and optimization of processes, per se are

classified elsewhere.

SEE OR SEARCH THIS CLASS, SUBCLASS:

207, through 209, for operations research, per se, including systems directed to generalized linear programming problem solving.

676, for identifying and dealing with run-time dependencies between executing programs, tasks, processes, (e.g., data dependencies, control flow dependencies, etc.).