Use dynamic combination of two meta-heuristics to do bi-partitioning

Authors:
Zhihui Xiong;Sikun Li;Jihua Chen;Maojun Zhang
Affiliations:
,School of Information System and Management, National University of Defense Technology, Changsha, P.R. China;School of Computer Science, National University of Defense Technology, Changsha, P.R. China;School of Computer Science, National University of Defense Technology, Changsha, P.R. China;School of Information System and Management, National University of Defense Technology, Changsha, P.R. China
Venue:
ICESS'04 Proceedings of the First international conference on Embedded Software and Systems
Year:
2004

Citing 6
Cited 0

A binary-constraint search algorithm for minimizing hardware during hardware/software partitioning

EURO-DAC '94 Proceedings of the conference on European design automation
MAX-MIN Ant system

Future Generation Computer Systems
Hardware-Software Cosynthesis for Microcontrollers

IEEE Design & Test
Hardware/Software Partitioning using Integer Programming

EDTC '96 Proceedings of the 1996 European conference on Design and Test
Hardware Software Partitioning Using Genetic Algorithm

VLSID '97 Proceedings of the Tenth International Conference on VLSI Design: VLSI in Multimedia Applications
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In order to solve the hardware/software bi-partitioning problems in embedded system and System-on-a-Chip co-design, we put forward a novel bi-partitioning algorithm, which is based on the dynamic combination of Genetic Algorithm (GA) and Ant System Algorithm (ASA). The basic idea is: 1).Firstly, we use Genetic Algorithm to generate preliminary partitioning results, which are then converted into initial pheromone required by Ant System Algorithm, and finally we use Ant System Algorithm to search for the optimal partitioning scheme; 2).While the Genetic Algorithm is running, we determine the best combination time of GA and ASA dynamically, thus, the Genetic Algorithm avoids too early or too late termination. Experiments show that our algorithm excels GA and ASA in performance; moreover, we discover that the bigger partitioning problems are, the better our algorithm performs.