Transformational placement and synthesis

No abstract is available for this paper.

• Publication year

  2000

• Venue

  Proceedings Design, Automation and Test in Europe Conference and Exhibition 2000 (Cat. No. PR00537)

• Publication date

  Unknown publication date

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1145/343647.343732
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Performance driven optimization of network length in physical placement

  1999cited by this paper
• Timing metrics for physical design of deep submicron technologies

  1998cited by this paper
• Gate-size selection for standard cell libraries

  1998cited by this paper
• Faster minimization of linear wirelength for global placement

  1997cited by this paper
• Timing driven placement in interaction with netlist transformations

  1997cited by this paper
• An exact solution to simultaneous technology mapping and linear placement problem

  1997cited by this paper
• Design methodology for the S/390 Parallel Enterprise Server G4 microprocessors

  1997cited by this paper
• An integrated placement and synthesis approach for timing closure of PowerPC/sup TM/ microprocessors

  1997cited by this paper
• Unification Of Budgeting And Placement

  1997cited by this paper
• Layout Driven Re-synthesis For Low Power Consumption Lsis

  1997cited by this paper
• Multilevel Circuit Partitioning

  1997cited by this paper
• Multilevel Hypergraph Partitioning: Application In Vlsi Domain

  1997cited by this paper
• Performance optimization of VLSI interconnect layout

  1996cited by this paper
• BooleDozer: Logic synthesis for ASICs

  1996cited by this paper
• A Methodology and Algorithms for Post-Placement Delay Optimization

  1994cited by this paper
• Logical effort: designing for speed on the back of an envelope

  1991cited by this paper
• GORDIAN: VLSI placement by quadratic programming and slicing optimization

  1991cited by this paper
• RITUAL: a performance driven placement algorithm for small cell ICs

  1991cited by this paper
• Logical effort: designing for speed on the back of an envelope

  1991cited by this paper
• Timing driven placement using complete path delays

  1990cited by this paper
• An Improved Min-Cut Algonthm for Partitioning VLSI Networks

  1984cited by this paper
• Wire length distribution for placements of computer logic

  1981cited by this paper
• Equivalence of memory to Random Logic

  1974cited by this paper
• The Transient Response of Damped Linear Networks with Particular Regard to Wideband Amplifiers

  1948cited by this paper

• Progress and challenges in VLSI placement research

  2015cites this paper
• Bounded Transactional Timing Analysis

  2013cites this paper
• Gate Sizing During Timing-Driven Placement

  2013cites this paper
• Progress and Challenges in VLSI Placement Research

  2012cites this paper
• Progress and Challenges in VLSI Placement Research Special Session Paper

  2012cites this paper
• Novel Discrete Optimization Techniques with Applications to Complex Physical Synthesis Problems in EDA

  2012cites this paper
• Chapter 7 LOGICAL AND PHYSICAL DESIGN : A FLOW PERSPECTIVE

  2011cites this paper
• Speeding Up Physical Synthesis with Transactional Timing Analysis

  2010cites this paper
• Simple Exact Algorithm for Transistor Sizing of Low-Power High-Speed Arithmetic Circuits

  2010cites this paper
• Broadening the Scope of Multi-Objective Optimizations in Physical Synthesis of Integrated Circuits

  2010cites this paper
• High-Performance Placement and Routing for the Nanometer Scale

  2009cites this paper
• Energy Consumption Optimization for Basic Arithmetic Circuits with Transistor Sizing Based on Genetic Algorithm

  2009cites this paper
• Course grained low power design flo w using UPF

  2009cites this paper
• Path smoothing via discrete optimization

  2008cites this paper
• Technology Mapping Using Logical Effort for Solving the Load-Distribution Problem

  2008cites this paper
• Algorithms for simultaneous consideration of multiple physical synthesis transforms for timing closure

  2008cites this paper
• SafeResynth: A new technique for physical synthesis

  2008cites this paper
• ECO-system: Embracing the Change in Placement

  2007cites this paper
• Safe Delay Optimization for Physical Synthesis

  2007cites this paper
• Hippocrates: First-Do-No-Harm Detailed Placement

  2007cites this paper
• How to process a multi million gate ASIC layout in 21 hours

  2007cites this paper
• Techniques for Fast Physical Synthesis

  2007cites this paper
• Placement for Power Optimization

  2007cites this paper
• Techniques for Fast Physical Synthesis Fast, efficient buffer design, logic transformations, and clustering components for placement are some of the techniques being used to reduce design turnaround for large, complex chips.

  2007cites this paper
• ECO-System: Embracing the Change in Placement

  2007cites this paper
• Incremental placement for modern VLSI design closure

  2006influential citation
• Power Optimization Within Nanometer Designs

  2005cites this paper
• Immense ASIC Design in Nanometer Era Dr

  2005cites this paper
• A diagnostic method for detecting and assessing the impact of physical design optimizations on routing

  2005cites this paper
• Improving Run Times by Pruned Application of Synthesis Transforms

  2005cites this paper
• A mask reuse methodology for reducing system-on-a-chip cost

  2005cites this paper
• Improving RunTimesbyPrunedApplication ofSynthesis Transforms

  2005cites this paper
• Sensitivity guided net weighting for placement-driven synthesis

  2004cites this paper
• Sensitivity guided net weighting for placement driven synthesis

  2004cites this paper
• Logical effort based technology mapping

  2004cites this paper
• Fast comparisons of circuit implementations

  2004cites this paper
• Understanding metrics in logic synthesis for routability enhancement

  2003cites this paper
• Design topology aware physical metrics for placement analysis

  2003cites this paper
• Physical synthesis methodology for high performance microprocessors

  2003cites this paper
• Designing mega-ASICs in nanogate technologies

  2003cites this paper
• Effective free space management for cut-based placement via analytical constraint generation

  2003cites this paper
• Porosity-aware buffered Steiner tree construction

  2003cites this paper
• Impact of interoperability on CAD-IP reuse: an academic viewpoint

  2003cites this paper
• Pushing ASIC performance in a power envelope

  2003cites this paper
• Benchmarking for large-scale placement and beyond

  2003cites this paper
• Fast and accurate wire delay estimation for physical synthesis of large ASICs

  2002influential citation
• Free space management for cut-based placement [IC layout]

  2002cites this paper
• Layout driven decomposition with congestion consideration

  2002cites this paper
• Free space management for cut-based placement

  2002cites this paper
• Issues and strategies for the physical design of system-on-a-chip ASICs

  2002cites this paper
• Comprehensive frequency-dependent substrate noise analysis using boundary element methods

  2002cites this paper
• Cycle time optimization by timing driven placement with simultaneous netlist transformations

  2001cites this paper
• Congestion aware layout driven logic synthesis

  2001cites this paper
• Logical and physical design: a flow perspective

  2001cites this paper
• EDA in IBM: past, present, and future

  2000cites this paper
• Keeping Physical Synthesis Safe and Sound

  year unknowncites this paper