Compiling for VLIW DSPs - Signal Processing Systems - page 1186

9 Concluding Remarks

Compilers for VLIW DSP processors need to apply a considerable amount of
advanced optimizations to achieve code quality comparable to hand-written code.
Current advances in general optimization problem solver technology are en-
couraging, and heuristic techniques developed for standard compilers are being
complemented by more aggressive optimizations. For small and medium sized
program parts, even optimal solutions are within reach. Also, most problems in
code generation are strongly interdependent and should be considered together in
an integrated or at least phase-coupled way to avoid poor code quality due to phase
ordering effects. We expect further improvements in optimized and integrated code
generation techniques for VLIW DSPs in the near future.

Acknowledgements The author thanks Mattias Eriksson and Dake Liu for discussions and
commenting on a draft of this chapter. The author also thanks Eric Stotzer from Texas Instruments
for interesting discussions about code generation for the TI 'C6x DSP processor family. This work
was funded by Vetenskapsr adet (project Integrated Software Pipelining ) and SSF (project DSP
platform for emerging telecommunication and multimedia ).

References

1. Alfred V. Aho, Mahadevan Ganapathi, and Steven W.K. Tjiang. Code Generation Using Tree
Matching and Dynamic Programming. ACM Transactions on Programming Languages and
Systems , 11(4):491-516, October 1989.
2. Alexander Aiken and Alexandru Nicolau. Optimal loop parallelization. SIGPLAN Notices ,
23(7):308-317, July 1988.
3. Alex Aleta, Josep M. Codina, Jesus Sanchez, Antonio Gonzalez, and David Kaeli. AGAMOS:
A graph-based approach to modulo scheduling for clustered microarchitectures. IEEE Trans-
actions on Computers , 58(6):770-783, June 2009.
4. Vicki H. Allan, Reese B. Jones, Randall M. Lee, and Stephen J. Allan. Software pipelining.
ACM Computing Surveys , 27(3), September 1995.
5. Analog Devices. TigerSHARC embedded processor ADSP-TS201S. Data sheet, www.analog.
com/en/embedded-processing-dsp/tigersharc , 2006.
6. Andrew W. Appel and Lal George. Optimal Spilling for CISC Machines with Few Registers.
In Proc. ACM conf. on Programming language design and implementation , pages 243-253.
ACM Press, 2001.
7. Guido Araujo and Sharad Malik. Optimal code generation for embedded memory non-
homogeneous register architectures. In Proc. 7th Int. Symposium on System Synthesis ,

pages 36-41, September 1995.
8. Rosa M. Badia, Fermin Sanchez, and Jordi Cortadella. OSP: Optimal Software Pipelining with
Minimum Register Pressure. Technical Report UPC-DAC-1996-25, DAC Dept. d'arquitectura
de Computadors, Univ. Polytecnica de Catalunya, Barcelona, Campus Nord. Modul D6, E-
08071 Barcelona, Spain, June 1996.
9. Vasanth Bala and Norman Rubin. Efficient instruction scheduling using finite state automata.
In Proc. 28th int. symp. on miocroarchitecture (MICRO-28) , pages 46-56. IEEE, 1995.
10. Steven Bashford and Rainer Leupers. Phase-coupled mapping of data flow graphs to irregular
data paths. Design Automation for Embedded Systems (DAES) , 4(2/3):119-165, 1999.