A parallel approach to row-based VLSI layout using stochastic hill-climbing

Authors:
Matthew Newton;Ondrej Sýkora;Mark Withall;Imrich Vrt'o
Affiliations:
Department of Computer Science, Loughborough University, Loughborough, Leics., United Kingdom;Department of Computer Science, Loughborough University, Loughborough, Leics., United Kingdom;Department of Computer Science, Loughborough University, Loughborough, Leics., United Kingdom;Department of Informatics, Institute of Mathematics, Slovak Academy of Sciences, Bratislava, Slovak Republic
Venue:
IEA/AIE'2003 Proceedings of the 16th international conference on Developments in applied artificial intelligence
Year:
2003

Citing 6
Cited 0

A new lower bound for the bipartite crossing number with applications

Theoretical Computer Science
Layered drawings of digraphs

Drawing graphs
An Introduction to VLSI Physical Design

An Introduction to VLSI Physical Design
Graph Drawing: Algorithms for the Visualization of Graphs

Graph Drawing: Algorithms for the Visualization of Graphs
On Bipartite Crossings, Largest Biplanar Subgraphs, and the Linear Arrangement Problem

WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Which Aesthetic has the Greatest Effect on Human Understanding?

GD '97 Proceedings of the 5th International Symposium on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Parallel algorithms based on stochastic hill-climbing and parallel algorithms based on simple elements of a genetic algorithm for the one-sided bipartite crossing number problem, used in row-based VLSI layout, were investigated. These algorithms were run on a PVM cluster. The experiments show that the parallel approach does not bring faster computation but it does, however, much more importantly, bring a better quality solution to the problem, i.e. it generates drawings with lower numbers of pairwise edge crossings.