Results 1 
8 of
8
VLSI cell placement techniques
 ACM Computing Surveys
, 1991
"... VLSI cell placement problem is known to be NP complete. A wide repertoire of heuristic algorithms exists in the literature for efficiently arranging the logic cells on a VLSI chip. The objective of this paper is to present a comprehensive survey of the various cell placement techniques, with emphasi ..."
Abstract

Cited by 88 (0 self)
 Add to MetaCart
VLSI cell placement problem is known to be NP complete. A wide repertoire of heuristic algorithms exists in the literature for efficiently arranging the logic cells on a VLSI chip. The objective of this paper is to present a comprehensive survey of the various cell placement techniques, with emphasis on standard ce11and macro
Graph Minimum Linear Arrangement by Multilevel Weighted Edge Contractions
, 2006
"... The minimum linear arrangement problem is widely used and studied in many practical and theoretical applications. In this paper we present a lineartime algorithm for the problem inspired by the algebraic multigrid approach which is based on weighted edge contraction rather than simple contraction. ..."
Abstract

Cited by 20 (7 self)
 Add to MetaCart
The minimum linear arrangement problem is widely used and studied in many practical and theoretical applications. In this paper we present a lineartime algorithm for the problem inspired by the algebraic multigrid approach which is based on weighted edge contraction rather than simple contraction. Our results turned out to be better than every known result in almost all cases, while the short running time of the algorithm enabled experiments with very large graphs.
Efficient Network Flow Based MinCut Balanced Partitioning
, 1996
"... We consider the problem of bipartitioning a circuit into two balanced components that minimizes the number of crossing nets. Previously, Kernighan and Lin type (K&L) heuristics, simulated annealing approach, and analytical methods were given to solve the problem. However, network flow (maxflow ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
We consider the problem of bipartitioning a circuit into two balanced components that minimizes the number of crossing nets. Previously, Kernighan and Lin type (K&L) heuristics, simulated annealing approach, and analytical methods were given to solve the problem. However, network flow (maxflow mincut) techniques were overlooked as viable heuristics to mincut balanced bipartition due to their high complexity. In this paper we propose a balanced bipartition heuristic based on repeated maxflow mincut techniques, and give an efficient implementation that has the same asymptotic time complexity as that of one maxflow computation. We implemented our heuristic algorithm in a package called FBB. The experimental results demonstrate that FBB outperforms K&L heuristics and analytical methods in terms of the number of crossing nets, and our efficient implementation makes it possible to partition large circuit netlists with reasonable runtime. For example, the average elapsed time for bipartitioning a circuit S35932 of almost 20 K gates is less than 20 min on a SPARC10 with 32 MB memory.
Multilevel algorithms for linear ordering problems
, 2007
"... Linear ordering problems are combinatorial optimization problems which deal with the minimization of different functionals in which the graph vertices are mapped onto (1, 2,..., n). These problems are widely used and studied in many practical and theoretical applications. In this paper we present a ..."
Abstract

Cited by 11 (6 self)
 Add to MetaCart
(Show Context)
Linear ordering problems are combinatorial optimization problems which deal with the minimization of different functionals in which the graph vertices are mapped onto (1, 2,..., n). These problems are widely used and studied in many practical and theoretical applications. In this paper we present a variety of lineartime algorithms for these problems inspired by the Algebraic Multigrid approach which is based on weighted edge contraction. The experimental result for four such problems turned out to be better than every known result in almost all cases, while the short running time of the algorithms enables testing very large graphs.
Fast Approximation Algorithms on Maxcut, kColoring and kColor Ordering for VLSI Applications
, 1994
"... There is a number of VLSI problems that have a common structure. We investigate such a structure that leads to a unified approach for three independent VLSI layout problems: partitioning, placement and via minimization. Along the line, we first propose a lineartime approximation algorithm on maxcut ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
There is a number of VLSI problems that have a common structure. We investigate such a structure that leads to a unified approach for three independent VLSI layout problems: partitioning, placement and via minimization. Along the line, we first propose a lineartime approximation algorithm on maxcut and two closely related problems: k coloring and maximal kcolor ordering problem. The kcoloring is a generalization of the maxcut and the maximal kcolor ordering is a generalization of the kcoloring. For a graph G with e edges and n vertices, our maxcut approximation algorithm runs in O(e + n) sequential time yielding a nodebalanced maxcut with size at least (w(E) + w(E)=n)=2, improving the time complexity of O(e log e) known before. Building on the proposed maxcut technique and employing a heightbalanced binary decomposition, we devise an O((e + n) log k) time algorithm for the kcoloring problem which always finds a kpartition of vertices such that the number of bad (or "defec...
ProblemIndependent Schema Synthesis for Genetic Algorithms
"... Abstract. As a preprocessing for genetic algorithms, static reordering helps genetic algorithms effectively create and preserve highquality schemata, and consequently improves the performance of genetic algorithms. In this paper, we propose a static reordering method independent of problemspecific ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
(Show Context)
Abstract. As a preprocessing for genetic algorithms, static reordering helps genetic algorithms effectively create and preserve highquality schemata, and consequently improves the performance of genetic algorithms. In this paper, we propose a static reordering method independent of problemspecific knowledge. One of the novel features of our reordering method is that it is applicable to any problem with no information about the problem. The proposed method constructs a weighted complete graph from the gene distances calculated from solutions with relatively high fitnesses, transforms them into a geneinteraction graph, and finds a gene rearrangement. Extensive experimental results showed significant improvement for a number of applications. 1
Tutorial on VLSI Partitioning
, 2000
"... The tutorial introduces the partitioning with applications to VLSI circuit designs. The problem formulations include twoway, multiway, and multilevel partitioning, partitioning with replication, and performance driven partitioning. We depict the models of multiple pin nets for the partitioning pro ..."
Abstract
 Add to MetaCart
The tutorial introduces the partitioning with applications to VLSI circuit designs. The problem formulations include twoway, multiway, and multilevel partitioning, partitioning with replication, and performance driven partitioning. We depict the models of multiple pin nets for the partitioning processes. To derive the optimum solutions, we describe the branch and bound method and the dynamic programming method for a special case of circuits. We also explain several heuristics including the group migration algorithms, network flow approaches, programming methods, Lagrange multiplier methods, and clustering methods. We conclude the tutorial with research directions.
The UCSD Active Web
, 1997
"... The UCSD Department of Computer Science and Engineering recently submitted a proposal for largescale Research Infrastructure funding to the National Science Foundation. The theme of the proposal is the "Active Web", a nextgeneration World Wide Web premised on the support for active co ..."
Abstract
 Add to MetaCart
The UCSD Department of Computer Science and Engineering recently submitted a proposal for largescale Research Infrastructure funding to the National Science Foundation. The theme of the proposal is the "Active Web", a nextgeneration World Wide Web premised on the support for active content, content that is rich in multimedia and references to other other objects, and for mobile agents, programs that can move about and execute on remote servers, carrying out requests at a distance on behalf of users. These servers are no longer passive databases as in today's Web, but contextsensitive "knowledge networks" that contain all kinds of active content; between the servers themselves there is a constant exchange of agents, which add to, refine, form interconnections, and make consistent, the distributed content. In the Active Web, there is a high degree of resource sharing, usage is bought and sold as in a market economy, and security is paramount. To realize this vision, the De...