Whole program optimization
- Whole program optimization
In computer programming, whole program optimization is the compiler optimization of a program using information about all the modules in the program. Normally, optimizations are performed on a per module (per function), "compiland", basis; but this approach, while easier to write and test and less demanding of resources during the compilation itself, do not allow certainty about the safety of a number of optimizations such as aggressive inlining and thus cannot perform them even if they would actually turn out to be efficiency gains that do not change the semantics of the emitted object code.
ee also
* JHC compiler
* JIT
* Metacompilation
Wikimedia Foundation.
2010.
Look at other dictionaries:
Program optimization — For algorithms to solve other optimization problems, see Optimization (mathematics). In computer science, program optimization or software optimization is the process of modifying a software system to make some aspect of it work more efficiently… … Wikipedia
Optimization (computer science) — In computing, optimization is the process of modifying a system to make some aspect of it work more efficiently or use fewer resources. For instance, a computer program may be optimized so that it executes more rapidly, or is capable of operating … Wikipedia
Compiler optimization — is the process of tuning the output of a compiler to minimize or maximize some attributes of an executable computer program. The most common requirement is to minimize the time taken to execute a program; a less common one is to minimize the… … Wikipedia
Interprocedural optimization — (IPO) is a compiler technique used in computer programming to improve performance in programs containing many frequently used functions of small or medium length. IPO differs from other compiler optimization because it analyzes the entire… … Wikipedia
Mathematical optimization — For other uses, see Optimization (disambiguation). The maximum of a paraboloid (red dot) In mathematics, computational science, or management science, mathematical optimization (alternatively, optimization or mathematical programming) refers to… … Wikipedia
Korean Chinese Optimization Prime — (KCOP) or read as K Coops. It was first created on December 5, 1945 for the defense of Southeast Asian Nations from being invaded by Imperial Japan. The project lacked funding and was opposed by European nations and by the newly formed United… … Wikipedia
Inline expansion — In computing, inline expansion, or inlining, is a manual or compiler optimization that replaces a function call site with the body of the callee. This optimization may improve time and space usage at runtime, at the possible cost of increasing… … Wikipedia
Single Compilation Unit — is a C/C++ technique which reduces compilation time and aids the compiler to perform program optimization even when compiler itself is lacking support for whole program optimization or precompiled headers.PurposeUsually a C/C++ development… … Wikipedia
IPO (disambiguation) — IPO can refer to:*In finance, Initial public offering *In intellectual property (patents, trademarks, copyrights): ** the Intellectual Property Owners Association ** an organization and public office referred to as intellectual property office… … Wikipedia
Fortran language features — This is a comprehensive overview of features of the Fortran 95 language, the version supported by almost all existing Fortran compilers. Old features that have been superseded by new ones are not described few of those historic features are used… … Wikipedia
