ABSTRACT
One of the major overheads for reconfigurable computing is the time it takes to reconfigure the devices in the system. This overhead limits the speedup possible in this paradigm. In this paper we explore configuration prefetching techniques for reducing this overhead. By overlapping the configuration loadings with the computation on the host processor the reconfiguration overhead can be reduced. Our prefetching techniques target to the reconfigurable systems containing a Partial Reconfigurable FPGA with Relocation + Defragmentation (R+D model) since the R+D FPGA showed high hardware utilization. We have investigated various techniques including static configuration prefetching, dynamic configuration pre-fetching, and hybrid prefetching. We have developed prefetching algorithms that significantly reduce the reconfiguration overhead.
- Babb97.J. Babb, M. Frank, V. Lee, E. Waingold, R. Barua, M. Taylor, J. Kim, S. Devabhaktuni, A. Agarwal, "The RAW Benchmark Suite: Computation Structures for General Purpose Computing", IEEE Symposium on FPGAs for Custom Computing Machines, pp. 134- 143, 1997. Google ScholarDigital Library
- Bolotski94.M. Bolotski, A. DeHon, T. F. Knight Jr., "Unifying FPGAs and SIMD Arrays", 2nd International ACM/SIGDA Workshop on Field-Programmable Gate Arrays, 1994.Google Scholar
- Callahan91.D. Callahan, K. Kennedy, A. Porterfield, "Software Prefetching", International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 40-52, 1991. Google ScholarDigital Library
- Cmelik93.R. F. Cmelik, Introduction to Shade, Sun Microsystems Laboratories, Inc., February, 1993.Google Scholar
- Compton00.K. Compton, J. Cooley, S. Knol, S. Hauck, "Abstract: Configuration Relocation and Defragmentation for FPGAs", IEEE Symposium on Field-Programmable Custom Computing Machines, 2000. Google ScholarDigital Library
- Dandalis01.Andreas Dandalis, Viktor Prasanna, "Configuration Compression for FPGA- based Embedded Systems", ACM/SIGDA International Symposium on Field- Programmable Gate Arrays. Google ScholarDigital Library
- Hauck97.S. Hauck, T. W. Fry, M. M. Hosler, J. P. Kao, "The Chimaera Reconfigurable Functional Unit", IEEE Symposium on FPGAs for Custom Computing Machines, 1997. Google ScholarDigital Library
- Hauck98.S. Hauck, "The Configuration prefetching for the Single Context FPGA", ACM/SIGDA International Symposium on FPGAs, pp65- 74, 1998. Google ScholarDigital Library
- Hauser97.John Hauser, John Wawrzynek, "Garp: A MIPS Processor with a Reconfigurable Coprocessor", IEEE Symposium on FPGAs for Custom Computing Machines, pp. 24-33, 1997 Google ScholarDigital Library
- Joseph97.Doug Joseph, Dirk Grunwald, "Prefetching using Markov Predictors", Proceedings of the 24 th International Symposium on Computer Architecture, pp 252-263, 1997. Google ScholarDigital Library
- Li99.Zhiyuan Li, S. Hauck, "Don't Care Discovery for FPGA Configuration Compression", ACM/SIGDA International Symposium on Field-Programmable Gate Arrays, pp. 91-100, 1999. Google ScholarDigital Library
- Li00.Zhiyuan Li, K. Compton, Scott Hauck, "Configuration Caching Management Techniques for Reconfigurable Computing", IEEE Symposium on FPGAs for Custom Computing Machines, pp. 87-96, 2000 Google ScholarDigital Library
- Li01.Zhiyuan Li, Scott Hauck, "Configuration Compression for Virtex FPGA", IEEE Symposium on FPGAs for Custom Computing Machines, pp 143-154, 2001 Google ScholarDigital Library
- Schmit97.Herman Schmit, "Incremental Reconfiguration for Pipelined Applications", IEEE Symposium on FPGAs for Custom Computing Machines, pp 47-55, 1997. Google ScholarDigital Library
- Spec95.SPEC CPU95 Benchmark Suite, Standard Performance Evaluation Corp., Manassas, VA, 1995.Google Scholar
- Wittig96.R. Wittig, P. Chow, "OneChip: An FPGA Processor with Reconfigurable Logic", IEEE Symposium on FPGAs for Custom Computing Machines, pp126-135, 1996.Google Scholar
- Configuration prefetching techniques for partial reconfigurable coprocessor with relocation and defragmentation
Recommendations
Configuration relocation and defragmentation for run-time reconfigurable computing
Due to its potential to greatly accelerate a wide variety of applications, reconfigurable computing has become a subject of a great deal of research. By mapping the computer-intensive sections of an application to reconfigurable hardware, custom ...
Configuration Relocation and Defragmentation for Reconfigurable Computing
FCCM '00: Proceedings of the 2000 IEEE Symposium on Field-Programmable Custom Computing MachinesCustom computing systems exhibit significant speedups over traditional microprocessors by mapping compute-intensive sections of a program to reconfigurable logic [Hauck98]. However, the high overhead of reconfiguration can limit the execution times ...
Configuration prefetching and reuse for preemptive hardware multitasking on partially reconfigurable FPGAs
DATE '16: Proceedings of the 2016 Conference on Design, Automation & Test in EuropePartially reconfigurable (PR) FPGAs enable preemptive hardware (HW) multitasking using PR regions (PRRs). To enable this multitasking, the HW task's partial bit-stream is downloaded to only the task's PRR, and only that PRR is reconfigured. Since only a ...
Comments