曲彤洲,
解放军信息工程大学 ??郑州 ??450001
详细信息
作者简介:戴紫彬：男，1966年生，教授，博士生导师，研究方向为可重构计算与安全专用芯片设计
曲彤洲：男，1994年生，硕士生，研究方向为可重构计算与信息安全
通讯作者:曲彤洲 qutongzhou@outlook.com
中图分类号:TP309.7; TN492计量
文章访问数:1199
HTML全文浏览量:456
PDF下载量:36
被引次数:0
出版历程
收稿日期:2018-08-24
修回日期:2019-02-02
网络出版日期:2019-02-26
刊出日期:2019-06-01
Task Scheduling Technology for Coarse-grained Dynamic Reconfigurable System Based on Configuration Prefetching and Reuse
Zibin DAI,Tongzhou QU,
The PLA Information Engineering University, Zhengzhou 450001, China
摘要
摘要:配置时间过长是制约可重构系统整体性能提升的重要因素，而合理的任务调度技术可有效降低系统配置时间。该文针对粗粒度动态可重构系统(CGDRS)和具有数据依赖关系的流应用，提出了一种3维任务调度模型。首先基于该模型，设计了一种基于预配置策略的任务调度算法(CPSA)；然后根据任务间的配置重用性，提出了间隔配置重用与连续配置重用策略，并据此对CPSA算法进行改进。实验结果证明，CPSA算法能够有效解决调度死锁问题、降低流应用执行时间并提高调度成功率。与其它调度算法相比，对流应用执行时间的平均优化比例达到6.13%～19.53%。
关键词:粗粒度动态可重构系统/
流应用/
预配置/
配置重用
Abstract:Long configuration time is a significant factor which restricts the performance improvement of the reconfigurable system, and a reasonable task scheduling technology can effectively reduce the system configuration time. A three-dimensional task scheduling model for Coarse-Grain Dynamic Reconfigurable System (CGDRS) and flow applications with data dependencies is proposed. Firstly, based on this model, a Configuration Prefetching Schedule Algorithm (CPSA) applying pre-configured strategy is designed. Then, the interval and continuous configuration reuse strategy are proposed according to the configuration reusability between tasks, and the CPSA algorithm is improved accordingly. The experimental results show this algorithm can avoid scheduling deadlock, reduce the execution time of flow applications and improve scheduling success rate. The optimization ratio of total execution time of flow applications achieves 6.13%～19.53% averagely compared with other scheduling algorithms.
Key words:Coarse-Grain Dynamic Reconfigurable System (CGDRS)/
Flow applications/
Pre-configured/
Configuration reuse
PDF全文下载地址:
https://jeit.ac.cn/article/exportPdf?id=0f179385-700f-4a51-83c2-a4a52992e6ae
