Accelerating Algorithms using a Dataflow Graph in a Reconfigurable System
Jorge Luiz e Silva, Joelmir Jose Lopes, Bruno de Abreu Silva and, Antonio Carlos Fernandes da Silva

TL;DR
This paper explores how implementing algorithms on a static dataflow architecture using FPGA can significantly boost computation speeds, demonstrating promising benchmark results.
Contribution
It introduces a static dataflow architecture on FPGA for algorithm acceleration, highlighting its potential for high computation rates.
Findings
High computation rates achieved in benchmarks
Effective implementation of static dataflow architecture
Potential for reconfigurable system acceleration
Abstract
In this paper, the acceleration of algorithms using a design of a field programmable gate array (FPGA) as a prototype of a static dataflow architecture is discussed. The static dataflow architecture using operators interconnected by parallel buses was implemented. Accelerating algorithms using a dataflow graph in a reconfigurable system shows the potential for high computation rates. The results of benchmarks implemented using the static dataflow architecture are reported at the end of this paper.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsEmbedded Systems Design Techniques · Interconnection Networks and Systems · Parallel Computing and Optimization Techniques
