1. Compilers for Embedded Systems Ram, Vasanth, and VJ Instructor : Dr. Edwin Sha Synthesis and Optimization of High-Performance Systems

2. Outline Compiler – the bottleneck Memory Optimization Techniques Re-targetability

3. Embedded System Development Software Development Hardware Development Integration

4. Requirements of Good Software Complexity PerfPerf

5. Requirements of Good Hardware Complexity PerfPerf

6. Compilers Software Hardware Bad Compiler Complexity PerfPerf Software Hardware Good Compiler Complexity PerfPerf

7. Next… Compiler – the bottleneck Memory Optimization Techniques Re-targetability

8. Optimization Techniques Platform independent Architecture specific Memory address generation

9. Platform Independent Techniques Loop transformation Data reuse Processor partitioning

10. Architecture Specific Techniques Memory modeling optimization Register allocation – graph coloring Custom memory architecture

11. Memory Address Generation General compilers – generated addresses are periodic Embedded systems – address sequence might not be periodic

12. Next… Compiler – the bottleneck Memory Optimization Techniques Re-targetability

13. Retargetable Code Generation Code must be applicable to a range of different targets Two Levels Portability Target Independence

14. Why Retargetability? Processor architectures differ from application to application Designing compilers quickly and economically.

15. Approaches Interpretive Code Generation Pattern Matched Code Generation

16. Interpretive Code Generation Generate code for virtual machine and expand it to real target Disadvantage Design a lot of virtual machines! Not fully portable

17. Pattern Matched Code Generation Pattern matching (tree) replaces interpretation. Disadvantage Creating pattern tree structures is hard No instructions may match pattern tree!

18. Conclusion Efficient compilers – hard job. Assembly code – increased time to market Lot of research in the field of code generation for embedded systems.