By Topic

Multi-objective Placement of Reconfigurable Hardware Tasks in Real-Time System

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
$33 $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)
Chun-Hsien Lu ; Dept. of Comput. Sci. & Inf. Eng., Nat. Chung Cheng Univ., Chiayi, Taiwan ; Hsiao-Win Liao ; Pao-Ann Hsiung

Hardware task placements in dynamically reconfigurable logic need to satisfy different goals such as high placement efficiency, low fragmentation of the reconfigurable logic, and minimization of routing resources. There have been several placement algorithms proposed for each goal. Nevertheless, the algorithm can only satisfy one goal, which results in poor results in the other goal satisfactions. We propose a novel Multi-Objective Hardware Placement (MOHP) method such that all goals are satisfied and if there are conflicts a good trade off is obtained. MOHP is similar to share-based schedulers that try to adjust resource utilizations among different scheduling methods by varying the processor bandwidth. By applying MOHP to some examples, we find that MOHP approximates the best performance for each assessment criterion.

Published in:

Computational Science and Engineering, 2009. CSE '09. International Conference on  (Volume:2 )

Date of Conference:

29-31 Aug. 2009