NDLI: A unified method to handle different kinds of placement constraints in floorplan design

Content Provider	IEEE Xplore Digital Library
Author	Young, E.F.Y. Chu, C.C.N. Ho, M.L.
Copyright Year	2002
Description	Author affiliation: Dept. of Comput. Sci. & Eng., Univ. of Hong Kong, China (Young, E.F.Y.)
Abstract	In floorplan design, it is common that a designer will want to control the positions of some modules in final packing for various purposes such as data path alignment, I/O connection, etc.. There are several previous works (Young and Wong, 1998 and 1999; Young et al, 1999; Murata et al, 1997; Chang et al, 2000) focusing on a few particular kinds of placement constraint. In this paper, we present the first "unified method" to handle all of them simultaneously, including pre-placed constraint, range constraint, boundary constraint, alignment, abutment and clustering, etc., in general nonslicing floorplans. We have used incremental updates and an interesting reduced graphs idea to improve the runtime of the algorithm. We tested our method using some benchmark data with about one eighth of the modules having placement constraints and the results are very promising. Good packing with all the constraints satisfied can be obtained efficiently.
Sponsorship	VLSI Soc. India (VSI)
Starting Page	661
Ending Page	667
File Size	346417
Page Count	7
File Format	PDF
ISBN	0769514413
DOI	10.1109/ASPDAC.2002.995011
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2002-01-11
Publisher Place	India
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Data engineering Design engineering Computer science Runtime Clustering algorithms Circuit testing Benchmark testing Very large scale integration Design optimization Circuit optimization
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

Placement constraints in floorplan design

Fast floorplanning with placement constraints

A Unified Method to Handle Different Kinds of Placement Constraints in Floorplan Design

A Unified Method to Handle Different Kinds of Placement Constraints in Floorplan Design

On extending slicing floorplan to handle L/T-shaped modules and abutment constraints

A Unified Method to Handle Different Kinds of Placement Constraints in Floorplan Design (2002)

Cell Merge: A basic-pre-clustering clustering algorithm for placement

A fast hierarchical quadratic placement algorithm

Clustering algorithms for circuit partitioning and placement problems

A unified method to handle different kinds of placement constraints in floorplan design

Similar Documents

Placement constraints in floorplan design

Fast floorplanning with placement constraints

A Unified Method to Handle Different Kinds of Placement Constraints in Floorplan Design

A Unified Method to Handle Different Kinds of Placement Constraints in Floorplan Design

On extending slicing floorplan to handle L/T-shaped modules and abutment constraints

A Unified Method to Handle Different Kinds of Placement Constraints in Floorplan Design (2002)

Cell Merge: A basic-pre-clustering clustering algorithm for placement

A fast hierarchical quadratic placement algorithm

Clustering algorithms for circuit partitioning and placement problems

A unified method to handle different kinds of placement constraints in floorplan design