Abstract
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 the static layout. Among other benefits, this improvement avoids unnecessary rejections of modules.
- Becker, T., Luk, W., and Cheung, P. Y. 2007. Enhancing relocatability of partial bitstreams for run-time reconfiguration. In Proceedings of the 15th Annual Symposium on Field Programmable Custom Computing Machines. 35--44. Google Scholar
Digital Library
- Behnen, K. and Neuhaus, G. 1995. Grundkurs Stochastik 3rd Ed. B. G. Teubner-Verlag.Google Scholar
- Bender, M. A., Demaine, E. D., and Farach-Colton, M. 2005a. Cache-Oblivious B-trees. SIAM J. Comput. 35, 341--358. Google Scholar
Digital Library
- Bender, M. A., Fineman, J. T., Gilbert, S., and Kuszmaul, B. C. 2005b. Concurrent cache-oblivious B-trees. In Proceedings of the 17th Annual ACM Symposium on Parallel Algorithm Architecture. 228--237. Google Scholar
Digital Library
- Bromley, G. 1980. Memory fragmentation in buddy methods for dynamic storage allocation. Acta Inf. 14, 107--117.Google Scholar
Digital Library
- Compton, K., Li, Z., Cooley, J., Knol, S., and Hauck, S. 2002. Configuration relocation and defragmentation for run-time reconfigurable systems. IEEE Trans. VLSI 10, 209--220. Google Scholar
Digital Library
- Fekete, S. P., Kamphans, T., Schweer, N., Tessars, C., van der Veen, J. C., Angermeier, J., Koch, D., and Teich, J. 2008. No-Break dynamic defragmentation of reconfigurable devices. In Proceedings of the International Conference on Field Programmable Logic and Applications. 113--118.Google Scholar
- Garey, M. R. and Johnson, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman. Google Scholar
Digital Library
- Gericota, M. G., Alves, G. R., Silva, M. L., and Ferreira, J. M. 2005. Run-Time defragmentation for dynamically reconfigurable hardware. In New Algorithms, Architectures and Applications for Reconfigurable Computing.Google Scholar
- Hinds, J. A. 1975. An algorithm for locating adjacent storage blocks in the buddy system. Comm. ACM 18, 221--222. Google Scholar
Digital Library
- Hirschberg, D. S. 1973. A class of dynamic memory allocation algorithms. Comm. ACM 16, 615--618. Google Scholar
Digital Library
- Knowlton, K. C. 1965. A fast storage allocator. Comm. ACM 8, 623--625. Google Scholar
Digital Library
- Knuth, D. E. 1997. The Art of Computer Programming: Fundamental Algorithms 3rd Ed. Vol. 1. Addison-Wesley, Reading, MA. Google Scholar
Digital Library
- Koch, D., Ahmadinia, A., Bobda, C., and Kalte, H. 2004. FPGA architecture extensions for preemptive multitasking and hardware defragmentation. In Proceedings of the IEEE International Conference on Field Programmable Technology. 433--436.Google Scholar
- Koch, D., Haubelt, C., and Teich, J. 2007. Efficient hardware checkpointing: Concepts, overhead analysis, and implementation. In Proceedings of the 15th ACM/SIGDA International Symposium on Field Programmable Gate Arrays. ACM Press, New York, 188--196. Google Scholar
Digital Library
- Koch, D., Beckhoff, C., and Teich, J. 2008a. ReCoBusBuilder: A novel tool and technique to build static and dynamically reconfigurable systems for fpgas. In Proceedings of the 18th International Conference on Field Programmable Logic and Applications. 119--124.Google Scholar
- Koch, D., Haubelt, C., and Teich, J. 2008b. Efficient reconfigurable on-chip buses for fpgas. In Proceedings of the 16th Annual IEEE Symposium on Field Programmable Custom Computing Machines. Google Scholar
Digital Library
- Koester, M., Kalte, H., Porrmann, M., and Ruckert, U. 2007. Defragmentation algorithms for partially reconfigurable hardware. Int. Fed. Inf. Proc. Publ. 240, 41.Google Scholar
- Kuon, I. and Rose, J. 2007. Measuring the gap between fpgas and asics. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 26, 203--215. Google Scholar
Digital Library
- Lysaght, P., Blodget, B., Mason, J., Young, J., and Bridgford, B. 2006. Invited paper: Enhanced architecture, design methodologies and CAD tools for dynamic reconfiguration of Xilinx fpgas. In Proceedings of the 16th International Conference on Field Programmable Logic and Applications. 1--6.Google Scholar
- Shen, K. K. and Peterson, J. L. 1974. A weighted buddy method for dynamic storage allocation. Comm. ACM 17, 558--562. Google Scholar
Digital Library
- Wilson, P. R., Johnstone, M. S., Neely, M., and Boles, D. 1995. Dynamic storage allocation: A survey and critical review. In Proceedings of the International Workshop on Memory Management, H. Baker Ed. Lecture Notes in Computer Science, vol. 986. Springer. Google Scholar
Digital Library
Index Terms
Dynamic Defragmentation of Reconfigurable Devices
Recommendations
Pipeline Reconfigurable DSP for Dynamically Reconfigurable Architectures
Dynamically reconfigurable architectures, such as NATURE, achieve high logic density and low reconfiguration latency compared to traditional field-programmable gate arrays. Unlike fine-grained NATURE, reconfigurable DSP block incorporated NATURE ...
A 16-context Optically Reconfigurable Gate Array
ASAP '09: Proceedings of the 2009 20th IEEE International Conference on Application-specific Systems, Architectures and ProcessorsDemand for fast dynamic reconfiguration has increased since dynamic reconfiguration can accelerate the performance of processors. Dynamic reconfiguration has two important prerequisites: fast reconfiguration and numerous reconfiguration contexts. ...
A Reconfigurable Processor Architecture Combining Multi-core and Reconfigurable Processing Unit
CIT '10: Proceedings of the 2010 10th IEEE International Conference on Computer and Information TechnologyIt’s a promising way to improve performance significantly by adding reconfigurable processing unit to a general purpose processor. In this paper, a Reconfigurable Multi-Core (RMC) architecture combining general multi-core and reconfigurable logic is ...






Comments