NDLI: Constrained floorplanning using network flows

Content Provider	IEEE Xplore Digital Library
Author	Yan Feng Mehta, D.P. Yang, H.
Copyright Year	1982
Abstract	This paper presents algorithms for a constrained version of the "modern" floorplanning problem proposed by Kahng in "Classical Floorplanning Harmful?" (Kahng, 2000). Specifically, the constrained modern floorplanning problem (CMFP) is suitable when die-size is fixed, modules are permitted to have rectilinear shapes and, in addition, the approximate relative positions of the modules are known. This formulation is particularly useful in two scenarios: 1) assisting an expert floorplan architect in a semiautomated floorplan methodology and 2) in incremental floorplanning. CMFP is shown to be negative-positive hard. An algorithm based on a max-flow network formulation quickly identifies input constraints that are impossible to meet, thus permitting the floorplan architect to modify these constraints. Three algorithms [Breadth First Search (BFS), Improved BFS (IBFS), Compromise BFS (CBFS)] based on using BFS numbers to assign costs in a min-cost max-flow network formulation are presented. Experiments on standard benchmarks demonstrate that IBFS is fast and effective in practice.
Sponsorship	IEEE Council on Electronic Design Automation IEEE Circuits and Systems Society
Starting Page	572
Ending Page	580
Page Count	9
File Size	657528
File Format	PDF
ISSN	02780070
Volume Number	23
Issue Number	4
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2004-04-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Shape Design automation Wire Design methodology Costs Flow graphs Clocks Context modeling Simulated annealing Packaging
Content Type	Text
Resource Type	Article
Subject	Computer Graphics and Computer-Aided Design Electrical and Electronic Engineering Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Module relocation to obtain feasible constrained floorplans

Traffic: a novel geometric algorithm for fast wire-optimized floorplanning

A New Multilevel Framework for Large-Scale Interconnect-Driven Floorplanning

A linear programming-based algorithm for floorplanning in VLSI design

Global Wiring by Simulated Annealing

Fixed-outline floorplanning: enabling hierarchical design

Improving Simulated Annealing-Based FPGA Placement With Directed Moves

An analytical approach to floorplanning for hierarchical building blocks layout (VLSI)

Throughput-driven floorplanning with wire pipelining

Constrained floorplanning using network flows

Similar Documents

Module relocation to obtain feasible constrained floorplans

Traffic: a novel geometric algorithm for fast wire-optimized floorplanning

A New Multilevel Framework for Large-Scale Interconnect-Driven Floorplanning

A linear programming-based algorithm for floorplanning in VLSI design

Global Wiring by Simulated Annealing

Fixed-outline floorplanning: enabling hierarchical design

Improving Simulated Annealing-Based FPGA Placement With Directed Moves

An analytical approach to floorplanning for hierarchical building blocks layout (VLSI)

Throughput-driven floorplanning with wire pipelining

Constrained floorplanning using network flows