Background and Preliminaries

Linear Buffered-Path Delay Model. Recall the linear-delay model introduced in Chap. 3. The delay along an optimally buffered interconnect of length I is given by delay(/) = t I, where t is a technology dependent constant. In general, t depends on the buffer library size and the input slew rate. In this chapter, we refer to T = delay(wire)/length(w/re). 

Without loss of generality, we set gate delays D(P) and D(P ) to zero in the following discussion to simplify the analysis. All algorithms are still valid as long as gate delays are constants. 

Cloning Problem Given a graph G = V, E), where P is the target gate, RAT for all fanouts 5,, AT for all fanins Fi, and a linear-delay constant r, create a cloned gate P for P, which induces a new graph G, find Sp, Sp and locations of P and P (if P is movable) such that Q(G ) is maximized. 

In contrast to most previous work which only identifies the partitions Sp and Sp , our algorithms will not only provide a partitioning of fanouts, but also the placement of P and P [6, 7], If the solution is worse than the original circuit, no cloning will be performed. 

---

Mielke HW. 1991. Lead in residential soils Background and preliminary results ofNew Orleans. Water Air Soil Pollut 57-58 111-119. 

---