ConceptSystems & CS
Compiler optimization
Compiler flags such as -O3 that automatically improve execution speed of code.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
2Each in their own terms, from the easiest level.
Hal Abelson & Gerald Jay Sussman
The process of eliminating unnecessary stack operations and register saves that an interpreter would require because the compiler knows the structure of the code and the exact needs of subexpressions.
Lectures that assume it
17The first 12 are shown.
- Introduction and Matrix Multiplication
- Read-Copy-Update (RCU)
- Bentley Rules for Optimizing Work
- Bit Hacks
- Thinking Like a Compiler: Program Obfuscation from the Other Side
- Register Machines (SICP Lecture 9a)
- High Performance in Dynamic Languages
- Advanced Branch Prediction
- What Compilers Can and Cannot Do
- User-Defined Function Optimizations
- Domain Specific Languages and Autotuning
- Dataflow, Superscalar Execution & Branch Prediction
Connections
25The lectures that define it or assume it, and the concepts next to it.
Lectures19
- Tuning a TSP Algorithm
- Structure and Interpretation of Computer Programs (SICP): Data Abstraction and Closure
- Introduction and Matrix Multiplication
- Read-Copy-Update (RCU)
- Bentley Rules for Optimizing Work
- Bit Hacks
Show 13 moreShow fewer
- Thinking Like a Compiler: Program Obfuscation from the Other Side
- Register Machines (SICP Lecture 9a)
- High Performance in Dynamic Languages
- Advanced Branch Prediction
- What Compilers Can and Cannot Do
- User-Defined Function Optimizations
- Domain Specific Languages and Autotuning
- Dataflow, Superscalar Execution & Branch Prediction
- VLIW and Systolic Array Architectures
- Compiler 2.0: Building the Next Generation of Compilers with Machine Learning
- Vectorized Query Execution Using SIMD
- Data Parallel Haskell
- Functional Mechanical Sympathy