By Topic

An efficient algorithm for online placement in a reconfigurable 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)
Mohammad Esmaeildoust ; Department of Electrical and Computer Engineering, Shahid Beheshti University Tehran, Iran ; Mahmood Fazlali ; Ali Zakerolhosseini

Partially runtime reconfiguration is an efficient method for use in the limited resources in order to increase the performance of the system. In these systems, all the processes use the reconfigurable resources and place their hardware tasks at run time without affecting each other. One of the challenging problems in online task placement is fragmentation of reconfigurable resources. This paper focuses on fragmentation rate of task placement in a reconfigurable system. Several techniques for rectangular tasks are investigated and an algorithm that decreases the fragmentation of a FPGA is presented. The algorithm is able to locate a feasible location with improvement in the fragmentation. The algorithm also produces a lower rejection rate compared to other placement algorithms.

Published in:

Optimization of Electrical and Electronic Equipment, 2008. OPTIM 2008. 11th International Conference on

Date of Conference:

22-24 May 2008