Bounded-skew clock and Steiner routing under Elmore delay

: We study the minimum-cost bounded-skew routing tree problem under the Elmore delay model. We presenttwo approachesto construct bounded-skew routing trees: (i) the Boundary Merging and Embedding (BME) method which utilizes merging points that are restricted to theboundariesofmerging regions,and (ii) the Interior Merging and Embedding (IME) algorithm which employs a sampling strategy and dynamic programming to consider merging points that are interior to, rather than on the boundary of, the merging regions. Our new algorithms allow accurate control of Elmore delay skew, and show the utility of merging points inside merging regions.

• Type: Conference
• Year: 1995
• Where: ICCAD
• Authors: Jason Cong, Andrew B. Kahng, Cheng-Kok Koh, Chung-Wen Albert Tsao
• Keywords: Boundary Merging, Bounded-skew Routing Trees, Hardware, ICCAD 1995, Interior Merging