An empirical characterization of stream programs and its implications for language and compiler design

Stream programs represent an important class of high-performance computations. Defined by their regular processing of sequences of data, stream programs appear most commonly in the context of audio, video, and digital signal processing, though also in networking, encryption, and other areas. In order to develop effective compilation techniques for the streaming domain, it is important to understand the common characteristics of these programs. Prior characterizations of stream programs have examined legacy implementations in C, C++, or FORTRAN, making it difficult to extract the high-level properties of the algorithms. In this work, we characterize a large set of stream programs that was implemented directly in a stream programming language, allowing new insights into the high-level structure and behavior of the applications. We utilize the StreamIt benchmark suite, consisting of 65 programs and 33,600 lines of code. We characterize the bottlenecks to parallelism, the data reference patterns, the input/ output rates, and other properties. The lessons learned have implications for the design of future architectures, languages and compilers for the streaming domain.National Science Foundation (U.S.) (grant 0325297)National Science Foundation (U.S.) (grant 0832997)National Science Foundation (U.S.) (grant 0811696