Netlist bipartitioning using particle swarm optimisation technique

Authors:
Sandeep Singh Gill;Rajeevan Chandel;Ashwani Kumar Chandel
Affiliations:
Electronics and Communication Engineering Department, Guru Nanak Dev Engineering College, Ludhiana, Punjab 141006, India;Electronics and Communication Engineering Department, National Institute of Technology, Hamirpur (HP) 177005, India;Electrical Engineering Department, National Institute of Technology, Hamirpur (HP) 177005, India
Venue:
International Journal of Artificial Intelligence and Soft Computing
Year:
2012

Citing 20
Cited 0

Multiple-Way Network Partitioning

IEEE Transactions on Computers
Net partitions yield better module partitions

DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Multilevel hypergraph partitioning: application in VLSI domain

DAC '97 Proceedings of the 34th annual Design Automation Conference
Algorithms for VLSI Physcial Design Automation

Algorithms for VLSI Physcial Design Automation
VISI Physical Design Automation: Theory and Practice

VISI Physical Design Automation: Theory and Practice
Multi-objective circuit partitioning for cutsize and path-based delay minimization

Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Multi-objective design space exploration using genetic algorithms

Proceedings of the tenth international symposium on Hardware/software codesign
Dynamic hardware/software partitioning: a first approach

Proceedings of the 40th annual Design Automation Conference
A proper model for the partitioning of electrical circuits

DAC '72 Proceedings of the 9th Design Automation Workshop
A linear-time heuristic for improving network partitions

DAC '82 Proceedings of the 19th Design Automation Conference
Genetic multiway partitioning

VLSID '95 Proceedings of the 8th International Conference on VLSI Design
A Low-Power Partitioning Methodology by Maximizing Sleep Time and Minimizing Cut Nets

IWSOC '05 Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications
Fundamentals of Computational Swarm Intelligence

Fundamentals of Computational Swarm Intelligence
Module Clustering to Minimize Delay in Digital Networks

IEEE Transactions on Computers
An Improved Min-Cut Algonthm for Partitioning VLSI Networks

IEEE Transactions on Computers
Analysis of the publications on the applications of particle swarm optimisation

Journal of Artificial Evolution and Applications - Regular issue
Application partitioning on programmable platforms using the ant colony optimization

Journal of Embedded Computing - Embeded Processors and Systems: Architectural Issues and Solutions for Emerging Applications
Inertia-Adaptive Particle Swarm Optimizer for Improved Global Search

ISDA '08 Proceedings of the 2008 Eighth International Conference on Intelligent Systems Design and Applications - Volume 02
Frankenstein's PSO: a composite particle swarm optimization algorithm

IEEE Transactions on Evolutionary Computation
Ratio cut partitioning for hierarchical designs

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper circuit netlist bipartitioning using particle swarm optimisation technique is presented. Particle swarm optimisation is a powerful evolutionary computation technique for global search and optimisation. The circuit netlist is partitioned into two partitions such that the number of interconnections between the partitions (cutsize) is minimised. Results obtained show the versatility of the proposed soft computing method in solving non polynomial hard problems like circuit netlist partitioning.