计算机科学 ›› 2010, Vol. 37 ›› Issue (10): 283-286.

• 体系结构 • 上一篇    下一篇

一种面向部分可重构FPGA的混合实时调度算法

殷进勇,顾国昌,吴艳霞   

  1. (哈尔滨工程大学计算机科学与技术学院 哈尔滨150001)
  • 出版日期:2018-12-01 发布日期:2018-12-01
  • 基金资助:
    本文受Intel异构多核可重构计算体系结构研究基金项目资助。

Hybrid Real-time Scheduling Algorithm Based on Partial Reconfigurable FPGA

YIN Jin-yong,GU Guo-chang,WU Yan-xia   

  • Online:2018-12-01 Published:2018-12-01

摘要: 在CPU/FPGA平台上运行的实时任务通常由软/硬件子任务组成并存在优先约束关系。提出了一种软/硬件混合实时任务调度算法。在截止期限错失时刻,通过分析系统的运行情况,推导出实时任务可调度的充分条件。每个实时任务的硬件子任务分成多组,每组硬件子任务重叠配置到FPGA上。通过手工布局硬件子任务端口和总线端口,使得硬件子任务可动态的连接到系统总线上。实验表明,该算法能够满足任务的实时性,充分利用FPGA资源。

关键词: 实时任务调度,软硬件混合任务,优先约束,CPU/FPGA

Abstract: Real-time task running on CPU/FPGA is usually composed of software/hardware subtasks with precedence constraints. A scheduling algorithm was proposed for software/hardware hybrid real-time tasks. The schedulability sufficient condition for real-time tasks was derived from analyzing what happens when the first deadline is missed. Hardware subtasks of each task were partitioned into several groups and subtasks within the same group were configured on PFGA overlapped. Hardware subtasks can be connected to the system bus dynamically by placing and routing ports of hardware subtasks and system bus manually. The experimental results demonstrate that the scheduling algorithm can meet real-time tasks' deadlines and make full use of FPGA.

Key words: Real-time tasks scheduling, Software/hardware hybrid tasks, Precedence constraints, CPU/FPGA

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!