首页 | 官方网站   微博 | 高级检索  
     

概率构造算法与遗传算法融合的可重构计算系统硬件任务划分
引用本文:陈伟男,周博,彭澄廉.概率构造算法与遗传算法融合的可重构计算系统硬件任务划分[J].计算机辅助设计与图形学学报,2007,19(8):960-965.
作者姓名:陈伟男  周博  彭澄廉
作者单位:1. 复旦大学计算机与信息技术系,上海,200433
2. Department of Computer Science & Engineering, University of Notre Dame, South Bend, IN 46617 USA
摘    要:提出一种概率构造算法与遗传算法融合的算法,通过引入表示划分结果多样性的度量方法,利用概率构造算法产生具有多样性的较优的初始群体,并在此基础上利用遗传算法寻求最优解.实验结果表明,该算法能够获得比已有的基于列表的划分算法更优的划分结果,比采用完全随机初始群体的遗传算法缩短了运行时间.

关 键 词:可重构计算系统  有向无环图  图划分  任务簇  概率  构造算法  遗传算法  算法融合  可重构计算  系统硬件  任务划分  Genetic  Algorithm  Probabilistic  Systems  Reconfigurable  Computing  Partitioning  Task  运行时间  随机  完全  划分算法  实验  最优解  群体
收稿时间:2006-11-20
修稿时间:2007-02-14

Hardware Task Partitioning for Reconfigurable Computing Systems Syncretized Probabilistic Constructive Algorithm and Genetic Algorithm
Chen Weinan,Zhou Bo,Peng Chenglian.Hardware Task Partitioning for Reconfigurable Computing Systems Syncretized Probabilistic Constructive Algorithm and Genetic Algorithm[J].Journal of Computer-Aided Design & Computer Graphics,2007,19(8):960-965.
Authors:Chen Weinan  Zhou Bo  Peng Chenglian
Abstract:A partitioning algorithm is proposed to partition an entire hardware task into interconnected subtasks for reconfigurable computing. The algorithm, called PCGA, syncretizes probabilistic constructive (PC) algorithm and genetic algorithm (GA). A new approach is proposed to measure the variety of partitions, and an initial population with a variety of better individuals is produced by PC algorithm. Then, the optimal solution is captured by GA based on this initial population.The experimental results show that PCGA can get better results of graph partitioning than those list-based partitioning algorithms, and use less runtime than those genetic algorithms based on a population of randomly generated individuals.
Keywords:reconfigurable computing system  directed acyclic graph  graph partitioning  task cluster
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号