CHARIKAR, M., KLEINBERG, J., KUMAR, R., RAJAGOPALAN, S., SAHAI, A., AND TOMKINS, A. Minimizing wirelength in zero and bounded skew clock trees. In Proc. 10th ACM-SIAM Symposium on Discrete Algorithms (1999), pp. 177--184. 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 to find zero or bounded skew trees of minimum total weight, since the weight of the tree is directly proportional to the amount of resources (bandwidth and buffers for network multicasting, power and chip area for clock routing in VLSI) that must be allocated to the tree. Charikar et al. [9] have recently proposed the first strongly polynomial algorithms with proven constant approximation factors, 2e 5:44 and 16:86, for finding minimum weight zero and bounded skew trees, respectively. In this paper we introduce a new approach to these problems, based on zero skew stretching ....
....are: Zero Skew Tree Problem: Given a set of sinks S in metric space (M;d) find a minimum cost zero skew tree for S. Bounded Skew Tree Problem: Given a set of sinks S in metric space (M;d) and a bound b 0, find a minimum cost b bounded skew tree for S. The ZST and BST problems are NP hard [9]. The restriction of the BST problem to the rectilinear plane is also known to be NP hard, but the complexity of the rectilinear ZST problem 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 ....
[Article contains additional citation context not shown here]
CHARIKAR, M., KLEINBERG, J., KUMAR, R., RAJAGOPALAN, S., SAHAI, A., AND TOMKINS, A. Minimizing wirelength in zero and bounded skew clock trees. In Proc. 10th ACM-SIAM Symposium on Discrete Algorithms (1999), pp. 177--184.
Practical Approximation Algorithms for Zero- and.. - Zelikovsky, Mandoiu (2001) (Correct)
....is to find zero or bounded skew trees of minimum total weight, since the weight of the tree is directly proportional to the amount of resources (bandwidth and buffers for network multicasting, power and chip area for clock routing in VLSI) that need to be allocated to the tree. Charikar et al. [9] have recently proposed the first strongly polynomial algorithms with proven constant approximation factors, 2e 5:44 and 16:86, for finding minimum weight zero and bounded skew trees, respectively. In this paper we introduce a new approach to these problems, based on zero skew stretching of ....
....1 Zero Skew Tree Problem: Given a set of sinks S in metric space (M;d) find a minimum cost zero skew tree for S. Bounded Skew Tree Problem: Given a set of sinks S in metric space (M;d) and bound b 0, find a minimum cost b bounded skew tree for S. The ZST and BST problems are NP hard [9]. The restriction of the BST problem to the rectilinear plane is also known to be NP hard, but the complexity of the rectilinear ZST problem 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 ....
[Article contains additional citation context not shown here]
CHARIKAR, M., KLEINBERG, J., KUMAR, R., RAJAGOPALAN, S., SAHAI, A., AND TOMKINS, A. Minimizing wirelength in zero and bounded skew clock trees. In Proc. 10th ACM-SIAM Symposium on Discrete Algorithms (1999), pp. 177--184.
The Associative-Skew Clock Routing Problem - Chen, Kahng, Qu, Zelikovsky (1999) (1 citation) (Correct)
....call H0, can save a logarithmic factor in tree cost versus the previous approach since a ZST can be logarithmically more expensive than the RSMT. Figure 1 shows how the optimal ZST cost over k points (tree roots) evenly spaced on the unit line segment grows as Q(logk) cf. analysis techniques of [5]) while the optimal RSMT cost remains constant. The use of heuristic H0 is motivated when the groups of sinks are well separated (e.g. have disjoint convex hulls) this would tend to be the case if the physical layout hierarchy reflects the functional hierarchy. 2 Since in a shift register ....
M. Charikar, J. Kleinberg, R. Kumar, S. Rajagopalan, A. Sahai and A. Tomkins, "Minimizing wirelength in zero and bounded skew clock trees", Proc. ACM/SIAM Symp. on Discrete Algorithms, Baltimore, 1999, pp. 177-184.
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