Porosity-aware buffered Steiner tree construction

No abstract is available for this paper.

• Publication year

  2003

• Venue

  IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

• Publication date

  2003-04-06

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1145/640000.640035
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A place and route aware buffered Steiner tree construction

  2004cited by this paper
• Buffer tree synthesis with consideration of temporal locality, sink polarity requirements, solution cost, congestion, and blockages

  2003cited by this paper
• S-Tree: a technique for buffered routing tree synthesis

  2002cited by this paper
• Buffer tree synthesis with consideration of temporal locality, sink polarity requirements, solution cost and blockages

  2002cited by this paper
• Optimal buffered routing path constructions for single and multiple clock domain systems

  2002cited by this paper
• Buffer insertion with adaptive blockage avoidance

  2002cited by this paper
• A new algorithm for routing tree construction with buffer insertion and wire sizing under obstacle constraints

  2001cited by this paper
• International Symposium on Physical Design (ISPD)

  2001cited by this paper
• A practical methodology for early buffer and wire resource allocation

  2001cited by this paper
• Steiner tree optimization for buffers. Blockages and bays

  2001cited by this paper
• Maze routing with buffer insertion and wiresizing

  2000cited by this paper
• Transformational placement and synthesis

  2000cited by this paper
• Routing tree construction under fixed buffer locations

  2000cited by this paper
• A fast algorithm for context-aware buffer insertion

  2000cited by this paper
• Buffer block planning for interconnect-driven floorplanning

  1999cited by this paper
• Simultaneous routing and buffer insertion with restrictions on buffer locations

  1999cited by this paper
• Buffer insertion with accurate gate and interconnect delay computation

  1999cited by this paper
• Buffer insertion for noise and delay optimization

  1998cited by this paper
• Challenges and Opportunities for Design Innovations in Nanometer Technologies

  1998cited by this paper
• Wire Segmenting For Improved Buffer Insertion

  1997cited by this paper
• Simultaneous routing and buffer insertion for high performance interconnect

  1996cited by this paper
• The Elmore Delay as a Bound for RC Trees with Generalized Input Signals

  1995cited by this paper
• Optimal wire sizing and buffer insertion for low power and a generalized delay model

  1995cited by this paper
• Buffer placement in distributed RC-tree networks for minimal Elmore delay

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

  1948cited by this paper

• Recursive Learning-Based Virtual Buffering for Analytical Global Placement

  2025cites this paper
• Heuristics for Iterative Detailed Standard Cell Placement

  2016cites this paper
• Progress and challenges in VLSI placement research

  2015cites this paper
• DRC-based hotspot detection considering edge tolerance and incomplete specification

  2014cites this paper
• An optimization algorithm for simultaneous routing and buffer insertion with delay-power constraints in VLSI layout design

  2014cites this paper
• Fast Repeater Tree Construction

  2014cites this paper
• Depth controlled symmetric function fanin tree restructure

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

  2012cites this paper
• Capítulo 8 – Árvore de steiner

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

  2012cites this paper
• Reclaiming over-the-IP-block routing resources with buffering-aware rectilinear Steiner minimum tree construction

  2012cites this paper
• Critical-Trunk-Based Obstacle-Avoiding Rectilinear Steiner Tree Routings and Buffer Insertion for Delay and Slack Optimization

  2011cites this paper
• ECO Timing Optimization Using Spare Cells and Technology Remapping

  2010cites this paper
• BoxRouter 2.0: A hybrid and robust global router with layer assignment for routability

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

  2008cites this paper
• Chapter 28 : Buffering in the Layout Environment

  2007cites this paper
• Algorithms for the scaling toward nanometer VLSI physical synthesis

  2007influential citation
• On controlling perturbation due to repeaters during quadratic placement

  2006cites this paper
• Efficient generation of short and fast repeater tree topologies

  2006cites this paper
• Low-Power Repeater Insertion for Global Interconnects

  2006cites this paper
• Throughput-driven floorplanning with wire pipelining

  2005cites this paper
• Buffered tree refinement considering timing and congestion

  2005cites this paper
• A place and route aware buffered Steiner tree construction

  2004cites this paper
• Modeling repeaters explicitly within analytical placement

  2004cites this paper
• Fast and flexible buffer trees that navigate the physical layout environment

  2004cites this paper
• Tree optimization and synthesis techniques with applications in automated design of integrated circuits

  2004cites this paper
• Floorplanning for throughput

  2004cites this paper
• Spec based flip-flop and buffer insertion

  2003cites this paper