By Topic

3-D floorplanning: simulated annealing and greedy placement methods for reconfigurable computing systems

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)
Bazargan, K. ; Dept. of Electr. & Comput. Eng., Northwestern Univ., Evanston, IL, USA ; Kastner, R. ; Sarrafzadeh, M.

Advances in programmable hardware have led to new architectures where the hardware can be dynamically adapted to the application to gain better performance. There are still many challenging problems to be solved before any practical general-purpose reconfigurable system is built. One fundamental problem is the placement of the modules on the reconfigurable functional unit (RFU). In reconfigurable systems, we are interested both in online placement, where the arrival time of tasks is determined at run time and is not known a priori, and in offline placement, in which the schedule is known at compile time. In the case of offline placement, we are willing to spend more time during compile time to find a compact floorplan for the RFU modules and utilize the RFU area more efficiently. In this paper, we present offline placement algorithms based on simulated annealing and greedy methods, and show the superiority of their placements over the ones generated by an online algorithm

Published in:

Rapid System Prototyping, 1999. IEEE International Workshop on

Date of Conference:

Jul 1999