• Home
  • Search
  • A new performance driven placement algorithm
  • Cite Icon56
  • https://doi.org/10.1109/iccad.1991.185187Copy DOI Icon

A new performance driven placement algorithm

  • Nov 11, 1991
  • T Gao +2 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

The authors present a novel performance driven placement algorithm. They use a convex programming algorithm to compute a set of upper bounds on the net wire lengths. A modified min-cut algorithm is then used to generate a placement with the objective of minimizing the number of nets, the wire lengths of which exceed their corresponding upper bounds. The situation in which the modified min-cut algorithm fails to generate a placement that satisfies the timing requirements is addressed, and an iterative approach is used to modify the set of upper bounds making use of information from previous placements. The algorithm was implemented in C and tested on eight problems on a Sparc 2 workstation. >

Similar Papers
  • Research Article
  • Citations68

RITUAL: a performance driven placement algorithm

  • Jan 01, 1992
  • IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
  • A Srinivasan +2
  • Research Article
  • Citations4

A FAST AND EFFECTIVE TIMING-DRIVEN PLACEMENT TOOL FOR FPGAs

  • Aug 01, 2008
  • Journal of Circuits, Systems and Computers
  • Mohammed A S Khalid +1
  • Research Article
  • Citations4

Individual wire-length prediction with application to timing-driven placement

  • Oct 01, 2004
  • IEEE Transactions on Very Large Scale Integration (VLSI) Systems
  • Qinghua Liu +2
  • Research Article
  • Citations10

Optimal Rotation Problems in Channel Routing

  • Sep 01, 1986
  • IEEE Transactions on Computers
  • Atallah +1
  • Conference Article
  • Citations50

ICCAD-2012 CAD contest in design hierarchy aware routability-driven placement and benchmark suite

  • Nov 05, 2012
  • Natarajan Viswanathan +4
  • Conference Article
  • Citations19

Over-the-cell channel routing for high performance circuits

  • Jul 01, 1992
  • S Natarajan +3
  • Conference Article
  • Citations44

Accurate prediction of physical design characteristics for random logic

  • Oct 02, 1989
  • M Pedram +1
  • Conference Article

A methodology for identifying and placing heterogeneous cluster groups based on placement proximity data (abstract only)

  • Feb 26, 2014
  • Farnaz Gharibian +2
  • Research Article
  • Citations29

An element-based displacement preconditioner for linear elasticity problems

  • Oct 27, 2006
  • Computers and Structures
  • C.E Augarde +2
  • Conference Article
  • Citations14

On state estimation with bad data detection

  • Dec 01, 2011
  • Weiyu Xu +2
  • Conference Article
  • Citations9

Direct performance-driven placement of mismatch-sensitive analog circuits

  • Jan 01, 1995
  • K Lampaert +2
  • Research Article
  • Citations8

A functional-structural model of ephemeral seagrass growth influenced by environment.

  • Jan 23, 2018
  • Annals of Botany
  • S Whitehead +2
  • Conference Article
  • Citations139

Fast algorithms for online stochastic convex programming

  • Jan 01, 2015
  • Shipra Agrawal +1
  • Conference Article

A generalized placement algorithm based on self-organization neural network

  • Jun 07, 1992
  • Tao Shen +2
  • Conference Article

Energy Optimization of Extended-Range Electric Vehicles Based on Convex Programming Algorithm

  • Oct 28, 2022
  • Shengyan Hou +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.