高级检索
李德华, 汪斌强, 黄万伟. 面向异质结构的可重构任务在线布局算法[J]. 计算机辅助设计与图形学学报, 2010, 22(10): 1679-1686.
引用本文: 李德华, 汪斌强, 黄万伟. 面向异质结构的可重构任务在线布局算法[J]. 计算机辅助设计与图形学学报, 2010, 22(10): 1679-1686.
Li Dehua, Wang Binqiang, Huang Wanwei. Online Task Placement Algorithm for Heterogeneous Reconfigurable Architectures[J]. Journal of Computer-Aided Design & Computer Graphics, 2010, 22(10): 1679-1686.
Citation: Li Dehua, Wang Binqiang, Huang Wanwei. Online Task Placement Algorithm for Heterogeneous Reconfigurable Architectures[J]. Journal of Computer-Aided Design & Computer Graphics, 2010, 22(10): 1679-1686.

面向异质结构的可重构任务在线布局算法

Online Task Placement Algorithm for Heterogeneous Reconfigurable Architectures

  • 摘要: 基于同质结构模型的可重构任务布局算法和内部资源多样的可重构器件不相适应,不利于实际运用.针对BlockRAM等静态单元在器件上的分布对硬件任务存在位置约束的问题,建立了异质结构的器件和硬件任务模型,并提出一种基于相对任务覆盖度的在线布局算法.通过为布局任务等待队列设立滑动窗口,根据窗内任务集合对器件空闲单元的相对任务覆盖度选择当前任务的放置位置,兼顾后续任务的布局需求,从而提高了整体布局效率.实验结果表明,该算法能取得较低的任务平均等待时间和较高的器件利用率,优于First Fit算法.

     

    Abstract: Current task placement algorithms for homogenous architectures are inapplicable to the reconfigurable device with multifarious resources, which are not conducive to the practical application.Models of device and hardware tasks with heterogeneous architecture are built to deal with constraints on the location of hardware tasks, which are caused by static cells such as BlockRAMs distributed on the reconfigurable device.This paper proposes an online task placement algorithm based on relative task coverage.The algorithm establishes a placement window for task queue, and places the foremost task according to the relative task coverage generated by all tasks in the placement window.Therefore, the placement of subsequent tasks is taken into consideration and the whole efficiency of placement is increased.The experimental results show the algorithm can gain less average waiting time for tasks and higher utilization ratio of device than those of First Fit algorithm.

     

/

返回文章
返回