An evolution programming approach on multiple behaviors for the design of application specific programmable processors
- 23 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
This paper proposes an Evolution Programming Approach for behavior-level area-efficient design of ASPPs (Application Specific Programmable Processors). This approach, based on a given behavioral-level kernel, randomly transforms each of the input behaviors, then the behavioral kernel is used in the evolution process to guide the survival of data flow graphs (DFGs). Finally, instead of the given DFGs, the surviving DFGs are used to synthesize a programmable architecture. This leads to an area-efficient design for all the input behaviors. Experimental results indicate this approach is encouraging.Keywords
This publication has 15 references indexed in Scilit:
- Partitioning by regularity extractionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- High level synthesis for reconfigurable datapath structuresPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Percolation based synthesisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Optimizing power using transformationsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1995
- Genetic algorithms: a surveyComputer, 1994
- Area-efficient fault detection during self-recovering microarchitecture synthesisPublished by Association for Computing Machinery (ACM) ,1994
- Genetic Algorithms + Data Structures = Evolution ProgramsPublished by Springer Nature ,1992
- Redundant operator creationPublished by Association for Computing Machinery (ACM) ,1991
- Path-based scheduling for synthesisIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1991
- Flamel: A High-Level Hardware CompilerIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987