Abstract
The limited I/O bandwidth in reconfigurable devices results in a prohibitively high reconfiguration overhead for dynamically reconfigured FPGA-based platforms. Thus, the full potential of dynamic reconfiguration can not be exploited. Usually, any attainable speed-up by executing an application on hardware is diminished by the reconfiguration overhead. The self-reconfiguration concept aims at drastically reducing the reconfiguration overhead by performing dynamic reconfiguration on-chip without the intervention of an external host. Thus, using self-reconfiguration, a configurable device can alter its functionality autonomously. Implementations based on self-reconfiguration promise significant speed-up compared with conventional approaches [7,8].
This research was performed as part of the MAARCII project. This work is supported in part by the DARPA Adaptive Computing Systems program under contract no. DABT63-99-1-0004 monitored by Fort Huachuca and in part by the National Science Foundation under grant no. CCR-9900613.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Babb, M. Frank, and A. Agarwal. Solving graph problems with dynamic computation structures. In SPIE’96: High-Speed Computing, Digital Signal Processing, and Filtering using Reconfigurable Logic, 1996.
T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. The MIT Press, 1993.
A. Dandalis, A. Mei, and V. K. Prasanna. Domain specific mapping for solving graph problems on reconfigurable devices. In sixth IEEE Reconfigurable Architectures Workshop, April 1999.
A. Donlin. Self modifying circuitry — a platform for tractable virtual circuitry. In Eighth International Workshop on Field Programmable Logic and Applications, 1998.
P. C. French and R. W. Taylor. A self-reconfiguring processor. In Proceedings of IEEE Workshop on FPGAs for Custom Computing Machines, pages 50–59, April 1993.
J.R. Koza, F.H. BennettIII, and J.L. Hutchings. Evolving sorting networls using genetic programming and the rapidly reconfigurable xilinx 6216 field-programmable gate array. In FPGA’98 Sixth International Symposium on Field Programmable Gate Arrays, February 1998.
R. P. S. Sidhu, A. Mei, and V. K. Prasanna. Genetic programming with self-reconfigurable fpgas. In International Workshop on Field Programming Logic and Applications, August 1998.
R. P. S. Sidhu, A. Mei, and V. K. Prasanna. String matching on multicontext fpgas using self-reconfiguration. In ACM/SIGDA International Symposium on Field Programmable Gate Arrays, pages 217–226, Monterey, CA, February 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wadhwa, S., Dandalis, A. (2000). Efficient Self-Reconfigurable Implementations Using On-chip Memory. In: Hartenstein, R.W., Grünbacher, H. (eds) Field-Programmable Logic and Applications: The Roadmap to Reconfigurable Computing. FPL 2000. Lecture Notes in Computer Science, vol 1896. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44614-1_47
Download citation
DOI: https://doi.org/10.1007/3-540-44614-1_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67899-1
Online ISBN: 978-3-540-44614-9
eBook Packages: Springer Book Archive