Pages that link to "Loop unrolling"
Jump to navigation
Jump to search
Showing 50 items.
- Assembly language (links | edit)
- Functional programming (links | edit)
- PDF (links | edit)
- Optimizing compiler (links | edit)
- Partial evaluation (links | edit)
- Constant folding (links | edit)
- Harvard Mark I (links | edit)
- Template metaprogramming (links | edit)
- Inline expansion (links | edit)
- Program optimization (links | edit)
- Copy-and-paste programming (links | edit)
- Lookup table (links | edit)
- Jump threading (links | edit)
- Register renaming (links | edit)
- Duff's device (links | edit)
- Dead-code elimination (links | edit)
- Strength reduction (links | edit)
- Register allocation (links | edit)
- Common subexpression elimination (links | edit)
- Loop unswitching (links | edit)
- Loop splitting (links | edit)
- Explicitly parallel instruction computing (links | edit)
- Space–time tradeoff (links | edit)
- Loop nest optimization (links | edit)
- Loop-invariant code motion (links | edit)
- Data-flow analysis (links | edit)
- Loop unrolling (transclusion) (links | edit)
- Instruction scheduling (links | edit)
- Use-define chain (links | edit)
- Rematerialization (links | edit)
- Sparse conditional constant propagation (links | edit)
- Copy propagation (links | edit)
- Loop optimization (links | edit)
- Loop interchange (links | edit)
- Instruction selection (links | edit)
- Loop inversion (links | edit)
- Partial-redundancy elimination (links | edit)
- Automatic parallelization (links | edit)
- Automatic vectorization (links | edit)
- Peephole optimization (links | edit)
- Bounds-checking elimination (links | edit)
- Don't repeat yourself (links | edit)
- Loop fission and fusion (links | edit)
- Array-access analysis (links | edit)
- Induction variable (links | edit)
- Software pipelining (links | edit)
- Live-variable analysis (links | edit)
- Key stretching (links | edit)
- Alias analysis (links | edit)
- Trace scheduling (links | edit)