Practical slicing and non-slicing block-packing without simulated annealing

  • Authors:
  • Hayward H. Chan;Igor L. Markov

  • Affiliations:
  • The University of Michigan, Ann Arbor, MI;The University of Michigan, Ann Arbor, MI

  • Venue:
  • Proceedings of the 14th ACM Great Lakes symposium on VLSI
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose a new floorplanner BloBB based on multi-level branch-and-bound. It is competitive with annealers in terms of runtime and solution quality. We empirically quantify the gap between optimal slicing and non-slicing floorplans by comparing optimal packings and best seen results. Optimal slicing and non-slicing packings for apte, xerox and hp are reported. We also discover that the soft versions of all MCNC benchmarks, except for apte, and all GSRC benchmarks can be packed with zero dead-space.Additionally, realistic floorplans often have blocks with similar dimensions, if design blocks, such as memories, are reused. We show that this greatly reduces the complexity of black-packing.