首页 | 本学科首页   官方微博 | 高级检索  
     

可重构系统中的实时任务在线调度与放置算法
引用本文:周学功,梁樑,黄勋章,彭澄廉.可重构系统中的实时任务在线调度与放置算法[J].计算机学报,2007,30(11):1901-1909.
作者姓名:周学功  梁樑  黄勋章  彭澄廉
作者单位:复旦大学计算机与信息技术系,上海,200433
摘    要:有效的任务调度与放置是发挥可重构计算性能优势的重要因素.针对实时任务在二维可重构器件上的在线调度问题,定义了调度算法完全识别的概念,即算法不会拒绝能够成功调度的任务.提出了新的实时在线调度与放置算法,充分利用了任务的时间信息,实现了完全识别的调度.实验表明,与已有的算法相比,新算法显著地改善了调度效果,而运行开销没有明显增加.

关 键 词:可重构计算  在线调度  实时  放置策略  完全识别  可重构系统  实时任务  在线调度  放置算法  System  Reconfigurable  Computing  Tasks  Placement  运行  效果  改善  实验  时间信息  利用  识别  完全  调度算法  调度问题  可重构器件  因素
修稿时间:2006-08-08

On-Line Scheduling and Placement of Real-Time Tasks for Reconfigurable Computing System
ZHOU Xue-Gong,LIANG Liang,HUANG Xun-Zhang,PENG Cheng-Lian.On-Line Scheduling and Placement of Real-Time Tasks for Reconfigurable Computing System[J].Chinese Journal of Computers,2007,30(11):1901-1909.
Authors:ZHOU Xue-Gong  LIANG Liang  HUANG Xun-Zhang  PENG Cheng-Lian
Affiliation:Department of Computing and Information Technology, Fudan University, Shanghai 200433
Abstract:Efficient task scheduling and placement are very important for obtaining high performance in reconfigurable computing system.This paper focuses on the on-line scheduling of real-time tasks on a 2-dimensional reconfigurable device,and introduces the notion of recognition-complete for scheduling algorithms,that is the algorithm do not reject a task when a feasible schedule for this task exists.A new on-line scheduling and placement algorithm is proposed.By utilizing the temporal information of real-time tasks thoroughly,the proposed algorithm achieves recognition-complete.The simulation results show that the proposed algorithm gains a prominent improvement in scheduling performance over previous algorithms,while the run-time efficiency is preserved.
Keywords:reconfigurable computing  on-line scheduling  real-time  placement scheme  recognition-complete
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号