An efficient eigenvector approach for finding netlist partitions
نویسندگان
چکیده
منابع مشابه
An efficient eigenvector approach for finding netlist partitions
A fast eigenvector technique for obtaining good initial node partitions of netlists for use in interchange heuristics is described. The method is based on approximating the netlist or hypergraph by a weighted graph, G, such that the sum of the cut edges in G tightly underestimates the number of cut nets in any netlist partition. An eigenvector technique of Barnes [2] is used to partition the gr...
متن کاملA N Efficient Eigenvector-node Interchange Approach for Finding Netlist Partitions
graph G and applying the eigenvector technique of Barnes 111 to partition the graph G into IC blocks of fixed module . size. An efficient generalization of the Fiduccia-Mattheyses node interchange heuristic is developed to further reduce the number of nets connecting k blocks [3]. This node interchange heuristic is tested on the one resulting netlist partition obtained by this new eigenvector a...
متن کاملAn efficient approach for solving layout problems
This paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. By this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. This is resulted from dividing area into discrete and continuous dimensions. Also defining decision var...
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملAn Efficient and Complete Approach for Cooperative Path-Finding
Cooperative path-finding requires the computation of a set of compatible paths for multiple agents operating on a discrete roadmap. The goal of this problem is to navigate each agent to their unique target vertices without simultaneously occupying the same vertex or edge in the roadmap as any other agent. Such a formulation has applications in warehouse management, transportation networks, (dis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
سال: 1992
ISSN: 0278-0070
DOI: 10.1109/43.144852