论文信息 - Tree-based mapping of algorithms to predefined structures

Tree-based mapping of algorithms to predefined structures

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.

Peter Marwedel

[1] Peter Marwedel,et al. Verification of Hardware Descriptions by Retargetable Code Generation , 1989, 26th ACM/IEEE Design Automation Conference.

[2] Steven R. Vegdahl,et al. Local code generation and compaction in optimizing microcode compilers , 1982 .

[3] Farhad Mavaddat,et al. Data-Path Synthesis as Grammar Inference , 1992, Synthesis for Control Dominated Circuits.

[4] Charles N. Fischer,et al. Retargetable Compiler Code Generation , 1982, CSUR.

[5] Peter Marwedel,et al. MSSV: Tree-Based Mapping of Algorithms to Prede ned Structures (Extended Version) , 1993 .

[6] Robert A. Mueller,et al. Flow graph machine models in microcode synthesis , 1983, SIGM.

[7] Rainer Leupers,et al. Retargetable assembly code generation by bootstrapping , 1994, Proceedings of 7th International Symposium on High-Level Synthesis.