-
1 compiler optimization
один из этапов компиляции, на котором с помощью методов оптимизации происходит преобразование программы, сохраняющее её семантику, но уменьшающее размер кода и/или время выполнения. Как правило, уменьшение размера кода увеличивает время выполнения, и наоборот. Поскольку ручная оптимизация программы стоит дорого и занимает много времени, а программисты, работающие на ЯВУ, обычно не знают тонкостей архитектуры конкретного целевого процессора, то сейчас кроме редких случаев используется оптимизация при компиляции, когда компилятор автоматически выбирает наиболее эффективный способ оптимизации и детали реализации в соответствии с заданным уровнем оптимизациисм. тж. antidependence, branch deletion, automatic parallelization, constant folding, constant propagation, control dependence, copy propagation, CSE, data dependence, dead statement, expression folding, fission by name, global forward substitution, GVN, hand optimization, intermediate representation, interprocedural optimization, jump threading, lazy evaluation, induction variable, instruction scheduling, instruction selection, local optimization, loop collapsing, loop invariant code motion, loop inversion, loop parallelization, loop optimization, loop peeling, loop skewing, loop splitting, loop tiling, loop transformation, loop unrolling, loop unrolling and jamming, loop unswitching, loop unwinding, loop vectorization, LNO, optimization, optimization technique, optimizing compiler, output dependence, partial evaluation, peephole optimization, polytope model, PRE, redundant-test elimination, register allocation, register spilling, scalar replacement, SSA, static analysis, strength reduction, strip mining, test promotion, trace scheduling, true dependence, two-version loop, vectorizationАнгло-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > compiler optimization
См. также в других словарях:
Polytope model — The polyhedral model (also called the polytope method) is a mathematical framework for loop nest optimization in compiler theory. The polytope method models operations within nested manifest loops as mathematical objects called polytopes,… … Wikipedia
Regular polytope — In mathematics, a regular polytope is a polytope whose symmetry is transitive on its flags, thus giving it the highest degree of symmetry. All its elements or j faces (for all 0≤ j ≤ n , where n is the dimension of the polytope) cells, faces and… … Wikipedia
Frameworks supporting the polyhedral model — Use of the polyhedral model within a compiler requires software to represent the objects of this framework (sets of integer valued points in regions of various spaces) and perform operations upon them (e.g., testing whether the set is empty). Two … Wikipedia
Littelmann path model — In mathematics, the Littelmann path model is a combinatorial device due to Peter Littelmann for computing multiplicities without overcounting in the representation theory of symmetrisable Kac Moody algebras. Its most important application is to… … Wikipedia
Автоматическое распараллеливание — Автоматическое распараллеливание оптимизация программы компилятором, состоящая в автоматическом ее преобразовании в форму, работающую на параллельном компьютере, например, на SMP или NUMA машине. Целью автоматизации распараллеливания… … Википедия
Loop optimization — In compiler theory, loop optimization plays an important role in improving cache performance, making effective use of parallel processing capabilities, and reducing overheads associated with executing loops. Most execution time of a scientific… … Wikipedia
Automatic parallelization — Automatic parallelization, also auto parallelization, autoparallelization, parallelization, or //ization (shorthand), the last two of which imply automation when used in context, refers to converting sequential code into multi threaded or… … Wikipedia
Manifest expression — A manifest expression is a programming language construct that a compiler can analyse to deduce which values it can take without having to execute the program. This information can enable compiler optimizations, in particular loop nest… … Wikipedia
120-cell — Schlegel diagram (vertices and edges) Type Convex regular 4 polytope Schläfli symbol {5,3,3} … Wikipedia
Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… … Wikipedia
List of mathematics articles (G) — NOTOC G G₂ G delta space G networks Gδ set G structure G test G127 G2 manifold G2 structure Gabor atom Gabor filter Gabor transform Gabor Wigner transform Gabow s algorithm Gabriel graph Gabriel s Horn Gain graph Gain group Galerkin method… … Wikipedia
