• Home
  • Search
  • RITUAL: a performance driven placement algorithm
  • Cite Icon68
  • https://doi.org/10.1109/82.204130Copy DOI Icon

RITUAL: a performance driven placement algorithm

  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

An algorithm for obtaining a placement of large scale cell-based ICs subject to performance constraints is described. The problem is formulated as a constrained programming problem and is solved in two phases: continuous and discrete. Constraints are placed on total path delays including cell and interconnect delays, and the behavior of all the paths is captured. Mathematical techniques and heuristics based on Lagrangian relaxation are used to find an approximate solution to the constrained problem. The algorithm yields good results, as shown on a set of real examples. On the average, between 8% and 30% improvement in the interconnect delay of these examples is obtained with little or no impact on chip area after routing by modifying the placement alone.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Similar Papers
  • Conference Article
  • Citations56

A new performance driven placement algorithm

  • Nov 11, 1991
  • T Gao +2
  • Single Report
  • Citations1

Early Layout Design Exploration in TSV-based 3D Integrated Circuits

  • Jan 01, 2000
  • Mohammad Ahmed
  • Conference Article
  • Citations23

Stochastic wire-length and delay distributions of 3-dimensional circuits

  • Nov 05, 2000
  • Rongtian Zhang +3
  • Conference Article
  • Citations1

APR-16: The Physical Design of a Reconfigurable Array Processor Chip

  • Oct 28, 2022
  • Yangfan Xiao +5
  • Conference Article
  • Citations16

Power trends and performance characterization of 3-dimensional integration

  • May 06, 2001
  • Rongtian Zhang +3
  • Conference Article
  • Citations1

An efficient algorithm for statistical circuit optimization using lagrangian relaxation

  • Nov 01, 2007
  • Digest of technical papers/Digest of technical papers - IEEE/ACM International Conference on Computer-Aided Design
  • I-Jye Lin +1
  • Conference Article
  • Citations14

Efficient algorithms for buffer insertion in general circuits based on network flow

  • May 31, 2005
  • Ruimin Chen +1
  • Research Article
  • Citations11

Predictive Search for Capacitated Multi-Item Lot Sizing Problems

  • Aug 20, 2021
  • INFORMS Journal on Computing
  • Tao Wu
  • Research Article

FIDER: A Force-Balance-Based Interconnect Delay Driven Re-Synthesis Algorithm for Data-Path Optimization After Floorplan

  • Feb 01, 2007
  • Tsinghua Science & Technology
  • Yunfeng Wang +4
  • Research Article
  • Citations169

Speed and power scaling of SRAM's

  • Feb 01, 2000
  • IEEE Journal of Solid-State Circuits
  • B.S Amrutur +1
  • Research Article
  • Citations55

Scheduling flexible flow shops with no setup effects

  • Apr 01, 1994
  • IEEE Transactions on Robotics and Automation
  • Shi-Chung Chang +1
  • Conference Article
  • Citations5

Novel Energy Efficient one bit Full Subtractor at 65nm technology

  • Jan 01, 2015
  • M Mahaboob Basha +2
  • Conference Article
  • Citations27

Urban road traffic light real-time scheduling

  • Dec 01, 2015
  • Yicheng Zhang +2
  • Conference Article
  • Citations1

Local logic substitution algorithm for post-layout re-synthesis

  • Jan 01, 2003
  • Jinian Bian +5
  • Conference Article
  • Citations1

An approximate approach to the Unsplittable flow Edge-Load factor Balancing problem with the Lagrangian relaxation

  • Oct 18, 2022
  • Daichi Shimizu +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.