A computing origami folding streams in FPGAs

• Published in: 2009 46th ACM/IEEE Design Automation Conference pp. 282 - 287
• Main Authors: Hagiescu, Andrei, Wong, Weng-Fai, Bacon, David F., Rabbah, Rodric
• Format: Conference Proceeding
• Language: English
• Published: New York, NY, USA ACM 26.07.2009; IEEE
• Series: ACM Conferences
• Subjects: 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
• DOI: 10.1145/1629911.1629987

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.