Abstract
Hardware/Software partitioning is the bottleneck of embedded system design, which is directly related to performance and cost. A lot of works have been done such as the simulated annealing algorithm, greedy algorithm and evaluation algorithm. This paper, apply ant colony search algorithm (ACSA) to hardware/software partitioning. It constructed the partitioning model using petri net and searched the optimization resolve with the constraints of hardware area and software running time. The petri net provides modeling capability for multiple processors and inter-processor communication primitives. The algorithm, which adopts a heuristic approach to system partitioning (it considers moving nodes at the basic block level), is based on selecting blocks based on their potential speedup and extra hardware requirements, using hardware and software execution time estimators. Different partitioning algorithms are given which illustrate the benefits of the approach presented in this paper.
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.
