.png){kind=icon}
.png){kind=icon}
Return
Efficient Hardware/Software Partitioning Based on a Hybrid Algorithm
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2018.2873636.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Complex embedded systems with multi-processing units are important platforms for running complex tasks. In the development of complex embedded systems, hardware/software partitioning plays an important role. In practical application, there are many dynamic tasks which require the hardware/software partitioning to be done in real time. It is necessary to design efficient algorithms to do this. In this paper, the shuffled frog leaping algorithm (SFLA) and the greedy algorithm (GRA) are used to generate a hybrid algorithm named SFLA-GRA. On the basis of the SFLA, the SFLA-GRA uses the greedy idea to terminate invalid iterations and adjust the search step size. By these greedy strategies, the algorithm can be effectively accelerated. Experimental results show that compared with the other swarm intelligence (SI) algorithms, the efficiency of the proposed algorithm has been improved.
Keywords:
Efficient hardware/software partitioning
shuffled frog leaping algorithm
greedy algorithm
hybrid algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.