Tree-based mapping of algorithms to predefined structures
- 30 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Due to the need for fast design cycles and low production cost, programmable targets like DSP processors are becoming increasingly popular. Design planning, detailed design as well as updating such designs requires mapping existing algorithms onto these targets. Instead of writing target-specific mappers, we propose using retargetable mappers. The technique reported in this paper is based on pattern matching. Binary code is generated as a result of this matching process. This paper describes the techniques of our mapper MSSV and identifies areas for improvements. As a result, it shows that efficient handling of alternative mappings is crucial for an acceptable performance.Keywords
This publication has 4 references indexed in Scilit:
- Flow graph machine models in microcode synthesisACM SIGMICRO Newsletter, 1983
- Retargetable Compiler Code GenerationACM Computing Surveys, 1982
- Local Code Generation and Compaction in Optimizing Microcode CompilersPublished by Defense Technical Information Center (DTIC) ,1982
- The MPG System: A Machine-Independent Efficient Microprogram GeneratorIEEE Transactions on Computers, 1981