2017
DOI: 10.1007/978-3-319-56258-2_26
|View full text |Cite
|
Sign up to set email alerts
|

dfesnippets: An Open-Source Library for Dataflow Acceleration on FPGAs

Abstract: Abstract. Highly-tuned FPGA implementations can achieve significant performance and power efficiency gains over general purpose hardware. However the limited development productivity has prevented mainstream adoption of FPGAs in many areas such as High Performance Computing. High level standard development libraries are increasingly adopted in improving productivity. We propose an approach for performance critical applications including standard library modules, benchmarking facilities and application benchmar… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 32 publications
(37 reference statements)
0
3
0
Order By: Relevance
“…The maximum value of the innermost loop is received as input stream. Therefore, a buffer is used to hide the input latency of the stream, as inspired by the dfesnippets library [19], to allow for an efficient dataflow implementation. Consequently, the number of total operation ticks is increased by 4 (the input latency), however, this is a negligible increase compared to the overall operation ticks and the benefit of buffering.…”
Section: ) Gap Junctionsmentioning
confidence: 99%
“…The maximum value of the innermost loop is received as input stream. Therefore, a buffer is used to hide the input latency of the stream, as inspired by the dfesnippets library [19], to allow for an efficient dataflow implementation. Consequently, the number of total operation ticks is increased by 4 (the input latency), however, this is a negligible increase compared to the overall operation ticks and the benefit of buffering.…”
Section: ) Gap Junctionsmentioning
confidence: 99%
“…The accumulator included the reduction circuits and an adder tree, which was introduced to eliminate out-of-order outputs and reduce buffering requirements of the reduction circuits. Wayne [11] proposed an open-source library for Dataflow acceleration on FPGAs, in which the partially compacted binary reduction tree was introduced. And the state machine was used to enable the PCBT to stall but preserve the intermediate results if necessary.…”
Section: Background and Related Workmentioning
confidence: 99%
“…In fact, the basic architectures of the reduction circuits [10], [11], [18] were not modified, but the additional circuits were introduced to improve the functionality of the reduction circuit.…”
Section: Background and Related Workmentioning
confidence: 99%