An investigation of parallel memetic algorithms for VLSI circuit partitioning on multi-core computers
- 1 May 2010
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in CCECE 2010
Abstract
Circuit-partitioning is one of the most important, but time-consuming steps, in the VLSI design flow. In this paper, we investigate six different parallel Memetic Algorithms for solving the circuit-partitioning problem. Each parallel implementation uses a global shared-memory to exchange information, and seeks to reduce runtime by exploiting the multiple cores available in today's commodity hardware. When tested with the widely used ACM/SIGDA benchmark suite, our empirical results show that near-linear speedups for all six MAs can be achieved, while still producing high-quality solutions.Keywords
This publication has 9 references indexed in Scilit:
- A hardware Memetic accelerator for VLSI circuit partitioningComputers and Electrical Engineering, 2007
- Assigning data to dual memory banks in DSPs with a genetic algorithm using a repair heuristicApplied Intelligence, 2006
- Parallel MetaheuristicsPublished by Wiley ,2005
- Statistical analysis of the main parameters involved in the design of a genetic algorithmIEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews), 2002
- A fast and stable hybrid genetic algorithm for the ratio-cut partitioning problem on hypergraphsPublished by Association for Computing Machinery (ACM) ,1994
- Multiple-way network partitioningInternational Conference on Acoustics, Speech, and Signal Processing (ICASSP), 1989
- Anomalies in parallel branch-and-bound algorithmsCommunications of the ACM, 1984
- An Improved Min-Cut Algonthm for Partitioning VLSI NetworksInternational Conference on Acoustics, Speech, and Signal Processing (ICASSP), 1984
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970