• Placement of a contiguous code section (loop or function) in memory such that the address of the first byte is divisible by a power of two. Such a code section is called n-byte aligned.
  • Placement of contiguous data (such as a variable or C/C++ struct/class) in memory such that the address is divisible by a power of two. You may achieve better performance if data is aligned, at least, to its size.
  • The number of times a loop is invoked.
  • A part of CPU core that reads instructions from memory, decodes them, and sends them to the execution core (back-end). Under certain circumstances, the front-end may process too few instructions per clock cycle, which results in under-utilization of the back-end.
  • A programming language construct that specifies how a compiler should process input. Same as a C/C++ pragma.
  • Moving a variable from main memory to a register. Using variables in registers instead of main memory results in better performance.
  • Fused multiply-add instructions that improve the performance and accuracy of floating-point computations. Sample syntax: A = +A * B + C. These instructions are faster because the computation is not performed in steps, and more accurate because intermediate results are treated as infinite precision, with rounding done on store.
  • Command line for invoking the Intel® C Compiler on the Linux* platform. Often used as a shorthand for referring to the compiler.
  • Command line for invoking the Intel® C/C++ Compiler on the Microsoft Windows* platform. Often used as a shorthand for referring to the compiler.
  • Command line for invoking the Intel® C++ Compiler on the Linux* platform. Often used as a shorthand for referring to the compiler.
  • Command line for invoking the Intel® Fortran Compiler on the Windows* and Linux* platforms. Often used as a shorthand for referring to the compiler.
  • A vectorized loop (usually) compiler-generated from a source loop. Same as kernel loop.
  • A small, (usually) compiler-generated loop created to align the memory accesses inside the loop body and maximize its efficiency. The compiler peels off any initial iterations containing misaligned accesses, which leaves the remaining iterations’ memory accesses optimally aligned. A peeled loop always has a trip count smaller than the vector length.
  • When the optimal number of registers is unavailable for variable allocation. High register pressure may result in spilling.
  • A (usually) compiler-generated loop created to clean up any remaining iterations that do not fit within the scope of the loop body. The compiler typically generates remainder loops when the source loop trip count is not a multiple of the vector length.
  • Single-instruction-multiple-data. A processor instruction that performs the same operation on multiple pieces of data (such as elements of an array).
  • A developer-written loop as it appears in source code.
  • Moving a variable from a register to main memory. A spilled variable must be loaded in and out of main memory for every read/write operation, resulting in poorer performance.
  • The number of times the body of a loop will execute. Same as iteration count (and sometimes referred to as loop count in Intel compiler documentation).
  • Optimize a loop by duplicating its body, thus reducing the branching overhead and the number of loop iterations that must execute. A complete unroll fully duplicates the loop body such that no repetition is required. A partial unroll of size n duplicates the body n times and reduces the number of iterations to 1/n of the original iteration count.
  • Number of elements that can be processed in the same operation. Ideal vector length = vector register width in bits / data type size in bits.
  • The number of bits in the processor vector registers. Intel® Streaming SIMD Extensions 2 (Intel® SSE2) instructions operate on 128-bit registers; Intel® Advanced Vector Extensions (Intel® AVX) instructions operate on 256-bit registers; Intel® Many Integrated Core Instructions (Intel® MIC Instructions) operate on 512-bit registers.
  • Generate code that takes advantage of processor vectorization hardware, usually by executing SIMD instructions.