Loughborough University
Browse
newton2003-final.pdf (189.18 kB)

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

Download (189.18 kB)
online resource
posted on 2008-11-07, 11:42 authored by Matthew Newton, Ondrej Sykora, Mark S. Withall, Imrich Vrt'o
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.

History

School

  • Science

Department

  • Computer Science

Citation

NEWTON, M. ... et al, 2003. A parallel approach to row-based VLSI layout using stochastic hill-climbing. IN: Chung, P.W.H., Hinde, C. and Ali, M. (eds.). Developments in applied artificial intelligence : 16th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, IEA/AIE 2003, Loughborough, UK, June 23-26, 2003 : proceedings. Berlin ; New York : Springer, pp. 750-758

Publisher

© Springer

Publication date

2003

Notes

This is a conference paper. The definitive version is available from: http://www.springerlink.com/

ISBN

3540404554;9783540404552

ISSN

0302-9743

Language

  • en

Usage metrics

    Loughborough Publications

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC