ELF-SP - evolutionary algorithm for non-slicing floorplans with soft modules

We present an evolutionary strategy based algorithm which generates a topology for a non-slicing floorplan, represented as a sequence pair. Our search procedure uses large population of solutions to simultaneously explore multiple solution regions. Lagrangian relaxation is used only once on the final hard-module placements to adjust aspect ratios for the soft modules. Our soft-module results on MCNC benchmarks surpass other recently published results.

[1]  Yao-Wen Chang,et al.  TCG: a transitive closure graph-based representation for non-slicing floorplans , 2001, DAC '01.

[2]  H. Murata,et al.  Rectangle-packing-based module placement , 1995, ICCAD 1995.

[3]  Martin D. F. Wong,et al.  A New Algorithm for Floorplan Design , 1986, 23rd ACM/IEEE Design Automation Conference.

[4]  Ernest S. Kuh,et al.  Sequence-pair based placement method for hard/soft/pre-placed modules , 1998, ISPD '98.

[5]  David B. Fogel,et al.  Evolutionary Computation: Towards a New Philosophy of Machine Intelligence , 1995 .

[6]  Takeshi Yoshimura,et al.  An O-tree representation of non-slicing floorplan and its applications , 1999, DAC '99.

[7]  Yici Cai,et al.  Corner block list: an effective and efficient topological representation of non-slicing floorplan , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).

[8]  David B. Fogel.  What is evolutionary computation , 1995 .

[9]  Evangeline F. Y. Young,et al.  Handling soft modules in general nonslicing floorplan usingLagrangian relaxation , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  C. L. Liu,et al.  A New Algorithm for Floorplan Design , 1986, DAC 1986.

[11]  Michael K. H. Fan,et al.  On convex formulation of the floorplan area minimization problem , 1998, ISPD '98.

[12]  Martin D. F. Wong,et al.  FAST-SP: a fast algorithm for block placement based on sequence pair , 2001, ASP-DAC '01.