Array Recovery and High-Level Transformations for DSP Applications

ACM Transactions on Embedded Computing Systems

Volumn 2, Issue 2, 2003, Pages 132-162

  Franke, Björn ^a   O'boyle, Michael ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Algorithms; dataflow graphs; embedded processors; Experimentation; high level transformations; Measurement; Pointer conversion

Indexed keywords

EID: 1142271338     PISSN: 15399087     EISSN: 15583465     Source Type: Journal    
DOI: 10.1145/643470.643472     Document Type: Article

References (32)

1. Allen, R. and Johnson, S. 1988. Compiling C for vectorization, parallelization, and inline expansion, In Proceedings of the SIGPLAN '88 Conference of Programming Languages Design and Implementation (Atlanta, GA, June 1988)
2. Andreyev, A. L., Balyakhov, D. I., and Russakov, V. P. 1996. The technique of high-level optimization of DSP algorithms implementation, International Conference on Signal Processing Applications & Technology (ICSPAT), 1996
3. De Araujo, G. C. S. 1997. Code generation algorithms for digital signal processor. Dissertation, Princeton University, Dep. Electrical Engineering
4. Bacon, D. F., Graham, S. L., and Sharp, O. J. 1994. Compiler transformations for high-performance computing. ACM Comput. Surv. 26, 4, (1994), 345-420
5. Barreteau, M. et al. 1998. OCEANS optimising compilers for embedded applications, In Proceedings Euro-Par 98, LNCS 1470 (1998), 1123-1130
6. Bhattacharyya, S. S., Leupers, R., and Marwedel, P. 2000. Software synthesis and code generation for signal processing systems. IEEE Trans. Circuits Syst. II: Analog and Digital Signal Processing, 47, 9
7. Bodin, F., Chamski, Z., Eisenbeis, C., Rohou, E., and Seznec, A. 1998. GCDS: A compiler strategy for trading code size against performance in embedded applications. INRIA, Tech. Rep. RR-3346
8. Callahan, D., Cooper K. D., Kennedy, K., and Torczon, L. 1986. Interprocedural constant propagation. In Proceedings of the SIGPLAN Symposium on Compiler Construction (1986), 152-161
9. Clauss, P. 1996. Counting solutions to linear and nonlinear constraints through ehrhart polynomials: applications to analyze and transform scientific programs. In Proceedings of the 1996 International Conference on Supercomputing (Philadelphia, PA, May 1996), ACM Press, 278-285
10. Duesterwald, E., Gupta, R., and Soffa, M. 1993. A practical data flow framework for array reference analysis and its use in optimizations. In Proceedings of the SIGPLAN Conference on Programming Languages Design and Implementation, (Albuquerque, NM, 1993), 67-77
11. Franke, B. and O'boyle, M. 2001. Compiler transformation of pointers to explicit array accesses in DSP applications. In Proceedings ofETAPS CC 2001 (Genova, Italy, 2001)
12. Frederiksen, A., Christiansen, R., Bier, J., and Koch, P. 2000. An evaluation of compiler-processor interaction for DSP applications. In Proceedings of the 34th IEEEAsilomar Conference on Signals, Systems, and Computers (Pacific Grove, CA, Oct. 2000)
13. Grove, D. and Torczon, L. 1993. Interprocedural constant propagation: A study of jump function implementations. In Proceedings of the ACM SIGPLAN '93 Conference on Programming Language Design and Implementation (1993), 90-99
14. Gupta, S., Miranda, M., Catthoor, F., and Gupta, R. 2000. Analysis of high-level address code transformations for programmable processors. In Proceedings of Design and Test in Europe Conference (DATE, 2000)
15. Kandemir, M., Vijaykrishnan, N., Irwin, M. J., and Kim, H. S. 2000. Experimental evaluation of energy behavior of iteration space tiling. In Proceedings of the International Workshop on Languages and Compilers for Parallel Computing (Yorktown Heights, NY, Aug. 2000)
16. Kandemir, M., Ramanujam, J., and Choudhary, A. 1999. Improving cache locality by a combination of loop and data transformations. IEEE Trans. Comput. 48, 2 (Feb. 1999), 159-167
17. Kisuki, T., Knijnenburg, P. M. W., and O'Boyle, M. F. P. 2000. Combined selection of tile sizes and unroll factors using iterative compilation. In Proceedings of PACT 2000, Parallel Architectures and Compiler Technology (Oct. 2000), IEEE Press, 237-248
18. Liem, C., Paulin, P., and Jerraya, A. 1996. Address calculation for retargetable compilation and exploration of instruction set architecture. In Proceedings of the 33rd ACM Design Automation Conference (DAC, Las Vegas, NV, 1996)
19. Leupers, R. 1998. Novel code optimzation techniques for DSPs. In Proceedings of the 2nd European DSP Education and Research Conference (Paris, 1998)
20. Maydan, D. E., Hennessy, J. L., and Lam, M. S. 1995. Effectiveness of data dependence analysis, Int. J. Parallel Program. 23, 1, (1995), 63-81
21. Morgan, R. 1998. Building an Optimizing Compiler. Butterworth-Heinemann, Boston, MA
22. O'Boyle M. F. P. and Knijnenburg, P. M. W. 1998. Integrating loop and data transformations for global optimisation. In Proceedings of PACT'98, Parallel Architectures and Compiler Technology (Oct. 1998), IEEE Press, 12-19
23. Pugh, W. 1994. Counting solutions to presburger formulas: How and why. In Proceedings of the SIGPLAN Conference on Programming Languages Design and Implementation, ACM Press, 1994, 121-134
24. Sagiv, M., Reps, T., and Horwitz, S. 1995. Precise interprocedural dataflow analysis with applications to constant propagation. In Proceedings of the TAPSOFT'95 Conference (Arhus, Denmark), LNCS, Springer-Verlag, 1995, 49-61
25. Sair, S., Kaeli, D. K., and Meleis, W. 1998. A study of loop unrolling for VLIW-based DSP processors. In Proceedings of the 1998 IEEE Workshop on Signal Processing Systems (SiPS '98, Oct. 1998), 519-527
26. Song, Y. and Lin, Y. 2000. Unroll-and-jam for imperfectly-nested loops in DSP applications. In Proceedings of the ACM International Conference on Compilers, Architectures, Synthesis for Embedded Systems (Nov. 2000)
27. Su, B., Wang, J., and Esguerra, A. 1999. Source-level loop optimization for DSP code generation. In Proceedings of the 1999 IEEE International Conference on Acoustic, Speech and Signal Processing (ICASSP '99, Phoenix, AZ, 1999), 2155-2158
28. Van Swaaij, M. F. X. B., Franssen, F. H. M., Catthoor, F. V. M., and De Man, H. J. 1992. Automatimg high level control flow transformations for DSP memory management. In Proceedings of the IEEE Workshop on VLSI Signal Processing, (Napa Valley, CA, Oct. 1992). Also in VLSI Signal Processing V, K. Yao, R. Jain, W. Przytula (Eds.), IEEE Press, New York, 397-406
29. Timmer, A., Strik, M., Van Meerbergen, J., and Jess, J. 1995. Conflict modelling and instruction scheduling in code generation for in-house DSP cores. In Proceedings of the 1995 Design Automation Conference (1995), 593-598
30. Van Engelen, R. and Gallivan, K. 2001. An efficient algorithm for pointer-to-array access conversion for compiling and optimizing DSP applications. In Proceedings of the International Workshop on Innovative Architecture (IWIA 2001, Maui, 2001)
31. Wang, J. and Su, B. 1998. Software pipelining of nested loops for real-time DSP applications, In Proceedings of the 1998IEEE International Conference on Acoustic, Speech and Signal Processing (ICASSP '98, Seattle, WA, 1998)
32. Zivojnovic, V., Velarde, J. M., Schlager, C., and Meyr, H. 1994. DSPstone: A DSP-oriented benchmarking methodology, In Proceedings of Signal Processing Applications & Technology Conference (Dallas, TX, 1994)