Using DPSO and B&B Algorithms for Hardware/Software Partitioning in Co-design
Taees Eimuri, Sara Salehi · 2010
This paper presents a hybrid method based on Discrete Particle Swarm Optimization (DPSO) and Branch-and-Bound (B&B) algorithms to solve Hardware/Software partitioning problems. In this approach, some pre-defined relations are used to present a formal solution for the partitioning problem. Then, DPSO is used to increase the speed of B&B. Results of experiments show that in case the problem has any optimal solution, proposed approach can find it in a better time, in addition to in the more formal manner.