VLSI module placement with pre-placed modules and considering congestion using solution space smoothing

Authors:
Sheqin Dong;Xianlong Hong;Xin Qi;Ruijie Wang;Song Chen;Jun Gu
Affiliations:
Tsinghua University, Beijing, P.R.C.;Tsinghua University, Beijing, P.R.C.;Tsinghua University, Beijing, P.R.C.;Tsinghua University, Beijing, P.R.C.;Tsinghua University, Beijing, P.R.C.;University of Hong Kong
Venue:
ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference
Year:
2003

Citing 8
Cited 1

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
On the behavior of congestion minimization during placement

ISPD '99 Proceedings of the 1999 international symposium on Physical design
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
ECBL: an extended corner block list with solution space including optimum placement

Proceedings of the 2001 international symposium on Physical design
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
VLSI/PCB placement with obstacles based on sequence pair

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Deterministic VLSI block placement algorithm using less flexibility first principle

Journal of Computer Science and Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Solution space smoothing allows a local search heuristic to escape from a poor, local minimum. In this paper, we propose a technique that can smooth the rugged terrain surface of the solution space of a placement problem. We design the solution space smoothing algorithms for VLSI placement with pre-placed modules and placement with consideration of congestion. Experiment results demonstrated that solution space smoothing is very efficient for VLSI module placement, and it can be applied to all floorplanning representations proposed so far.