Computer Science – Data Structures and Algorithms
Scientific paper
2010-12-24
Computer Science
Data Structures and Algorithms
18 pages, 13 figures, an earlier version appeared in the proceedings of the FPL 08
Scientific paper
We propose a new method for defragmenting the module layout of a reconfigurable device, enabled by a novel approach for dealing with communication needs between relocated modules and with inhomogeneities found in commonly used FPGAs. Our method is based on dynamic relocation of module positions during runtime, with only very little reconfiguration overhead; the objective is to maximize the length of contiguous free space that is available for new modules. We describe a number of algorithmic aspects of good defragmentation, and present an optimization method based on tabu search. Experimental results indicate that we can improve the quality of module layout by roughly 50 % over static layout. Among other benefits, this improvement avoids unnecessary rejections of modules
Angermeier Josef
der Veen Jan C. van
Fekete Sandor
Kamphans Tom
Koch Dirk
No associations
LandOfFree
No-Break Dynamic Defragmentation of Reconfigurable Devices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with No-Break Dynamic Defragmentation of Reconfigurable Devices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and No-Break Dynamic Defragmentation of Reconfigurable Devices will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-642581