论文信息 - An enhanced genetic solution for scheduling, module allocation, and binding in VLSI design

An enhanced genetic solution for scheduling, module allocation, and binding in VLSI design

This paper presents a novel approach to the high-level synthesis problems of scheduling, module allocation, and module binding for behavioral descriptions. A very general version of this problem is considered where modules may perform different operations in different numbers of control steps. These inherently interdependent problems are solved using an Enhanced Genetic Algorithm (EGA) which is both more robust and more efficient than the simple GA.

Gary William Grewal | Thomas Charles Wilson | T. C. Wilson | G. Grewal

[1] Nandini Mukherjee. An ILP Solution for Optimum Scheduling, Module and Register Allocation, and Operation Binding in Datapath Synthesis , 1995 .

[2] Mohamed I. Elmasry,et al. Simultaneous scheduling and allocation for cost constrained optimal architectural synthesis , 1991, DAC '91.

[3] Christos A. Papachristou,et al. A linear program driven scheduling and allocation method followed by an interconnect optimization algorithm , 1991, DAC '90.

[4] Pierre Gaston Paulin. High-level synthesis of digital circuits using global scheduling and binding algorithms , 1988 .

[5] Robert H. Storer,et al. Datapath synthesis using a problem-space genetic algorithm , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6] Hugh M. Cartwright,et al. Looking Around: Using Clues from the Data Space to Guide Genetic Algorithm Searches , 1991, ICGA.

[7] Bozena Kaminska,et al. Functional synthesis of digital systems with TASS , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8] Gilbert Syswerda,et al. The Application of Genetic Algorithms to Resource Scheduling , 1991, International Conference on Genetic Algorithms.

[9] T. C. Wilson,et al. An ILP Solution for Optimum Scheduling, Module and Register Allocation, and Operation Binding in Datapath Synthesis , 1995, VLSI Design.