Fast on-line real-time scheduling algorithm for reconfigurable computing

CSCWD (2)(2005)

引用 8|浏览3
暂无评分
摘要
Partially reconfigurable devices are able to execute several tasks in parallel and allow for on-line reconfiguration. To manage such devices at runtime, the scheduler in the operating system has two more modules for hardware tasks: placer and loader. Placer is to find appropriate places in reconfigurable devices and loader is to do the reconfiguration for hardware tasks. In order to satisfy the timing constraints in hard real-time systems, we propose a fast online real-time scheduling algorithm. Our algorithm will be based on correct empty resource management and will utilize the reconfiguration reuse. The experiments show that the developed scheduler leads to substantial performance gains.
更多
查看译文
关键词
scheduling,loader,reconfiguration reuse,online reconfiguration,parallel task execution,reconfigurable architectures,hardware task module,fast online real-time scheduling algorithm,empty resource management,operating system scheduler,timing constraints,online scheduler,placer,reconfigurable,reconfigurable device,on-line scheduler,algorithm theory,device management,reconfigurable computing,distributed processing,real-time systems,information technology,real time systems,field programmable gate arrays,embedded system,scheduling algorithm,resource manager,satisfiability,operating systems,operating system,resource management,hardware
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要