A computing origami folding streams in FPGAs

Stream processing represents an important class of applications that spans telecommunications, multimedia and the Internet. The implementation of streaming programs in FPGAs has attracted significant attention because of their inherent parallelism and high performance requirements. Languages, tools,...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2009 46th ACM/IEEE Design Automation Conference s. 282 - 287
Hlavní autori: Hagiescu, Andrei, Wong, Weng-Fai, Bacon, David F., Rabbah, Rodric
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: New York, NY, USA ACM 26.07.2009
IEEE
Edícia:ACM Conferences
Predmet:
ISBN:9781605584973, 1605584975
ISSN:0738-100X
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Stream processing represents an important class of applications that spans telecommunications, multimedia and the Internet. The implementation of streaming programs in FPGAs has attracted significant attention because of their inherent parallelism and high performance requirements. Languages, tools, and even custom hardware for streaming have been proposed, some of which are commercially available. There are several significant challenges to realizing streaming applications directly in hardware (FPGAs). Since FPGAs have finite resources, there are often many non-trivial tradeoffs between processing throughput and overall latency. In this paper, we describe an algorithm that computes refinements of stream graphs into designs that optimize processing throughput subject to user-specified area and latency constraints.
ISBN:9781605584973
1605584975
ISSN:0738-100X
DOI:10.1145/1629911.1629987