Improving the performance of the Kernighan-Lin and simulated annealing graph bisection algorithms

Authors:
T. Bui;C. Heigham;C. Jones;T. Leighton
Affiliations:
Computer Science Department, Pennsylvania State University, University Park, Pennsylvania;Math Department & Lab for Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts;Computer Science Department, Pennsylvania State University, University Park, Pennsylvania;Math Department & Lab for Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts
Venue:
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Year:
1989

Citing 1
Cited 28

Graph bisection algorithms with good average case behavior

Combinatorica

A general purpose multiple way partitioning algorithm

DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
Geometric embeddings for faster and better multi-way netlist partitioning

DAC '93 Proceedings of the 30th international Design Automation Conference
A parallel bottom-up clustering algorithm with applications to circuit partitioning in VLSI design

DAC '93 Proceedings of the 30th international Design Automation Conference
A general framework for vertex orderings, with applications to netlist clustering

ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Circuit partitioning for huge logic emulation systems

DAC '94 Proceedings of the 31st annual Design Automation Conference
A gradient method on the initial partition of Fiduccia-Mattheyses algorithm

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Hierarchical partitioning

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
A Hypergraph Framework for Optimal Model-Based Decomposition ofDesign Problems

Computational Optimization and Applications
A hierarchy-driven FPGA partitioning method

DAC '97 Proceedings of the 34th annual Design Automation Conference
Multilevel hypergraph partitioning: application in VLSI domain

DAC '97 Proceedings of the 34th annual Design Automation Conference
Multilevel circuit partitioning

DAC '97 Proceedings of the 34th annual Design Automation Conference
Quadratic placement revisited

DAC '97 Proceedings of the 34th annual Design Automation Conference
Circuit clustering using graph coloring

ISPD '99 Proceedings of the 1999 international symposium on Physical design
A new approach to effective circuit clustering

ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
Combinatorial Optimization by Dynamic Contraction

Journal of Heuristics
A Fast and Robust Network Bisection Algorithm

IEEE Transactions on Computers
Genetic Algorithm and Graph Partitioning

IEEE Transactions on Computers
An adaptive partitioning algorithm for distributed discrete event simulation systems

Journal of Parallel and Distributed Computing - Problems in parallel and distributed computing: Solutions based on evolutionary paradigms
An evaluation of bipartitioning techniques

ARVLSI '95 Proceedings of the 16th Conference on Advanced Research in VLSI (ARVLSI'95)
A new fuzzy-clustering-based approach for two-way circuit partitioning

VLSID '95 Proceedings of the 8th International Conference on VLSI Design
Circuit partitioning into small sets: a tool to support testing with further applications

EURO-DAC '91 Proceedings of the conference on European design automation
Iterative compaction: an improved approach to graph and circuit bisection

EURO-DAC '91 Proceedings of the conference on European design automation
Recursive bi-partitioning of netlists for large number of partitions

Journal of Systems Architecture: the EUROMICRO Journal - Special issue: Synthesis and verification
A semi-persistent clustering technique for VLSI circuit placement

Proceedings of the 2005 international symposium on Physical design
Automated memory-aware application distribution for Multi-processor System-on-Chips

Journal of Systems Architecture: the EUROMICRO Journal
An Enzyme-Inspired Approach to Surmount Barriers in Graph Bisection

ICCSA '08 Proceeding sof the international conference on Computational Science and Its Applications, Part I
Hypergraph Cuts & Unsupervised Representation for Image Segmentation

Fundamenta Informaticae
Scheduling of tasks with batch-shared I/O on heterogeneous systems

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we compare the performance of two popular graph bisection algorithms. We also present an empirical study of a new heuristic, first proposed in [B87], that dramatically improves the performance of these bisection algorithms on graphs with small (≤ 4) average degree.