Scheduled System Maintenance on December 17th, 2014:
IEEE Xplore will be upgraded between 2:00 and 5:00 PM EST (18:00 - 21:00) UTC. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Optimal static scheduling of real-time dependent tasks on reconfigurable hardware devices

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

3 Author(s)
Belaid, I. ; LEAT-CNRS, Univ. of Nice Sophia-Antipolis, Nice, France ; Muller, F. ; Benjemaa, M.

Reconfigurable hardware devices are increasingly being adopted in the design of emerging complex embedded systems since they offer novel reconfiguration capabilities and a high density of heterogeneous resources conducting to improve the system performance. Key issues of designing such systems are interconnecting, memory management and task placement and scheduling. This paper addresses the problem of placement and scheduling of real-time DAG-structured applications in these emergent reconfigurable hardware devices. This paper presents a scheduling/placement methodology that uses mixed integer programming to establish the optimal static scenario for executing a set of periodic real-time inter-dependent tasks on reconfigurable devices. Experiments are conducted on a DAG composed of heterogeneous hardware tasks to evaluate the placement/scheduling quality. The results demonstrate a resource gain of 27 % achieved by the run-time reconfiguration concept compared to a static design. The configuration overhead is reduced to 1 % of the total running time. Due to pipelined scheduling, the task graph spanning is minimized by 4 % compared to sequential execution of the graph and the waiting time is reduced up to 7 % of the overall running time.

Published in:

Communications, Computing and Control Applications (CCCA), 2011 International Conference on

Date of Conference:

3-5 March 2011