Volume 9 Number 11 (Nov. 2014)
Home > Archive > 2014 > Volume 9 Number 11 (Nov. 2014) >
JCP 2014 Vol.9(11): 2552-2558 ISSN: 1796-203X
doi: 10.4304/jcp.9.11.2552-2558

A Communication-aware Scheduling Algorithm for Hardware Task Scheduling Model on FPGA-based Reconfigurable Systems

Yingying Sheng, Yan Liu, Renfa Li, and Xiongren Xiao
College of Information Science and Engineering, Hunan University, Changsha, China
Abstract—Task scheduling is an important aspect of high performance reconfigurable computing. Most of the heuristics for this NP-hard problem are based on a simple abstract model of FPGA and have little investigation into optimizing data communication which influences the system performance importantly. To solve this problem, a Communication-aware Maximum Adjacent Edges (CA-MAE) algorithm based on new 2D reconfigurable model is proposed, which could reduce communication distance during scheduling and enhance the system performance. The experimental results show that CA-MAE reduces communication cost by 17%.

Index Terms—Reconfigurable computing, scheduling model, scheduling algorithm, communication time.

[PDF]

Cite: Yingying Sheng, Yan Liu, Renfa Li, and Xiongren Xiao, "A Communication-aware Scheduling Algorithm for Hardware Task Scheduling Model on FPGA-based Reconfigurable Systems," Journal of Computers vol. 9, no. 11, pp. 2552-2558, 2014.

General Information

ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO,  ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat,etc
E-mail: jcp@iap.org
  • Nov 14, 2019 News!

    Vol 14, No 11 has been published with online version   [Click]

  • Mar 20, 2020 News!

    Vol 15, No 2 has been published with online version   [Click]

  • Dec 16, 2019 News!

    Vol 14, No 12 has been published with online version   [Click]

  • Sep 16, 2019 News!

    Vol 14, No 9 has been published with online version   [Click]

  • Aug 16, 2019 News!

    Vol 14, No 8 has been published with online version   [Click]

  • Read more>>