基于改进遗传算法的可重构计算任务划分  

Improved genetic algorithm for hardware/software partition in reconfigurable computing system

作　　者：杨治秋[1] 

机构地区：[1]牡丹江师范学院计算机科学与技术系,黑龙江牡丹江157012

出　　处：《计算机工程与应用》2012年第3期46-48,共3页Computer Engineering and Applications

基　　金：黑龙江省教育厅科研项目(No.11531389)

摘　　要：为实现可重构计算中的软硬件任务自动划分,引入了遗传算法来搜寻最优解。为解决标准遗传算法可能出现种群早熟和种群进化后期收敛速度慢的问题,使用了小生境技术来保护种群中基因的多样性。设计了能够随适应度自动改变的自适应遗传算子(杂交算子和变异算子)。对算法进行了50次随机实验,并对结果进行分析。实验表明,改进后的遗传算法搜寻到全局最优任务划分的概率和搜寻到最优任务划分时的进化代数都要优于标准遗传算法。A genetic algorithm is introduced into the process of automated hardware/software partition in reconfigurable computing.As population may premature or converge too slowly at later process of standard genetic algorithm,niching technique is exploited to protect the diversity of genes.Adaptive genetic algorithm operators（crossover and mutation）are designed to vary according individual＇s fitness.The algorithm is implemented 50 times randomly.As experiment demonstrating,the improved genetic algorithm has higher probability to find out the global best solution than standard genetic algorithm.It also finds out the best partition with smaller generations than standard genetic algorithm.

关 键 词：可重构计算 任务划分 遗传算法 小生境技术 

分 类 号：TP316[自动化与计算机技术—计算机软件与理论]