VLSI block placement using less flexibility first principles

Authors:
Sheqin Dong;Xianlong Hong;Youliang Wu;Yizhou Lin;Jun Gu
Affiliations:
Department of Computer Science and Technology, Tsinghua University, Beijing, P.R. China, 100084;Department of Computer Science and Technology, Tsinghua University, Beijing, P.R. China, 100084;Department os Computer Science and Engineering, The Chinese University of Hong Kong;Department of Computer Science and Technology, Tsinghua University, Beijing, P.R. China, 100084;Department of Computer Science, Science & Technology University of Hong Kong
Venue:
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
Year:
2001

Citing 8
Cited 4

Branch-and-bound placement for building block layout

DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
Rectangle-packing-based module placement

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Module placement on BSG-structure and IC layout applications

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Cluster refinement for block placement

DAC '97 Proceedings of the 34th annual Design Automation Conference
An O-tree representation of non-slicing floorplan and its applications

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
A new algorithm for floorplan design

DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Multidimensional binary search trees used for associative searching

Communications of the ACM
Corner block list: an effective and efficient topological representation of non-slicing floorplan

Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design

LFF algorithm for heterogeneous FPGA floorplanning

Proceedings of the 2005 Asia and South Pacific Design Automation Conference
An effective buffer planning algorithm for IP based fixed-outline SOC placement

Proceedings of the 17th ACM Great Lakes symposium on VLSI
Buffer planning for IP placement using sliced-LFF

VLSI Design - Special issue on CAD for Gigascale SoC Design and Verification Solutions
Multi-bend bus-driven floorplanning considering fixed-outline constraints

Integration, the VLSI Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

A deterministic algorithm for VLSI block placement was developed in this paper through human's accumulated experience in solving "packing" problem. Rectangle packing problem is just a simplified case of the polygon-shape stone plate packing problem that the ancient masons needed to face. Several "packing" principles derived from the so-called "less flexibility first" experience of the masons. A k-d tree data structure is used for manipulating the packed rectangles under the derived packing principles. Experiment results demonstrate that the algorithm is effective and promising in building block layout application.