Abstract
In last years, several approaches have been proposed for solving the Hardware/Software partitioning and scheduling problem in dynamically reconfigurable embedded systems (DRESs), directed by metaheuristic algorithms. Honey Bees Mating Optimization (HBMO) algorithm is one of these advanced methods. It is a nature inspired algorithm which simulates the process of real honey-bees mating. In this work, we propose a variant of the Honey-bee Mating Optimization Algorithm for solving Hardware/software (HW/SW) partitioning and scheduling problems in DRESs. The algorithm is used in a hybrid scheme with other metaheuristic algorithms for successfully solving these problems. More precisely, the proposed algorithm (HBMO_ DRESs) combines a Honey Bees Mating Optimization (HBMO) algorithm, the Tabu Search (TS) and Simulated Annealing (SA)). From an acyclic task graph and a set of Area-Time implementation trade off points for each task, the adopted method performs HW/SW partitioning and scheduling such that the global application execution time is minimized. Comparing the proposed method with Genetic Algorithm and Evolutionary Strategies (ES), the simulation results show that the proposed algorithm has better convergence performance.
Highlights
With the rapid development of integrated circuit manufacturing technology, embedded systems are widely used in a variety of complex applications
Reconfigurable embedded systems (DRESs) target an architecture consisting of general purpose processors and field programmable gate arrays (FPGAs), HW/SW partitioning is a key step of HW/SW codesign and it plays a crucial role in improving the system performance
A task of partitioning and scheduling approach with collective bees belavior (HBMO: Honey Bee Mating Optimization) has been proposed for Dynamically Reconfigurable Embedded systems augmented with the reconfigurable circuit
Summary
With the rapid development of integrated circuit manufacturing technology, embedded systems are widely used in a variety of complex applications. The decision about the functional blocks to be implemented in software or in hardware in the dynamically reconfigurable embedded systems is based on the experience of the designer and/or making a brief exploration of the design space. This procedure, in addition to not complying with any methodology, does not ensure an optimal result, since for obtaining the best configuration it is necessary to solve an optimization problem which in most of its formulations is NPhard [1]. - The differences and similarities found between the using of the HBMO_DRESs approach to revolve our problematic (partitioning and scheduling problem in dynamically reconfigurable embedded systems) and the HBMO related works. The paper finishes with the conclusion presented in the section 6
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
