通信学报 ›› 2013, Vol. 34 ›› Issue (2): 40-55.doi: 10.3969/j.issn.1000-436x.2013.02.006

• 学术论文 • 上一篇    下一篇

融合面积估算和多目标优化的硬件任务划分算法

陈乃金1,2,江建慧1   

  1. 1 同济大学 软件学院,上海 201804
    2 安徽工程大学 计算机与信息学院,安徽 芜湖 241000
  • 出版日期:2013-02-25 发布日期:2017-07-17
  • 基金资助:
    国家自然科学基金资助项目;国家高技术研究发展计划(“863”计划)基金资助项目

Hardware-task partitioning algorithm merged area estimation with multi-objective optimization

Nai-jin CHEN1,2,Jian-hui JIANG1   

  1. 1 School of Software Engineering, Tongji University, Shanghai 201804, China
    2 College of Computer and Information Engineering, Anhui Polytechnic University, Wuhu 241000, China
  • Online:2013-02-25 Published:2017-07-17
  • Supported by:
    The National Natural Foundation of China;The National High Technology Research and Development Program of China (863 Program)

摘要:

摘 要:针对可重构计算机系统配置次数(划分块数)的最小化问题,提出了一种融合面积估算和多目标优化的硬件任务划分算法。该算法每次划分均进行硬件资源面积的估算,并且通过充分考虑可重构资源的使用、一个数据流图所有划分块执行延迟总和、划分模块间边数等因素构造了新的探测函数prior_assigned(),该函数能够计算每个就绪节点的优先权值,新算法通过该值能动态调整就绪列表任务节点的调度次序。实验结果表明,与现有的层划分、簇划分、增强静态列表、多目标时域划分、簇层次敏感等5种划分算法相比,该算法能获得最少的模块数,并且随着可重构处理单元面积的增大,除层划分算法之外,其执行延迟的均值也是最小的。

关键词: 可重构计算, 时域划分, 最小化模块数, 资源约束, 探测函数, 多目标优化

Abstract:

In order to minimize the number of configuration (i.e.the number of partitioned modules) issue in reconfigurable computing systems, a hardware-task partitioning algorithm merged area estimation with multi-objective optimization was presented.It could estimate the area of hardware resource in each partitioning.Also, the detection function prior_assigned() was constructed with the guideline of making good use of reconfigurable resources,the execution delay sum of all partitioning modules of a data flow graph, number of edges between modules, etc.The detection function could calculate priority values of nodes.The proposed algorithm could adjust dynamically the schedu ing order of the ready list task-nodes by the priority values.Experimental results show that the proposed algorithm can get less modules than that of level-based partitioning, cluster based partitioning, enhanced static list, multi-objective temporal partitioning and level sensitive cluster based partitioning algorithms, and it can also obtain the least average execution delay with increase of the area of reconfigurable processing unit except level-based partitioning.

Key words: reconfigurable computing, temporal partitioning, minimum number of modules, resource restraint, detection function, multi-objective optimization

No Suggested Reading articles found!