Conditional Constant PropagationEngineeringCompiler TechnologyComputational ComplexitySoftware AnalysisMotion CaptureKinematicsCompilersDynamic CompilationCompiler SupportMotion SynthesisComputer EngineeringComputer ScienceProgram OptimizationOptimizing CompilerGlobal CongruenceProgram AnalysisCode Motion RequirementsMotion GraphicsMotion Analysis
We believe that optimizing compilers should treat the machine-independent optimizations (e.g., conditional constant propagation, global value numbering) and code motion issues separately.’ Removing the code motion requirements from the machine-independent optimization allows stronger optimizations using simpler algorithms. Preserving a legal schedule is one of the prime sources of complexity in algorithms like PRE [18, 13] or global congruence finding [2, 20].
17
Register allocation & spilling via graph coloring
Gregory J. Chaitin · ACM SIGPLAN Notices · 1982 · 758 citations · Full text
Register allocation & spilling via graph coloring
Gregory J. Chaitin · 1982 · 661 citations