检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:马天义[1] 刘宏伟[1] 温东新[1] 杨孝宗[1]
机构地区:[1]哈尔滨工业大学计算机科学与技术学院,哈尔滨150001
出 处:《高技术通讯》2007年第10期991-996,共6页Chinese High Technology Letters
基 金:国家自然科学基金(60503015)和863计划(2006AA01A103)资助项目.
摘 要:提出了解决多处理器SoC的低功耗软硬件划分问题的方法——基于神经网络的禁忌搜索算法。其基本思想是:真实的生物神经元具有抑制重复激活的阻尼特性,这与禁忌搜索对重复搜索加以限制相类似,因此设计具有阻尼特性的神经网络实现禁忌搜索算法,受阻尼特性抑制的神经元对应禁忌活动。由于神经网络复杂的动态特性和禁忌搜索优秀的全局搜索能力,该算法能够有效地跳出局部最优解。对真实任务图的实验表明,与遗传算法相比,该算法不但具有搜索速度上的优势,而且所得到的绝大部分软硬件划分方案有更低的系统功耗。An algorithm based on tabu search on a neural network was put forward to solve the low power hardware/software partitioning problem in design of system on chip (SoC) architectures consisting of several types of processors. The basic idea of it is: the refractory effect of inhibiting the repetitive firings is one of the characteristics of real biological neurons, which is similar to the tabu effect of tabu search, so tabu search can be realized by a neural network in which neurons inhibited by the refractory effect correspond to the tabu moves. With the complex dynamics of neural networks and excellent global search capacity of tabu search, the algorithm can effectively avoid trapping in undesirable local minima. The experiments for real task graphs show that the algorithm has better time performance than the genetic algorithm, and most of hardware/software partitioning solutions gotten from the algorithm possess the lower power consumption.
关 键 词:多处理器SoC 系统级设计 软硬件划分 神经网络 禁忌搜索 低功耗
分 类 号:TP302[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:13.58.3.158