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,...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2009 46th ACM/IEEE Design Automation Conference S. 282 - 287
Hauptverfasser: Hagiescu, Andrei, Wong, Weng-Fai, Bacon, David F., Rabbah, Rodric
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: New York, NY, USA ACM 26.07.2009
IEEE
Schriftenreihe:ACM Conferences
Schlagworte:
Algorithm design and analysis
Delay
Field programmable gate arrays
FPGA
Hardware
Hardware > Electronic design automation > Logic synthesis > Circuit optimization
Internet
Latency
Parallel processing
Process design
Streaming
Streaming media
Telecommunication computing
Throughput
streaming
throughput
FPGA
latency
ISBN:9781605584973, 1605584975
ISSN:0738-100X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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