M. A. Breuer, "A class of min-cut placement algorithms," in Proc. ACM/IEEE Design Automation Conf., 1977.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....in terms of different goals, but can also produce correspondingly good results. 1. Introduction The standard cell placement problem has drawn extensive research attention in the VLSI CAD field. Many algorithms have been proposed for placement problem [ 17 ] for example, min cut placement [8, 9], simulated annealing [10] analytical method [11, 12] and forcedirected approach [ 1 ] Though the placement problem has been studied for more than thirty years, major advances have been made on this topic in recent years. Yet there are some fundamental questions unanswered. The placement ....

M. A. Breuer. "A Class of Min-cut Placement Algorithms". In Design Automation Conference, pages 284-290. IEEE/ACM, 1977.

....that minimizing wirelength improves routability and layout quality. 1. Introduction Standard cell placement problem has drawn extensive research attention in VLSI CAD area. One common classification for traditional placement methods is to put them into four basic categories: min cut placement [1, 2], simulated annealing [3] analytical method [4, 5] and force directed approach [6] However, recently proposed placement tools rarely reside in any one of these categories. Most of them are more or less hybrid models . Four classical techniques, plus clustering and flow based method, ....

M. A. Breuer. "A Class of Min-cut Placement Algorithms". In Design Automation Conference, pages 284--290. IEEE/ACM, 1977.

....box wirelength, was widely used as an objective function to optimize routability. It is commonly believed that a shorter total wirelength implies better routability. Wirelength optimization has been extensively studied during the past two decades. Successful placement techniques include min cut [1, 2], simulated annealing [3] and analytical approach [4, 5] Congestion is an important indicator of routability in placement, and it has become dominant for large, tight designs. Previous works addressed the congestion problem using various methods. Mayrhofer and Lauther [6] combine congestion ....

M. A. Breuer. \A Class of Min-cut Placement Algorithms". In Design Automation Conference, pages 284-290. IEEE/ACM, 1977.

....box wirelength, was widely used as an objective function to optimize routability. It is commonly believed that a shorter total wirelength implies better routability. Wirelength optimization has been extensively studied during the past two decades. Successful placement techniques include min cut [1], simulated annealing [2] and analytical approach [3] Congestion is another important indicator of routability in placement, and it has become dominant for large, tight designs. Previous works addressed the congestion problem using various methods. Mayrhofer and Lauther [4] combine congestion ....

M. A. Breuer. "A Class of Min-cut Placement Algorithms". In Design Automation Conference, pages 284--290. IEEE/ACM, 1977.

....This approach has become more attractive recently; advances in partitioning research have provided a number of fast algorithms which produce extremely good results. Our standard cell placement approach is integrated into a traditional partitioning based framework. In an early algorithm, Breuer[1] utilized repeated graph bisections to obtain a circuit placement; this approach is shown in Figure 1. The bisections divide the circuit netlist into a hierarchy of cells, with the resulting hierarchy roughly mapping into a rectilinear grid. Dunlop and Kernighan[4] extended this approach, through ....

M. A. Breuer. A class of min-cut placement algorithms. In Proc. Design Automation Conf, pages 284--290, 1997.

....smaller clusters, a hierarchy with small numbers of inter cluster connections can be obtained. By assigning each cluster to a physical region on the integrated circuit, we obtain a placement which has small numbers of inter region connections. An early placement algorithm based on this approach is [4]. In [9] the KL algorithm was utilized to provide improved results. Recently, 12] applied an effective multilevel and multi way partitioning algorithm, replacing the minimum cut objective with a more precise estimate of wiring length. Figure 1 shows an application of bipartitioning to ....

M. A. Breuer. A class of min-cut placement algorithms. In Proc. Design Automation Conf, pages 284--290, 1977.

....cut sequence method into Capo, we are able to improve performance by 5 , bringing the results of Feng Shui and Capo closer together. 1. INTRODUCTION Placement by recursive partitioning is one of the oldest approaches to a fundamental problem in computer aided design. First introduced by Breuer[2], and subsequently improved by Dunlop and Kernighan[5] the approach has proven to be popular and competitive. With recent advances in hypergraph partitioning, there has been a resurgence of interest in the approach. The work described here was motivated by a series of experiments performed with ....

....terminal propagation. In these methods, and other more recent approaches, we have to choose if we are to partition a region horizontally or vertically. In Figure 1, a number of different sequences are shown. It was suggested by Breuer that a good approach might utilize alternating cut directions[2], but other strategies were considered possible. In the early work by Breuer, three sequences are suggested. The first is a series of cuts in alternating directions. The second employs repeated quadrisections. The third performs horizontal cuts until each region occupies a single cell row, with ....

M. A. Breuer. A class of min-cut placement algorithms. In Proc. Design Automation Conf, pages 284--290, 1997.

....algorithm based on hierarchical partitioning as a partition driven placement (PDP) method. Basically, PDP is based on repeated subdivision of the given netlist and layout surface (core region) into subcircuits and rectangular regions, respectively, and assignment of subcircuits to those regions [1, 4]. When each subcircuit consists of only one cell, it is also uniquely placed in a region, marking the termination of PDP. Such a process can be represented by construction of a partition tree (see Fig. 1b) where each node in the tree represents a region and circuit cells assigned to it. The root ....

....this section. Experimental results under various settings are given in Sec. 4. These include internal comparisons showing utility of certain techniques, and com1 parisons with other placement tools. Conclusions are in Sec. 5. 2 Previous PDP Work The PDP method was first studied in the late 70 s [1]. Sequential cutsize minimization is proposed, so that all regions in the corresponding partition tree are bi partitioned in a breadth first manner, and cutsize is minimized locally for each region under processing, regardless of possible resultant suboptimality for other regions or levels not yet ....

[Article contains additional citation context not shown here]

M.Breuer, "A Class of Min-cut Placement Algorithm," Proc. 14th DAC, pp. 284-290, 1977.

....Local search strategies were for a long time considered superior to the partitioning based placement. However, with the release of tools such as GORDIAN [56] the partitioningbased methods became competitive. The first partitioning based placement tools used the technique of min cut bisection [18, 19, 46, 58]. With this technique the chip area is cut into two sections, and the functiongroups partitioned between the two sections in such a way as to minimize the number of nets split between partitions. The process is then applied recursively to each partition, until the area is small enough that the ....

M. Breuer. A class of min-cut placement algorithms. Proceedings of the 14th ACM/IEEE Design Automation Conference, pages 284--290, 1977.

....are distributed equally (by size) among both partitions. The resulting partitions are improved using the KL or the FM heuristics. This method is recursively applied until the size of every partition is below the page size. The idea that lead to the HP algorithm was taken from the work of Breuer [Bre77]. 3.2 Constructive Algorithms Optimum Partitioning of Trees. Lukes [Luk74] presents a pseudopolynominal time algorithm for computing an optimum partitioning for the vertices of a tree, based on dynamic programming. The complexity of the algorithm is O(n B 2 max ) where n is the number of ....

M. A. Breuer. A class of min-cut placement algorithms. In Proc. of the Design Automation Conference, pages 284--290, 1977.

....to improve the partitions, and so on. This method is recursively applied until the size of every partition is below the page size. After the termination of this process FM is applied to further improve this partitioning. The idea that lead to the HP algorithm was taken from the work of Breuer [Bre77]. 3.2 Constructive Algorithms 3.2.1 Optimum Partitioning of Trees Lukes [Luk74] presents a pseudopolynominal time algorithm for computing an optimum partitioning for the vertices of a tree, based on dynamic programming. The complexity of the algorithm is O(n 3 B 2 max ) where n is the number ....

M. A. Breuer. A class of min-cut placement algorithms. In Proc. of the Design Automation Conference, pages 284--290, 1977.

....properties of FPGA routing architectures. We shall first review the generic hierarchical approach and then present the unique features in our router. The generic hierarchical approach proceeds as follows. Starting with the entire circuit, a cut line is chosen in a certain way (such as min cut [4, 30]) to divide the circuit into two parts. Across the cut line there are routing sections which represents routing spaces on the chip. See Figure 4 for an illustration of the terminology. A routing section is usually a channel with a routing capacity specified by the channel width. Each connection ....

M. A. Breuer, "A class of min-cut placement algorithms," Proc. of Design Automation Conf., pp. 284--290, 1977.

....6.2: An example FPGA global routing graph. some sophisticated partitioning based algorithms such as GORDIAN [97] have provided strong competition for local search strategies. The origins of partitioning based placement are represented by the min cut bisection algorithms of Gunther [68] Breuer [15, 16], and Lauther [102] In these algorithms, a vertical line is conceptually drawn down the approximate center of the circuit area. The logic blocks are then partitioned into two groups of roughly equal size, which will be placed on opposite sides of the line. The partitioning step typically tries to ....

M. A. Breuer. A class of min-cut placement algorithms. In Proceedings of the Fourteenth Design Automation Conference, pages 284--290, 1977.

....properties of FPGA routing architectures. We shall first review the generic hierarchical approach and then present the unique features in our router. The generic hierarchical approach proceeds as follows. Starting with the entire circuit, a cut line is chosen in a certain way (such as min cut [3]) to divide the circuit into two parts. Across the cut line there are routing sections which represent routing spaces on the chip. See Figure 5 for an illustration of the terminology. A routing section is usually a channel with a routing capacity specified by the channel width. Each connection ....

M. A. Breuer, "A class of min-cut placement algorithms," in Proc. of Design Automation Conf., pp. 284--290, 1977.

No context found.

M. A. Breuer, "A class of min-cut placement algorithms," in Proc. ACM/IEEE Design Automation Conf., 1977.

No context found.

M.A. Breuer, "A Class of Min-Cut Placement Algorithms," Proceedings DAC, pp. 284-290, 1977.

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