6 October 2000 Fast scheduling and placement methods for C to hardware/software compilation
Author Affiliations +
Advances in the FPGA technology, both in terms of device capacity and architecture, have resulted in introduction of reconfigurable computing machines, where the hardware adapts itself to the running application to gain speedup. To keep up with the ever-growing performance expectations of such systems, designers need new methodologies and tools for developing reconfigurable computing systems (RCS). This paper addresses the need for fast compilation and physical design phase to be used in application development/debugging/testing cycle for RCS. We present a high-level synthesis approach that is integrated with placement, hence making the compilation cycle much faster. On the average, our tool generates the VHDL code (and the corresponding placment information) from the data flow graph of a program in less than a minute. By losing 1.3 times in the quality of the design, we can achieve, 10.7 times speedup in the Xilinx placement phase, and 2.5 times overall speedup in the Xilinx place-and-route phase.
© (2000) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Kia Bazargan, Majid Sarrafzadeh, "Fast scheduling and placement methods for C to hardware/software compilation", Proc. SPIE 4212, Reconfigurable Technology: FPGAs for Computing and Applications II, (6 October 2000); doi: 10.1117/12.402528; https://doi.org/10.1117/12.402528


Solving graph problems with dynamic computation structures
Proceedings of SPIE (October 21 1996)
Malleable architecture generator for FPGA computing
Proceedings of SPIE (October 21 1996)
WILDFIRE custom configurable computer
Proceedings of SPIE (September 19 1995)
Field programmable gate arrays and reconfigurable computing
Proceedings of SPIE (September 19 1995)

Back to Top