A datapath classification method for FPGA-based scientific application accelerator systems
- 1 December 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 441-444
Abstract
Resource reduction design techniques play an important role to implement large-scale FPGA-based accelerator systems in floating point applications since available resources on FPGAs are limited. This paper proposes a dataflow graph classification method which makes groups of graphs based on their similarity in order to bring out efficient graph combining. Aiming at finding effective parameters for the k-means algorithm, various parameter combinations are evaluated and compared in terms of resource reduction effects and performance. The experimental results using an FPGA-based biochemical simulator reveal that the graph clustering that uses information on the maximum common subgraphs achieve 73.3% of resource reduction rate while alleviating the performance degradation.Keywords
This publication has 13 references indexed in Scilit:
- An Introduction to High-Level SynthesisIEEE Design & Test of Computers, 2009
- Configuring area and performance: Empirical evaluation on an FPGA-based biochemical simulator2009
- Accelerating astrophysical particle simulations with programmable hardware (FPGA and GPU)Computer Science - Research and Development, 2009
- Pipeline Scheduling with Input Port Constraints for an FPGA-Based Biochemical Simulator2009
- A New Datapath Merging Method for Reconfigurable System2009
- Pattern-based behavior synthesis for FPGA resource reduction2008
- LibSBML: an API Library for SBMLBioinformatics, 2008
- ReCSiP: An FPGA‐based general‐purpose biochemical simulatorElectronics and Communications in Japan (Part II: Electronics), 2007
- Systolic Architecture for Computational Fluid Dynamics on FPGAs2007
- Dynamic template generation for resource sharing in control and data flow graphs2006