static scheduling of periodic hardware tasks with precedence and deadline constraints on reconfigurable hardware devices静态调度周期硬件任务的优先级和期限限制可重构硬件设备.pdfVIP

Hindawi Publishing Corporation International Journal of Reconfigurable Computing Volume 2011, Article ID 591983, 28 pages doi:10.1155/2011/591983 Research Article Static Scheduling of Periodic Hardware Tasks with Precedence and Deadline Constraints on Reconfigurable Hardware Devices Ikbel Belaid,1 Fabrice Muller,1 and Maher Benjemaa2 1 LEAT-CNRS, University of Nice Sophia Antipolis, 06560 Valbonne, France 2 Research Unit ReDCAD, National Engineering School of Sfax, University of Sfax, 3038 Sfax, Tunisia Correspondence should be addressed to Ikbel Belaid, ikbel.belaid@unice.fr Received 27 August 2010; Revised 12 January 2011; Accepted 10 February 2011 ¨ Academic Editor: Michael Hubner Copyright © 2011 Ikbel Belaid et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Task graph scheduling for reconfigurable hardware devices can be defined as finding a schedule for a set of periodic tasks with precedence, dependence, and deadline constraints as well as their optimal allocations on the available heterogeneous hardware resources. This paper proposes a new methodology comprising three main stages. Using these three main stages, dynamic partial reconfiguration and mixed integer programming, pipelined scheduling and efficient placement are achieved and enable parallel computing of the task graph on the reconfigurable devices by optimizing placement/scheduling quality. Experiments on an application of heterogeneous hardware tasks demonstrate an improvement of resource utilization of 12.45% of the available reconfigurable resources corresponding to a resource gain of 17.3%