DocumentCode :
2711224
Title :
Using DPSO and B&B Algorithms for Hardware/Software Partitioning in Co-design
Author :
Eimuri, Taees ; Salehi, Sara
Author_Institution :
Islamic Azad Univ. of Parand, Parand, Iran
fYear :
2010
fDate :
7-10 May 2010
Firstpage :
416
Lastpage :
420
Abstract :
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.
Keywords :
hardware-software codesign; particle swarm optimisation; tree searching; B&B algorithm; DPSO; branch-and-bound algorithm; discrete particle swarm optimization; hardware-software codesign; hardware-software partitioning; Clustering algorithms; Costs; Embedded software; Embedded system; Hardware; Particle swarm optimization; Partitioning algorithms; Signal processing algorithms; Software algorithms; Software performance; Branch-and-Bound (B&B) algorithm; Discrete Particle Swarm Optimization (DPSO) algorithm; HW/SW co-design; HW/SW partitioning;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Research and Development, 2010 Second International Conference on
Conference_Location :
Kuala Lumpur
Print_ISBN :
978-0-7695-4043-6
Type :
conf
DOI :
10.1109/ICCRD.2010.88
Filename :
5489592
Link To Document :
بازگشت