J. Cong, A. B. Kahng, C.-K. Koh, and C.-W. Albert Tsao, "Bounded-Skew Clock and Steiner Routing", ACM Trans. on Design Automation of Electronic Systems, vol. 3, pp. 341-388, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Practical Approximation Algorithms for Zero- and.. - Zelikovsky, Mandoiu (2001) (Correct)
.... is not known for a fixed tree topology the problem can be solved in linear time by using the Deferred Merge Embedding (DME) algorithm independently introduced in [6, 7, 11] Although the rectilinear zero and bounded skew tree problems have received much attention in the VLSI CAD literature [4, 6, 7, 8, 10, 11, 12, 16, 17, 20] (see Chapter 4 of [18] 2 for a detailed review) the first algorithms with constant approximation factors have been proposed only recently, by Charikar et al. 9] They give algorithms with approximation factors of 2e 5:44 and 16.86 for ZST and BST problems, respectively. The BST algorithm in ....
CONG, J., KAHNG, A., KOH, C., AND TSAO, C.-W. Bounded-skew clock and Steiner routing. ACM Trans. on Design Automation of Electronic Systems 3 (1998), 341--388.
Practical Approximation Algorithms for Zero- and.. - Zelikovsky, Mandoiu (2001) (Correct)
.... is not known for a fixed tree topology the problem can be solved in linear time by using the Deferred Merge Embedding (DME) algorithm independently introduced in [6, 7, 11] Although the rectilinear zero and bounded skew tree problems have received much attention in the VLSI CAD literature [4, 6, 7, 8, 10, 11, 12, 16, 17, 20] (see Chapter 4 of [18] for a detailed review) the first algorithms with constant approximation factors have been proposed only recently, by Charikar et al. 9] They give algorithms with approximation factors of 2e 5:44 and 16.86 for ZST and BST problems, respectively. The BST algorithm in [9] ....
CONG, J., KAHNG, A., KOH, C., AND TSAO, C.-W. Bounded-skew clock and Steiner routing. ACM Trans. on Design Automation of Electronic Systems 3 (1998), 341--388.
UST/DME: A Clock Tree Router For General Skew Constraints - Tsao, Koh (2000) Self-citation (Koh Tsao) (Correct)
.... the computation of merging regions as follows: When we merge Tu and Tw to form Tv , we first determine the closest boundary segments of child merging regions mr(u) and mr(w) The two closest segments Lu mr(u) and Lw mr(w) which are used to construct mr(v) are called joining segments [2]. They can either be a Manhattan arc (a segment with slope 1 or 1) or a rectilinear line segment. Under the linear or Elmore delay models, the skew values are always constant on Manhattan arcs and a piecewise linear function of locations on rectilinear line segments. With Input: Clock pins S; ....
....difficulties highlighted in the preceding discussion, we restrict the joining segments in UST DME to only Manhattan arcs. The advantage of such a restriction is that skew i;j for any pair of clock pins s i and s j in the subtree (rooted by the Manhattan arc) is a constant value, say x 2 FSR i;j [2]. Let Lu be a Manhattan arc in mr(u) such that it is closest to mr(w) Let s i and s j be clock pins in Tu . As a skew commitment of skew i;j = x changes FSRk;l for clock pins sk and s l in Tw , we re compute the merging region mr(w) based on the updated FSRk;l . In order to minimize the merging ....
[Article contains additional citation context not shown here]
J. Cong, A. B. Kahng, C.-K. Koh, and C.-W. A. Tsao. Bounded-skew clock and Steiner routing. ACM Trans. on Design Automation of Electronics Systems, 3(3):341--388, 1998.
The Associative-Skew Clock Routing Problem - Chen, Kahng, Qu, Zelikovsky (1999) (1 citation) Self-citation (Kahng) (Correct)
....variant is Greedy DME [9] ffl More recently, it has been noted that exact zero skew comes at the price of increased wiring area and higher power dissipation, even as circuits still operate correctly within some non zero skew bound. Hence, the bounded skew tree (BST) problem was addressed in [14, 7, 16, 6]. The BST problem provides a continuous tradeoff between two classic routing problems the zero skew tree (ZST) problem for skew bound B = 0, and the rectilinear Steiner minimum tree (RSMT) problem for B = ffl Finally, Friedman and coauthors have pointed out that the classic zero skew ....
J. Cong, A. B. Kahng, C. K. Koh and C.-W. A. Tsao, "Bounded-Skew Clock and Steiner Routing", ACM Trans. on Design Automation of Electronic Systems 3(3) (1998), pp. 341-388.
Process Variation Aware Clock Tree Routing (Extended Abstract) - Lu, al. (2003) (Correct)
No context found.
J. Cong, A. B. Kahng, C.-K. Koh, and C.-W. Albert Tsao, "Bounded-Skew Clock and Steiner Routing", ACM Trans. on Design Automation of Electronic Systems, vol. 3, pp. 341-388, 1998.
Reducing Clock Skew Variability via Cross Links - Anand Rajaram Electrical (2004) (Correct)
No context found.
J. Cong, A. B. Kahng, C.-K. Koh, and C.-W. A. Tsao. Bounded-skew clock and Steiner routing. ACM Transactions on Design Automation of Electronic Systems, 3(3):341--388, July 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC