System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Shu, J. ; Dept. of Comput. & Inf. Sci., Guelph Univ., Ont., Canada ; Wilson, T.C. ; Banerji, D.K.

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

Published in:

VLSI Design, 1996. Proceedings., Ninth International Conference on

Date of Conference:

3-6 Jan 1996