Summary: Meeting Delay Constraints in DSM by Minimal Repeater Insertion
I­Min Liu Adnan Aziz
Department of Electrical and Computer Engineering
The University of Texas, Austin, TX 78712
D. F. Wong
Department of Computer Sciences
The University of Texas, Austin, TX 78712
Abstract
We address the problem of selecting repeater sizes and
inserting at feasible locations in a placed and routed net­
work to meet delay constraints using minimal repeater
area, taking the advantage of slacks available in the net­
work. Specifically, we transform the problem into an un­
constrained optimization problem and solve it by iterative
local refinement. We show that the optimal repeater loca­
tions and sizes that locally minimize the objective function
in the unconstrained problem can be efficiently computed.
We have implemented our algorithm and tested it on a set
of benchmarks; the experimental results are promising.
1. Introduction

Source: Aziz, Adnan - Department of Electrical and Computer Engineering, University of Texas at Austin

Collections: Computer Technologies and Information Sciences