Lars Hagen, Andrew B. Kahng  Home/Search
Context Related
| ucla.edu/papers/conference/c22.ps ucla.edu/~abk/papers/conferenc...c22.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ucla.edu/publications (more) From: ucla.edu/~abk/publications (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The complexity of next-generation VLSI systems will exceed the capabilities of top-down layout synthesis algorithms, particularly in netlist partitioning and module placement. Bottom-up clustering is needed to "condense" the netlist so that the problem size becomes tractable to existing optimization methods. In this paper, we establish the DS quality measure, the first general metric for evaluation of clustering algorithms. The DS metric in turn motivates our RWST algorithm, a new self-tuning... (Update)
Context of citations to this paper: More
.... witnessed by the many ad hoc means in the literature (e.g. all pairs shortest paths, k Gamma l connectivity [9] degree=separation [10], etc. Because the min cut partitioning objective of Equation (1) requires us to minimize f and the max sum objective of Equation (3)...
...problem is NP complete. However, many algorithms have been developed that find reasonably good partitionings [23, 22, 9, 24, 19, 18, 20, 2, 3, 7, 8, 12, 5, 21, 16, 13]. The k way partitioning problem is most frequently solved by recursive bisection. That is, we first obtain a 2...
Cited by: More
Energy Models for Drawing Clustered Small-World Graphs - Noack (2003) (Correct)
Parallel Multilevel k-way Partitioning Scheme for Irregular.. - Karypis, Kumar (1996) (Correct)
Multilevel k-way Partitioning Scheme for Irregular Graphs - Karypis, Kumar (Correct)
Active bibliography (related documents): More All
0.2: Design Driven Partitioning - Behrens, Barke, Tolkiehn (1997) (Correct)
0.1: A Parallel Bottom-up Clustering Algorithm with Applications to.. - Cong, Smith (1993) (Correct)
0.1: Combining Problem Reduction and Adaptive Multi-Start: A New.. - Hagen (1995) (Correct)
Similar documents based on text: More All
0.3: A General Framework for Vertex Orderings, with Applications to .. - Alpert, Kahng (1996) (Correct)
0.3: Geometric Embeddings for Faster and Better Multi-Way Netlist.. - Alpert, Kahng (1993) (Correct)
0.2: Net Partitions Yield Better Module Partitions - Jason Cong (1992) (Correct)
Related documents from co-citation: More All
29: A linear time heuristic for improving network partitions (context) - Fiduccia, Mattheyses - 1982
20: Fast spectral methods for ratio cut partitioning and clustering (context) - Hagen, Kahng - 1991
20: Finding clusters in VLSI circuits (context) - Garbers, Promel et al. - 1990
BibTeX entry: (Update)
L. Hagen and A. B. Kahng. A new approach to effective circuit clustering. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design, pages 422--427, Santa Clara, California, Nov. 1992. http://citeseer.ist.psu.edu/hagen92new.html More
@inproceedings{ hagen92new,
author = "Lars W. Hagen and Andrew B. Kahng",
title = "A new approach to effective circuit clustering",
booktitle = "{ICCAD}",
pages = "422-427",
year = "1992",
url = "citeseer.ist.psu.edu/hagen92new.html" }
Citations (may not include all citations):72 Graph Bisection Algorithms with Good Average Case Behavior (context) - Bui, Chaudhuri et al. - 1987
55 An efficient heuristic for partitioning graphs (context) - Kernighan, Lin - 1970
43 Improving the Performance of the KernighanLin and Simulated .. (context) - Bui - 1989
41 Fast Spectral Methods for Ratio Cut Partitioning and Cluster.. (context) - Hagen, Kahng - 1991
31 Towards efficient hierarchical designs by ratio cut partitio.. (context) - Wei, Cheng - 1989
29 Collisions Among Random Walks on a Graph - Coppersmith, Tetali et al.
25 Module Placement Based on Resistive Network Optimization (context) - Cheng, Kuh - 1984
25 Logic Partitioning (context) - Donath - 1988
21 A unified approach to partitioning and placement (context) - Tsay, Kuh - 1986
20 the Cover Time of Random Walks on Graphs (context) - Kahn, Linial et al. - 1989
18 An Improved Simulated Annealing Algorithm for Row-Based Plac.. (context) - Sechen, Lee - 1987
14 Random Walks for Circuit Clustering (context) - Cong, Hagen et al. - 1991
12 A Two-Level Two-Way Partitioning Algorithm (context) - Wei, Cheng - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://vlsicad.cs.ucla.edu/publications.html): More
Improving the Quadratic Objective Function in Module Placement - Hagen, Kahng (1992) (Correct)
On Implementation Choices for Iterative Improvement.. - Hagen, Huang, Kahng (1997) (Correct)
A Direct Combination of the Prim and Dijkstra.. - Alpert, Hu, Huang, Kahng (1993) (Correct)
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