刘露,
李伟,,
南龙梅
解放军信息工程大学 ??郑州 ??450001
基金项目:国家自然科学基金(61404175)
详细信息
作者简介:徐金甫：男，1965年生，教授，硕士生导师，研究方向为专用集成电路设计
刘露：男，1992年生，硕士，研究方向为专用集成电路设计
李伟：男，1983年生，副教授，硕士生导师，研究方向为安全专用芯片设计
南龙梅：女，1981年生，讲师，研究方向为安全专用芯片设计
通讯作者:李伟 liulu13213238773@163.com
中图分类号:TP316.4计量
文章访问数:911
HTML全文浏览量:327
PDF下载量:20
被引次数:0
出版历程
收稿日期:2017-12-21
修回日期:2018-05-18
网络出版日期:2018-06-06
刊出日期:2018-08-01
Reconfigurable Hardware Task Scheduling Algorithm Based on 3D Fragmentation Layout Strategy
Jinfu XU,Lu LIU,
Wei LI,,
Longmei NAN
The PLA Information Engineering University, Zhengzhou 450001, China
Funds:The National Natural Science Foundation of China (61404175)
摘要
摘要:现有硬件任务调度算法任务描述不完善且忽视时间维上紧凑性。该文考虑任务下载时间、完善任务属性，以器件2维资源与时间建立3维资源模型，将任务布局问题抽象成特殊的3维空间放置问题，在此模型上分析出现有算法不能克服任务不可预知性和资源占用多变性，导致调度成功率和资源利用率低。针对此问题，该文提出了一种3维可重构任务调度算法3D_RTSA。设计并实现了基于任务紧迫度的调度策略和基于3D碎裂度的布局策略。与其他4种算法实验对比结果表明，在重负载、小任务C30情况下，3D_RTSA调度成功率比GC, Look-aheadest, SPSA, DTI算法分别高3%, 21%, 28%, 35%左右；在轻负载、大任务C50情况下，资源利用率比Look-aheadest, SPSA算法分别高5%, 18%左右，且该文算法时间复杂度并未增加。
关键词:3维资源模型/
任务紧迫度/
3D碎裂度/
调度成功率/
资源利用率
Abstract:The existing hardware task scheduling algorithms describe task imperfectly and ignore the compactness of time dimension. The task downloading time is considered for improving the task attribute, and the 3D-resource model with the two dimensional resource of device and time is established, in order to abstract the issue of task layout into a special three-dimensional space placement issue. With this model, it is concluded that the existing algorithms can not overcome the unpredictability of the task and the diversity of resource occupancy, leading low scheduling success rate and resource utilization rate. To solve the problem, a three dimensional reconfigurable task scheduling algorithm called 3D_RTSA is proposed. A scheduling strategy based on task urgency and a layout strategy based on 3D fragmentation are designed and implemented. Compared with the other 4 algorithms, the results show that the scheduling success rate of 3D_RTSA is 3%, 21%, 28%, 35% higher than that of GC, Look-aheadest, SPSA and DTI algorithms under the condition of heavy load and small task C30, and the utilization ratio of resources is 5% and 18% higher than that of Look-aheadest and SPSA algorithm under the condition of light load and large task C50. Besides, the time complexity of the algorithm is not increased.
Key words:3D-resource model/
Task urgency/
3D fragmentation/
Scheduling success rate/
Resource utilization
PDF全文下载地址:
https://jeit.ac.cn/article/exportPdf?id=da196b3d-70d0-4601-a239-744b801e4068
