NDLI: Fine granularity clustering for large scale placement problems

Please wait, while we are loading the content...

Keynote Speaker

Important placement considerations for modern VLSI chips

3D thermal-ADI: an efficient chip-level transient thermal simulator

There is life left in ASICs

Timing driven force directed placement with physical net constraints

Optimality, scalability and stability study of partitioning and placement algorithms

A complete design for power methodology and flow for large ASICs

Layout impact of resolution enhancement techniques: impediment or opportunity?

Constrained "Modern" Floorplanning

Efficient Steiner tree construction based on spanning graphs

An architectural exploration of via patterned gate arrays

Convergence of placement technology in physical synthesis: is placement really a point tool?

Capturing crosstalk-induced waveform for accurate static timing analysis

The scaling challenge: can correct-by-construction design help?

Fine granularity clustering for large scale placement problems

Benchmarking for large-scale placement and beyond

Advanced routing in changing technology landscape

An integrated floorplanning with an efficient buffer planning algorithm

Porosity aware buffered steiner tree construction

Architecture and synthesis for multi-cycle communication

Closed form expressions for extending step delay and slew metrics to ramp inputs

Partition-driven standard cell thermal placement

Research directions for coevolution of rules and routers

Floorplanning of pipelined array modules using sequence pairs

Optimal minimum-delay/area zero-skew clock tree wire-sizing in pseudo-polynomial time

Synthesis and placement flow for gain-based programmable regular fabrics

Explicit gate delay model for timing evaluation

Local unidirectional bias for smooth cutsize-delay tradeoff in performance-driven bipartitioning

Process variation aware clock tree routing

Fishbone: a block-level placement and routing scheme

Signal integrity management in an SoC physical design flow

Fine granularity clustering for large scale placement problems

Content Provider	ACM Digital Library
Author	Marek-Sadowska, Malgorzata Hu, Bo
Abstract	In this paper we present a linear-time Fine Granularity Clustering (FGC) algorithm to reduce the size of large scale placement problems. FGC absorbs as many nets as possible into Fine Clusters. The absorbed nets are expected to be short in any good placement; therefore the clustering process does not affect the quality of results. We compare FGC with a connectivity-based clustering algorithm proposed in [1] and simulated-annealing-based algorithm in TimberWolf [2], both of which also reduce the number of external nets between clusters. The experimental results show that our algorithm achieves better net absorption than the previous approaches while using much less CPU time for large scale problems. With our FGC algorithm, we propose a Fast Placer Implementation (FPI) framework, which combines our FGC-based size reduction with traditional placement techniques to handle large-scale placement problems. We compared FPI placement results with a public-domain fast standard cell placer Capo[4] on large scale benchmarks. The results show that FPI can reduce CPU time for large scale placement by a factor of 3~5x while obtaining place¿ment results of comparable or better quality.
Starting Page	67
Ending Page	74
Page Count	8
File Format	PDF
ISBN	1581136501
DOI	10.1145/640000.640017
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2003-04-06
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Placement Clustering
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

Fine granularity clustering-based placement

Genetic Algorithms for Large Scale Clustering Problems (1997)

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

A parallel clustering algorithm for placement

Clustering algorithms for circuit partitioning and placement problems

Monitor placement for large-scale systems

A new clustering method suitable for large scale data

Fast placement for large-scale hierarchical FPGAs

Crossing macromodels on circle model for VLSI placement, partitioning and packaging problems

Fine granularity clustering for large scale placement problems

Similar Documents

Fine granularity clustering-based placement

Genetic Algorithms for Large Scale Clustering Problems (1997)

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

A parallel clustering algorithm for placement

Clustering algorithms for circuit partitioning and placement problems

Monitor placement for large-scale systems

A new clustering method suitable for large scale data

Fast placement for large-scale hierarchical FPGAs

Crossing macromodels on circle model for VLSI placement, partitioning and packaging problems

Fine granularity clustering for large scale placement problems