Graph-based code selection techniques for embedded prrsocesso

ACM Transactions on Design Automation of Electronic Systems

Volumn 5, Issue 4, 2000, Pages 794-814

  Leupers, Rainer ^a   Bashford, Steven ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Code selection; Data flow graphs; Embedded processors; Irregular data paths; Simd instructions

Indexed keywords

EID: 23044527555     PISSN: 10844309     EISSN: None     Source Type: Journal    
DOI: 10.1145/362652.362661     Document Type: Article

References (23)

1. AHO, A. V., GANAPATHI, M., AND TJIANG, S. W. K. 1989. Code generation using tree matching and dynamic programming. ACM Transactions on Programming Languages and Systems 11, 4, 491-516.
2. AHO, A. V., AND JOHNSON, S. C. 1976. Optimal code generation for expression trees, Journal of the ACM, 23, 3.
3. ARAUJO, G., MALIK, S., AND LEE, M. 1996. Using register transfer paths in code generation for heterogeneous memory-register architectures. In 33rd Design Automation Conference (DAC).
4. BASHFORD, S. AND LEUPERS R. 1999. Phase-coupled mapping of data flow graphs to irregular data paths. In Design Automation for Embedded Systems, 4, 2/3, Kluwer Academic Publishers.
5. CHAITIN, G. J. 1982. Register allocation and spilling via graph coloring. In ACM SIGPLAN Symposium on Compiler Construction. Eindhoven University of Technology, ftp.es.ele.tue.nl/pub/lp_solve.
6. ERTL, M. A. 1999. Optimal code selection in DAGs. In ACM Symposium on Principles of Programming Languages (POPL).
7. FISHER, R. J. AND DIETZ, H. J. 1998. Compiling for simd within a register. In 11th Annual Workshop on Languages and Compilers for Parallel Computing (LCPC98).
8. FRASER, C. W., HANSON, D. R., AND PROEBSTING, T. A. 1992. Engineering a simple, efficient code generator, ACM Letters on Programming Languages and Systems, 1, 3.
9. GLANVILLE, R. S. 1977. A Machine Independent Algorithm for Code Generation and its Use in Retargetable Compilers. Ph.D. thesis, University of California at Berkeley.
10. INTEL. 1998. MMX Technology Application Notes, http://developer.intel.com/drg/mmx/appnotes.
11. LANCE V1.0 Software and User's Guide, 2000. University of Dortmund, Dept. of Computer Science 12, IS12-www.cs.uni-dortmund.de/_leupers.
12. LEUPERS, R. AND MARWEDEL, P. 1996. Instruction selection for embedded DSPs with complex instructions, In European Design Automation Conference (EURO-DAC).
13. LIAO, S., DEVADAS, S., KEUTZER, K., AND TJIANG, S. 1995. Instruction selection using binate covering for code size optimization, In International Conference on Computer-Aided Design (ICCAD), 1995, 393-399
14. MARRIOTT, K. AND STUCKEY, P. J. 1998. Programming with Constraints: An Introduction, The MIT Press.
15. MARWEDEL, P. AND GOOSSENS, G. (EDs.) 1995. Code Generation for Embedded Processors. Kluwer Academic Publishers.
16. PELEG, A., WILKIE, S., AND WEISER, U. 1997. Intel MMX for Multimedia PCs. Communications of the ACM, 40, 1.
17. PHILIPS. 1998. http://www.trimedia.philips.com.
18. TEXAS INSTRUMENTS. 1998. TMS320C62xx CPU and Instruction Set Reference Guide, http://www.ti.com/sc/c6x.
19. VAN HENTENRYCK, P. 1989. Constraint Satisfaction in Logic Programming. The MIT Press.
20. WALLACE, M. 1995. Constraint Programming. Contact address: IC-Parc, William Penney Laboratory, Imperial College, London SW7 2AZ, email: mgw@doc.ic.ac.uk. Publications at http://www.icparc.ic.ac.uk/.
21. e: A Platform for Constraint Logic Programming. Contact address: IC-Parc, William Penney Laboratory, Imperial College, London SW7 2AZ, email: mgw@doc.ic.ac.uk.
22. WILHELM, R. AND MAURER, D. 1995. Compiler Design, Addison-Wesley.
23. ZIVOJNOVIC, V., VELARDE, J. M., SCHLaGER, C. AND MEYR, H. 1994. DSPStone - a dsp-oriented bench-marking methodology. In International Conference on Signal Processing Applications and Technology (ICSPAT).