朱向华, 朱智林. 高效关键路径粒子群的软硬件划分算法[J]. 微电子学与计算机, 2013, 30(4): 160-163,168.
引用本文: 朱向华, 朱智林. 高效关键路径粒子群的软硬件划分算法[J]. 微电子学与计算机, 2013, 30(4): 160-163,168.
ZHU Xiang-hua, ZHU Zhi-lin. Critical Path and Efficient Particle Swarm Algorithm for Hardware/Software Partitioning[J]. Microelectronics & Computer, 2013, 30(4): 160-163,168.
Citation: ZHU Xiang-hua, ZHU Zhi-lin. Critical Path and Efficient Particle Swarm Algorithm for Hardware/Software Partitioning[J]. Microelectronics & Computer, 2013, 30(4): 160-163,168.

高效关键路径粒子群的软硬件划分算法

Critical Path and Efficient Particle Swarm Algorithm for Hardware/Software Partitioning

  • 摘要: 软硬件划分是在满足系统约束条件下,将系统中部分功能模块由硬件实现,部分功能模块由软件实现,使系统整体性能达到最优.本文采用有向无环图对划分问题建模,提出采用关键路径调度、自适应性的高效粒子群软硬件划分算法.实验结果表明,采用本文算法,所得结果明显优于采用先来先服务的调度方法.

     

    Abstract: Hardware/Software partitioning is the problem of which functional modules of system are implemented on hardware and which ones on software to make the system achieve optimal performance under system constraints.In this paper,a directed acyclic graph on the division of modeling,we proposed critical path scheduling,adaptive and efficient particle swarm algorithm for hardware/software partitioning.Experimental results show that the algorithms proposed in the paper can produce better solution than first-come first-served scheduling.

     

/

返回文章
返回