Near-optimal parallel algorithm for one-dimensional gate assignment in VLSI layout

K. Tsuchiya, Y. Takefuji

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


A novel approach to the one-dimensional gate assignment problem is presented in this paper where the problem is NP-hard and one of the most fundamental layout problems in VLSI design. The proposed system is composed of n×n processing elements called the artificial two-dimensional maximum neurons for (n+2)-gate assignment problems. We have discovered the improved solutions in the benchmark problems over the best existing algorithms. The proposed parallel algorithm is also applicable to other VLSI layout problems.

Original languageEnglish
Pages (from-to)249-257
Number of pages9
JournalIntegrated Computer-Aided Engineering
Issue number3
Publication statusPublished - 1999

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Computer Science Applications
  • Computational Theory and Mathematics
  • Artificial Intelligence


Dive into the research topics of 'Near-optimal parallel algorithm for one-dimensional gate assignment in VLSI layout'. Together they form a unique fingerprint.

Cite this