Show simple item record

dc.contributor.authorThies, William F.en_US
dc.contributor.authorKarczmarek, Michaelen_US
dc.contributor.authorGordon, Michaelen_US
dc.contributor.authorMaze, Daviden_US
dc.contributor.authorWong, Jeremyen_US
dc.contributor.authorHoffmann, Henryen_US
dc.contributor.authorBrown, Matthewen_US
dc.contributor.authorAmarasinghe, Samanen_US
dc.date.accessioned2023-03-29T14:42:29Z
dc.date.available2023-03-29T14:42:29Z
dc.date.issued2002-02
dc.identifier.urihttps://hdl.handle.net/1721.1/149311
dc.description.abstractStreaming programs represent an increasingly important and widespread class of applications that holds unprecedented opportunitie sfor high-impact compiler technology. Unlike sequential programs with obscured dependence information and complex communication patterns, a stream program is naturally written as a set of concurrent filters with regular steady-state communication. The StreamIt language aims to provide a natural, high-level syntax that improves programmer productivity in the streaming domain. At the same time, the language imposes a hierarchical structure on the stream graph that enables novel representations and optimizations within the StreamIt compiler. We define the "stream dependence function," a fundamental relationship between the input channels of two filters in a stream graph. We also describe a suite of stream optimizations, a denotational semantics for validating these optimizations, and a novel phased scheduling algorithm for stream graphs. In addition, we have implemented a prototype of the StreamIt optimizing compiler that is showing promising results.en_US
dc.relation.ispartofseriesMIT-LCS-TM-622
dc.titleStreamIT: A Complier for Streaming Applicationsen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record