Partitioning of VLSI circuits on subcircuits with minimal number of connections using evolutionary algorithm

Authors:
Adam Słowik;Michał Białko
Affiliations:
Department of Electronics and Computer Science, Technical University of Koszalin, Koszalin, Poland;Department of Electronics and Computer Science, Technical University of Koszalin, Koszalin, Poland
Venue:
ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
Year:
2006

Citing 4
Cited 1

Performance-driven MCM partitioning through an adaptive genetic algorithm

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
VISI Physical Design Automation: Theory and Practice

VISI Physical Design Automation: Theory and Practice
AllelesLociand the Traveling Salesman Problem

Proceedings of the 1st International Conference on Genetic Algorithms
A linear-time heuristic for improving network partitions

DAC '82 Proceedings of the 19th Design Automation Conference

An effective multilevel tabu search approach for balanced graph partitioning

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present an evolutionary algorithm application to partitioning VLSI circuits on subcircuits with minimal number of connections between them. The algorithm is characterized by a multi-layer chromosome structure. Due to this structure, the partition of circuits is possible without applying a repair mechanism in the algorithm. The test circuits chosen from literature and created randomly are partitioned using proposed method. Results obtained by this method are compared with results obtained using a traditional Kernighan-Lin algorithm.