Techniques for synthesizing binaries to an advanced register/memory structure
Authors:
Open Access
- 20 February 2005
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 118-124
Abstract
Recent works demonstrate several benefits of synthesizing software binaries onto FPGA hardware, including incorporating hardware design into established software tool flows with minimal impact, porting existing binaries to FPGAs, and even dynamically synthesizing software kernels to faster FPGA coprocessors. Those works showed that standard binary decompilation methods can recover enough high-level control information to result in reasonably-efficient hardware. However, recent synthesis methods for FPGAs utilize advanced memory structures, such as a "smart buffer," that require recovery of additional high-level information, specifically information about loops and arrays. We incorporate decompilation techniques into an existing binary synthesis tool flow to recover loops and arrays in order to take advantage of advanced memory structures when performing synthesis from a binary. We demonstrate through experiments on six benchmarks that our methods improve binary synthesis performance by 53%, by making effective use of smart buffers. Furthermore, we compare the binary results using smart buffers with results of synthesis directly from the original C code for the benchmarks, and show that our methods achieved almost identical performance results with only 10% area overhead.Keywords
This publication has 4 references indexed in Scilit:
- Input data reuse in compiling window operations onto reconfigurable hardware2004
- Dynamic FPGA routing for just-in-time FPGA compilation2004
- Dynamic hardware/software partitioning2003
- Hardware/software partitioning of software binaries2006 IEEE/ACM International Conference on Computer Aided Design, 2002