Task Schedule and Task Duplicate Method Based on Reconfigurable Multi-FPGAs
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Task scheduling is an extremely important research direction in the reconfigurable multi-FPGAs systems. Referencing to the scheduling algorithm in homogeneous and heterogeneous computing, combining its own characteristics of the reconfigurable multi-FPGA computing model, and based on the existing scheduling algorithm, task duplication method is introduced in this paper. If the parent and son nodes on the longest path of the excess task graph are not on the same FPGA, through looking for the Duplicate Space on the FPGA,the proposed algorithm will duplicate the parent node onto the FPGA where the child node is, reducing the cost of communication between tasks. The experimental results show that for a directed acyclic graph of the task scheduling, the makespan of the proposed method is superior to or equal to the performance lower bound of the previous methods, moreover, the utilization of FPGA has been increased.

    Reference
    Related
    Cited by
Get Citation

郭向金,尤志强.一种基于可重构多FPGA 的任务调度与任务复制方法.计算机系统应用,2011,20(11):91-94,117

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:March 21,2011
  • Revised:April 30,2011
  • Adopted:
  • Online:
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063