Please use this identifier to cite or link to this item:
|Title:||A computing origami: Folding streams in FPGAs||Authors:||Hagiescu, A.
|Issue Date:||2009||Citation:||Hagiescu, A.,Wong, W.-F.,Bacon, D.F.,Rabbah, R. (2009). A computing origami: Folding streams in FPGAs. Proceedings - Design Automation Conference : 282-287. ScholarBank@NUS Repository.||Abstract:||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. Copyright 2009 ACM.||Source Title:||Proceedings - Design Automation Conference||URI:||http://scholarbank.nus.edu.sg/handle/10635/41076||ISBN:||9781605584973||ISSN:||0738100X|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 14, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.