Deep Learning Compiler Optimization Systematic Literature Dossier
Reviews state-of-the-art compiler and intermediate representation literature to guide ML execution engine engineering.
Use this template when conducting an advanced research review on intermediate representations, graph transformations, and polyhedral optimizations for machine learning workloads across custom hardware backends.
Role: Staff AI Systems Research Engineer specializing in deep learning compilation, intermediate representations, and tensor runtime optimization.
Context
- Workload architecture family: {{model_architecture_family}}
- Target hardware execution backends: {{target_hardware_backends}}
- Research literature corpus: {{source_paper_corpus}}
- Core optimization primitives: {{optimization_primitives}}
- Memory bandwidth and compute limits: {{memory_bandwidth_limits}}
- Framework integration target: {{framework_integration_target}}
Task
Author a comprehensive academic literature review report that analyzes compiler techniques across {{source_paper_corpus}}, assessing automated fusion, layout transformation, and code generation strategies for {{model_architecture_family}} executing on {{target_hardware_backends}}.
Method
- Review the intermediate representation (IR) designs in {{source_paper_corpus}}, comparing multi-level IRs (e.g., MLIR dialects) against single-level tensor graph representations.
- Trace graph-level optimizations, evaluating operator fusion heuristics, constant folding, and dead code elimination techniques.
- Analyze loop transformation and polyhedral optimization strategies detailed in the papers for tensor contraction workloads.
- Examine auto-tuning algorithms (e.g., cost models, reinforcement learning, genetic search) for tiling and layout selection under {{memory_bandwidth_limits}}.
- Evaluate hardware-specific codegen approaches targeting compute units and scratchpad memory within {{target_hardware_backends}}.
- Compare quantization-aware compilation and mixed-precision lowering mechanisms reported in the literature.
- Assess engineering integration complexity for {{framework_integration_target}}, pinpointing missing compiler passes or execution runtime overheads.
- Formulate a comparative taxonomy of compiler frameworks based on compilation latency, peak memory utilization, and inference speedup.
Constraints
- MUST provide mathematical and algorithmic descriptions of optimization passes discussed in {{source_paper_corpus}}.
- MUST evaluate memory footprint implications (SRAM/HBM) specifically for {{memory_bandwidth_limits}}.
- MUST NOT rely on marketing benchmarks; critique published baseline fairness and hardware configurations.
- Keep all analyses grounded in system-level concepts such as instruction cache pressure, memory coalescing, and PCIe/NVLink overheads.
Output format
Deliver an advanced technical literature review containing:
- Executive Summary & State-of-the-Art Landscape (max 300 words)
- IR Design & Graph Rewriting Comparative Analysis
- Kernel Generation & Polyhedral Transformation Audit
- Hardware Mapping & Memory Subsystem Efficiency Assessment (structured table)
- Gap Analysis & Production Adoption Strategy for {{framework_integration_target}}
Self-review
- Confirm that every technique in {{optimization_primitives}} is explicitly assessed against {{source_paper_corpus}}.
- Ensure compute and memory trade-offs reflect the specific hardware architecture of {{target_hardware_backends}}.
- Verify that compiler pass limitations are clearly distinguished from theoretical framework capabilities.
Explicit role, a named task, and discrete steps the model can follow.
Background, inputs and variables the model needs before it starts.
Hard boundaries — what the model must and must not do.
A named, field-level shape for the response.
Ordered work items that force analysis before an answer.
Length and structure that travel across frontier models.
Signal density — instruction weight without padding.
Documented variables so the scaffold adapts to new inputs.
Quality bar, assumptions and behaviour when inputs are thin.
How much real usage the template has behind it.