scispace - formally typeset
Proceedings ArticleDOI

Buffer/flip-flop block planning for power-integrity-driven floorplanning

Reads0
Chats0
TLDR
This paper proposes a methodology to pipeline interconnect during the floorplan stage and considers the IR-drop during the planning of buffers and flip-flops at the same time and shows that the method can get a low system latency with power integrity preservation in 90nm technology node.
Abstract
As the technology scaled down, it is known that interconnect has become the dominant factor in determining the overall circuit performance and complexity. Buffer insertion is one of very effective and useful techniques to improve the interconnect performance. In order to find better places for buffers to be inserted, the buffer insertion stage during floorplanning usually clusters buffers in a region, which may cause additional IR-drop violation. On the other hand, in complex digital system with relatively large die areas operating at very high frequencies, many global signals traveling across the chip need several clock cycles to reach their destinations, thus requiring the adoption of pipelined interconnects. Together with the buffer stations/blocks, the increasing number of flip-flops will cause further voltage drop violation. In this paper, we propose a methodology to pipeline interconnect during the floorplan stage and consider the IR-drop during the planning of buffers and flip-flops at the same time. The experimental results show that our method can get a low system latency with power integrity preservation in 90nm technology node.

read more

Citations
More filters
Proceedings Article

Planning buffer locations by network flows

Xiaoping Tang, +1 more
TL;DR: In this paper, a polynomial-time optimal algorithm was proposed to insert maximum number of buffers into the free space between the circuit blocks. But the algorithm is based on efficient min-cost network-flow computations.
References
More filters
Proceedings ArticleDOI

Buffer placement in distributed RC-tree networks for minimal Elmore delay

TL;DR: An algorithm is presented for choosing the buffer positions for a wiring tree such that the Elmore delay is minimal, and an extension of the basic algorithm allows minimization of the number of buffers as a secondary objective.
Proceedings ArticleDOI

B*-Trees: a new representation for non-slicing floorplans

TL;DR: An efficient, flexible, and effective data structure, B-trees for non-slicing floorplans, based on ordered binary trees and the admissible placement presented in [1], and a B-tree based simulated annealing scheme for floorplan design.
Journal ArticleDOI

Optimal wire sizing and buffer insertion for low power and a generalized delay model

TL;DR: This approach represents the first work on buffer insertion to incorporate signal slew into the delay model while guaranteeing optimality and efficiently computes the complete, optimal power-delay trade-off curve for added design flexibility.
Proceedings ArticleDOI

Buffer block planning for interconnect-driven floorplanning

TL;DR: An effective buffer block planning (BBP) algorithm is developed to perform buffer clustering such that the overall chip area and the buffer block number can be minimized.
Proceedings ArticleDOI

Buffered Steiner tree construction with wire sizing for interconnect layout optimization

TL;DR: In this paper, an efficient algorithm for buffered Steiner tree construction with wire sizing is presented. But the algorithm does not consider the critical delay and total capacitance minimization.
Related Papers (5)