By Topic

Dynamic Critical-Path based on Fit Degree scheduling for reconfigurable multi-FPGAs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yan Xiao ; Inst. of Comput. Theor. & Technol., Xidian Univ., Xi''an ; Zhenhua Duan

Reconfigurable computing is becoming increasingly attractive for many applications. In this paper, an efficient algorithm named dynamic critical-path based on fit degree (DCPFD) is formalized and used to schedule related hardware tasks in terms of task graphs for reconfigurable FPGAs with respect to the constraints: precedence, deadline and resource. The dynamic critical-path (DCP) dynamically evaluates critical-paths of a task graph and determines the most critical task in order to shorten the schedule length. The fit degree (FD) is calculated for the scheduled task w.r.t each FPGA, and used to check which FPGA has enough space and where in it, to place the task. The Pre-fetching technique is also employed to reduce the FPGA configuration overhead.

Published in:

Application of Concurrency to System Design, 2008. ACSD 2008. 8th International Conference on

Date of Conference:

23-27 June 2008