Instruction-set matching and GA-based selection for embedded-processor code generation

• Published in: Proceedings of 9th International Conference on VLSI Design pp. 73 - 76
• Main Authors: Shu, J., Wilson, T.C., Banerji, D.K.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 1996
• Subjects: Application specific processors; Computational Intelligence Society; Computer aided instruction; Computer architecture; Digital signal processing; Electronic mail; Genetic algorithms; Information science; Pattern matching; Tree data structures
• ISBN: 0818672285; 9780818672286
• ISSN: 1063-9667; 2380-6923
• DOI: 10.1109/ICVD.1996.489459

The core tasks of retargetable code generation are instruction-set matching and selection for a given application program and a DSP/ASIP processor. In this paper, we utilize a model of target architecture specification that employs both behavioral and structural information, to facilitate this process. The matching method is based on a pattern tree structure of instructions. This tree structure, generated automatically, is implemented by using a pattern queue and a flag table. The matching process is efficient since it bypasses many patterns in the tree which do not match at certain nodes in the DFG of given application program. Two genetic algorithms are implemented for pattern selection: a pure GA which uses standard GA operators, and a GA with backtracking which employs variable-length chromesomes. Optimal or near-optimal pattern selection is obtained in a reasonable period of time for a wide range of application programs.