A CRCLA task partition algorithm based on ant colony algorithm

Third International Symposium on Computer Engineering and Intelligent Communications (ISCEIC 2022)(2023)

引用 0|浏览7
暂无评分
摘要
In order to find the optimal solution of task partitioning for data flow graph of cryptography algorithm based on reconfigurable logical array, a task partition algorithm ACP based on ant colony algorithm is proposed. The algorithm first improves the cluster partition algorithm according to the hardware structure of reconfigurable array. On the basis of the ant colony algorithm, many ants in the ant colony algorithm are used to traverse the nodes in the data flow graph, and the number of divided blocks and the cost of inter-cluster communication are used as cost functions to continuously optimize the initialized pheromone concentration matrix and improve the algorithm. The experimental results show that the algorithm has the ability to obtain the optimal solution more quickly and stably than the CBP algorithm and the LSCBP algorithm.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要