NDLI: Fast buffer insertion considering process variations

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

Robust extraction of spatial correlation

introduction to electromigration-aware physical design

An O(nlogn) algorithm for obstacle-avoiding routing tree construction in the λ-geometry plane

Floorplan and power/ground network co-synthesis for fast design convergence

Efficient generation of short and fast repeater tree topologies

Integrated retiming and simultaneous Vdd/Vth scaling for total power minimization

Chip assembly: a new paradigm in hierarchical physical design

Clock tree design challenges for robust and low power design

Solving hard instances of floorplacement

Satisfying whitespace requirements in top-down placement

Commercial CAD: challenges and opportunities

Timing analysis in presence of supply voltage and temperature variations

IC failure mechanisms yesterday, today, tomorrow: implications from test to DFM

An optimal jumper insertion algorithm for antenna avoidance/fixing on general routing trees with obstacles

Noise driven in-package decoupling capacitor optimization for power integrity

Fast buffer insertion considering process variations

Statistical clock tree routing for robustness to process variations

Physical design challenges for multi-million gate SoC's: an STMicroelectronics perspective

Clockless IC design using handshake technology

Integrating dynamic thermal via planning with 3D floorplanning algorithm

Dragon2006: blockage-aware congestion-controlling mixed-size placer

Probabilistic evaluation of solutions in variability-driven optimization

NEMO: a new implicit connection graph-based gridless router with multi-layer planes and pseudo-tile propagation

Efficient decoupling capacitor planning via convex programming methods

Placement and routing optimization in the brain

Variation tolerant buffered clock network synthesis with cross links

ISPD 2006 Placement Contest: Benchmark Suite and Results

Effective linear programming based placement methods

mPL6: enhanced multilevel mixed-size placement

SAMSON: a generalized second-order arnoldi method for reducing multiple source linear network with susceptance

Prediction and reduction of routing congestion

High accurate pattern based precondition method for extremely large power/ground grid analysis

Improved method of cell placement with symmetry constraints for analog IC layout design

NTUplace2: a hybrid placer using partitioning and analytical techniques

Non-gaussian statistical parameter modeling for SSTA with confidence interval analysis

Seeing the forest and the trees: Steiner wirelength optimization in placemen

Optimal partitioned fault-tolerant bus layout for reducing power in nanometer designs

Net cluster: a net-reduction based clustering preprocessing algorithm

A faster implementation of APlace

Fast buffer insertion considering process variations

Content Provider	ACM Digital Library
Author	Xiong, Jinjun He, Lei
Abstract	Advanced process technologies call for a proactive consideration of process variations in design to ensure high parametric timing yield. Despite of its popular use in almost any high performance IC designs nowadays, however, buffer insertion has not gained enough attention in addressing this issue. In this paper, we propose a novel algorithm for buffer insertion to consider process variations. The major contribution of this work is two-fold: (1) an efficient technique to handle correlated process variations under nonlinear operations; (2) a provable transitive closure pruning rule that makes linear complexity variation-aware pruning possible. The proposed techniques enable an efficient implementation of variation-aware buffer insertion. Compared to an existing algorithm considering process variations, our algorithm achieves more than 25x speed-up. We also show that compared to the conventional deterministic approach, the proposed buffer insertion algorithm considering correlated process variations improves the parametric timing yield by more than 15%.
Starting Page	128
Ending Page	135
Page Count	8
File Format	PDF
ISBN	1595932992
DOI	10.1145/1123008.1123033
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2006-04-09
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Transitive closure Buffer insertion Dynamic programming Process variation Pruning rule
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

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