Y. C. Wei and C. K. Cheng, "Ratio cut partitioning for hierarchical designs, " IEEE Trans. Computer-Aided Design, vol. 10, pp. 911--921, July 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....clusters. In some applications, it is necessary, or advantageous, to have overlapping clusters, as discussed earlier. The problem of nding nonoverlapping clusters where the objective is to develop only two clusters with minimum number of inter cluster links [25, 19] or minimum ratio cut (see [35, 26, 34, 51]) has drawn considerable attention from researchers. In the VLSI domain this is known as the twoway partition problem. Kernighan et al. 25] and Fiduccia et al. 19] developed e ective heuristics for this problem, which are still extensively used. Clustering techniques have also been widely used ....

Y. C. Wei and C. K. Cheng. Ratio cut partitioning for hierarchical design. IEEE Trans. on CAD, 40(7), pages 911-921, 1991.

.... cuts can be easily approximated using it [11, 17] Also several other important approximation algorithms like crossing number and minimum cut linear arrangement are based on the ratio cut [11] Ratio cut has many practical applications, most important being VLSI design, clustering and partitioning [20, 12, 1 ]. Since ratio cut is a NP hard problem [13] we must seek for approximation algorithms to solve it in practically reasonable time. Many purely heuristic algorithms were developed [20, 22, 18, 6] most of them relying on simulated annealing, spectral methods or iterative movement of nodes from one ....

....Ratio cut has many practical applications, most important being VLSI design, clustering and partitioning [20, 12, 1 ] Since ratio cut is a NP hard problem [13] we must seek for approximation algorithms to solve it in practically reasonable time. Many purely heuristic algorithms were developed [20, 22, 18, 6] most of them relying on simulated annealing, spectral methods or iterative movement of nodes from one side of the partition to the other. A common idea exploited by several authors [22, 2, 7, 18, 19] to improve their quality is using multi scale graph representation usually obtained by edge ....

[Article contains additional citation context not shown here]

Y. C. Wei, C. K. Cheng, Ratio Cut Partitioning for Hierarchical Designs. IEEE Trans. on ComputerAided Design, vol. 10, pp. 911-921, July 1991. 12

.... cuts can be easily approximated using it [13, 20] Also several other important approximation algorithms like crossing number and minimum cut linear arrangement are based on the ratio cut [13] Ratio cut has many practical applications, most important being VLSI design, clustering and partitioning [23, 14, 1]. Since ratio cut is a NP hard problem [15] we must seek for approximation algorithms to solve it in practically reasonable time. Many purely heuristic algorithms were developed [23, 25, 21, 8] most of them relying on simulated annealing, spectral methods or iterative movement of nodes from one ....

....Ratio cut has many practical applications, most important being VLSI design, clustering and partitioning [23, 14, 1] Since ratio cut is a NP hard problem [15] we must seek for approximation algorithms to solve it in practically reasonable time. Many purely heuristic algorithms were developed [23, 25, 21, 8] most of them relying on simulated annealing, spectral methods or iterative movement of nodes from one side of the partition to the other. A common idea exploited by several authors [25, 2, 9, 21, 22] to improve their quality is using multi scale graph representation usually obtained by edge ....

[Article contains additional citation context not shown here]

Y. C. Wei, C. K. Cheng, Ratio Cut Partitioning for Hierarchical Designs. IEEE Trans. on Computer- Aided Design, vol. 10, pp. 911 921, July 1991.

....Moreover, with each test case for which the intrinsic Rent parameter is known, the spectra based ratio cut partitioning tree has Rent parameter essentially identical to the theoretical lower bound. This result has key implications in two areas. First, it affirms previous work of Wei and Cheng [43], who were the first to propose the ratio cut metric as a partitioning objective, and of Hagen and Kahng [15] who proposed using the spectral approach for ratio cut partitioning. Second, our work naturally leads to the development of better predictive layout models, enabling a more efficient ....

....: 1= n) and hence the eigenvector corresponding to the second smallest eigenvalue is used. While eigenvalue computations are not cheap, the run times reported in [15] were actually less than those for the multiple F M computations needed by, e.g. the RCut1.0 program of Wei and Cheng [43]. Significant algorithmic speedups stem from the need to calculate only a single (the second smallest) eigenvalue of a symmetric matrix. Moreover, netlist graphs tend to be very sparse due to hierarchical circuit organization and degree bounds imposed by the technology fanout limits; this allows ....

Y. C. Wei and C. K. Cheng. Ratio cut partitioning for hierarchical designs. IEEE Trans. on CAD, 10(7):911--921, July 1991. 22

....components in a task graph. A cluster in a task graph represents a set of tasks that are intensively communicating with each other. These tasks should be placed in a single processor if available communication bandwidth is low. Among several graph clustering methods proposed in the literature [9, 13, 28], we use a simplified version of the stochastic flow injection method [29, 30] proposed by by Yeh et al. Under a simple condition in which tasks and proces sors are of a uniform weight and communication is negligible, it guarantees to quickly give the optimal solution, in which tasks are ....

....the same size and gave the basic idea to overcome the local optima. Fidducia and Mattheyses [9] proposed a faster 12 algorithm for a slightly different problem, in which a certain amount of difference between the sizes of the two subgraphs is accepted. Wei et al. further proposed a ratio cut [28], which automatically achieves a balance between a low cut size and a good ratio of the sub graph sizes. Finally, Yeh et al. proposed multi way partitioning based on stochastic flow injection method [29, 30] While our current algorithm can basically use any good partitioning algorithm as the ....

Y. Wei and C. Cheng. Ratio cut partitioning for hierarchical designs. IEEE Transactions on Computer-Aided Design, 10:911--921, 1991.

....the logic blocks are sequential. Then, we bipartitioned the circuits of the original and synthetic suites with several partitioning algorithms (hMetis [25] Fiduccia Mattheyses (FM) 26] Iterative Deletion (ID) Iterative Deletion post processed with Fiduccia Mattheyses (ID FM) 28] and ratiocut [29]. Except for the latter the cost objective was mincut (minimal nets cut) with a minimal allowed imbalance. The ratiocut algorithm uses the ratiocut cost function which is the ratio of the minimum cut over the product of partition sizes. This cost function inherently favors equally sized ....

Y.-C. Wei and C.-K. Cheng, "Ratio cut partitioning for hierarchical designs," IEEE Trans. on Computer-Aided Design,vol. 10, no. 7, pp. 911--921, July 1991.

.... equation for the net degree distribution, we compare it to measurements on the ISCAS89 benchmark s953 [BBK89] and the benchmark industry3 [Alp98] see gures 2 and 3) The Rent exponent has been estimated by tting a straight line to the data generated by the partitioning program ratiocut [WC91]. The output fraction is found from equation 13 and from the measurements of the total number of nets N and the number of pins P = I O (primary inputs and primary outputs) from the benchmark data. Figures 2 and 3 show that the measured net degree distribution for internal nets and the ....

Y.-C. Wei and C.-K. Cheng. Ratio cut partitioning for hierarchical designs. IEEE Trans. Comput.-Aided Des., Integrated Circuits & Syst., 10(7):911-921, July 1991.

....components in a task graph. A cluster in a task graph represents a set of tasks that are intensively communicating with each other. These tasks should be placed in a single processor if available communication bandwidth is low. Among several graph clustering methods proposed in the literature [9, 13, 28], we use a simplified version of the stochastic flow injection method [29, 30] proposed by by Yeh et al. Under a simple condition in which tasks and proces sors are of a uniform weight and communication is negligible, it guarantees to quickly give the optimal solution, in which tasks are ....

....the same size and gave the basic idea to overcome the local optima. Fidducia and Mattheyses [9] proposed a faster 12 algorithm for a slightly different problem, in which a certain amount of difference between the sizes of the two subgraphs is accepted. Wei et al. further proposed a ratio cut [28], which automatically achieves a balance between a low cut size and a good ratio of the sub graph sizes. Finally, Yeh et al. proposed multi way partitioning based on stochastic flow injection method [29, 30] While our current algorithm can basically use any good partitioning algorithm as the ....

Y. Wei and C. Cheng. Ratio cut partitioning for hierarchical designs. IEEE Transactions on Computer-Aided Design, 10:911--921, 1991.

.... equation for the net degree distribution, we compare it to measurements on the ISCAS89 benchmark s953 [2] and the benchmark industry3 [1] see figures 2 and 3) The Rent exponent has been estimated by fitting a straight line to the data generated by the partitioning program ratiocut [16]. The output fraction fl is found from equation 6 and from the measurements of N and P from the benchmark data. Figures 2 and 3 show that the measured net degree distribution for internal nets and the theoretically predicted distribution follow the same trend as a function of the net degree n ....

Y.-C. Wei and C.-K. Cheng. Ratio cut partitioning for hierarchical designs. IEEE Trans. Comput.-Aided Des., Integrated Circuits & Syst., vol. 10 (no. 7): pages 911--921, July 1991.

....multi level circuit clustering problem. 1. INTRODUCTION Circuit clustering is a technique that groups the gates of a circuit into clusters under the area bound and or pin constraints to optimize certain metrics. Commonly used metrics include maximization of the connectivity within clusters (e.g.[6,10,16]) or minimization of the delay of the clustered circuits (e.g. 2,4] In this paper, we focus on delay minimization of the clustered circuit. Circuit clustering is an important technique for various reasons. First, all modern circuit designs are very large in size. Clustering can reduce the ....

Wei Y.C. and Cheng C.K. Ratio cut partitioning for hierarchical designs. IEEE Trans. on Computer-Aided Design, pages 911-921, 1992.

....such as in the case of language oriented or semantic topologies. A common technique for finding natural clusters is to choose the clustering with the least number of edges between members. This technique is described by Mirkin[89] It is also known as the Ratio Cut technique in VLSI design[124]. This technique extends to the case when edges have a weight. The task is then to minimize the total weight of the edges connecting members[109] Natural clusters can also be obtained by applying a spring model (see below) 4.1 Layout of a clustered graph After discovering clusters within the ....

Y. C. Wei and C. K. Cheng, "Ratio Cut Partitioning for Hierarchical Designs", IEEE Transactions on Computer Aided Design, Vol. 10 No. 7, pp. 911--921, 1991.

....with an area penalty of only 0.33 . The good results demonstrated the effectiveness of this new partitioning technique. 1. Introduction Traditionally, circuit partitioning is done by simply modeling the circuit as a graph (or hypergraph) Graph partitioning problems are known to be NP hard [1]. A comprehensive survey [2] has presented the recent directions of partitioning. Commonly used partitioning algorithms can be categorized into three classes. The first class strictly abides by the modeling graph, with no attempt to change the graph. High quality results have been reported by ....

....of partitioning. Commonly used partitioning algorithms can be categorized into three classes. The first class strictly abides by the modeling graph, with no attempt to change the graph. High quality results have been reported by several algorithms which include iterative improvement based [1, 3], clustering based [4] and spectrum (eigenvector) based [5, 6] The second class of algorithms may modify the graph through node replications [7, 8] Improvement is achieved by sacrificing some area due to node replications. These two classes both perform the partitioning task on the graph ....

Y. C. Wei and C. K. Cheng, "Ratio cut partitioning for hierarchical designs," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 10(7), pp. 911--921, July 1991.

No context found.

Y. C. Wei and C. K. Cheng, "Ratio cut partitioning for hierarchical designs, " IEEE Trans. Computer-Aided Design, vol. 10, pp. 911--921, July 1991.

No context found.

Y.-C. Wei and C.-K. Cheng. Ratio cut partitioning for hierarchical design. IEEE Transactions on Computer-Aided Design, 10(7):911--921, 1991.

No context found.

Y.-C. Wei and C.-K. Cheng. Ratio cut partitioning for hierarchical design. IEEE Transactions on Computer-Aided Design, 10(7):911--921, 1991.

No context found.

Yen-Chuen Wei and Chung-Kuan Cheng. Ratio cut partitioning for hierarchical designs. IEEE Transactions on ComputerAided Design, 10(7):911--921, July 1991.

No context found.

Wei, Y., and Cheng, C. Ratio cut partitioning for hierarchical designs. IEEE Transactions on Computer Aided Design 10, 7 (1991), 911-- 921.

No context found.

Y.-C. Wei and C.-K. Cheng. Ratio cut partitioning for hierarchical designs. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 10(7):911--921, July 1991.

No context found.

Y. C. Wei and C. K. Cheng. Ratio cut partitioning for hierarchical design. IEEE Trans. on CAD, 40(7), pages 911-921, 1991.

No context found.

Wei, Y., and Cheng, C. Ratio cut partitioning for hierarchical designs. IEEE Transactions on Computer Aided Design 10, 7 (1991), 911-- 921.

No context found.

Y.-C. Wei and C.-K. Cheng. Ratio cut partitioning for hierarchical designs. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 10(7):911--921, July 1991.

No context found.

Y. C. Wei and C. K. Cheng, "Ratio cut partitioning for hierarchical designs, " IEEE Trans. Computer-Aided Design, vol. 10, pp. 911--921, July 1991.

No context found.

Yen-Chuen Wei and Chung-Kuan Cheng. Ratio cut partitioning for hierarchical design. IEEE Transactions on Computer-Aided Design, 10(7):911--921, 1991.

No context found.

Y. C. Wei and C. K. Cheng. Ratio cut partitioning for hierarchical designs. IEEE/ACM Transaction on Networking, 10(7):911--921, 1991.

No context found.

Y. C. Wei and C. K. Cheng, "Ratio Cut Partitioning for Hierarchical Designs," IEEE Transactions on Computer Aided Design, vol. 10, no. 7, pp.911-921, July 1991.

First 50 documents  Next 50

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