NDLI: Flow-based partitioning and position constraints in VLSI placement

Content Provider	IEEE Xplore Digital Library
Author	Struzyna, M.
Copyright Year	2011
Description	Author affiliation: Research Institute for Discrete Mathematics, University of Bonn, Lennéstr. 2, 53113 Bonn, Germany (Struzyna, M.)
Abstract	This paper presents a new quadratic, partitioning-based placement algorithm which is able to handle non-convex and overlapping position constraints to subsets of cells, the movebounds. Our new flow-based partitioning (FBP) combines a global MinCostFlow model for computing directions with extremely fast and highly parallelizable local realization steps. Despite its global view, the size of the MinCostFlow instance is only linear in the number of partitioning regions and does not depend on the number of cells. We prove that our partitioning scheme finds a (fractional) solution for any given placement or decides in polynomial time that none exists. In practice, BonnPlace with FBP can place huge designs with almost 10 million cells and dozens of movebounds in 90 minutes of global placement. On instances with movebounds, the netlengths of our placements are more than 32% shorter than RQL's [25] and our tool is 9–20 times faster. Even without movebounds, the FBP improves the quality and runtime of BonnPlace significantly and our tool shows the currently best results on the latest placement benchmarks [16].
Starting Page	1
Ending Page	6
File Size	159931
Page Count	6
File Format	PDF
ISBN	9781612842080
ISSN	15301591
e-ISBN	9783981080186
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-03-14
Publisher Place	France
Access Restriction	Subscribed
Rights Holder	European Design Automation Association (EDAA)
Subject Keyword	Partitioning algorithms Runtime Computational modeling Law Transportation Benchmark testing
Content Type	Text
Resource Type	Article

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

A scaled LSE wirelength model for VLSI global placement

Fast floorplanning with placement constraints

Multichip module placement with heat consideration

Scalable high-quality 1D partitioning

Loop based scheduling for high level synthesis

A Discrete FireFly Algorithm for VLSI Circuit Partitioning

An investigation of parallel memetic algorithms for VLSI circuit partitioning on multi-core computers

Efficient Network Flow Based Min-cut Balanced Partitioning

An Overlap Removal Algorithm for Macrocell Placement in VLSI Layouts

Flow-based partitioning and position constraints in VLSI placement

Similar Documents

A scaled LSE wirelength model for VLSI global placement

Fast floorplanning with placement constraints

Multichip module placement with heat consideration

Scalable high-quality 1D partitioning

Loop based scheduling for high level synthesis

A Discrete FireFly Algorithm for VLSI Circuit Partitioning

An investigation of parallel memetic algorithms for VLSI circuit partitioning on multi-core computers

Efficient Network Flow Based Min-cut Balanced Partitioning

An Overlap Removal Algorithm for Macrocell Placement in VLSI Layouts

Flow-based partitioning and position constraints in VLSI placement