Exploiting coarse-grained task, data, and pipeline parallelism in stream programs

MI Gordon, W Thies, S Amarasinghe - ACM SIGPLAN Notices, 2006 - dl.acm.org
ACM SIGPLAN Notices, 2006dl.acm.org
As multicore architectures enter the mainstream, there is a pressing demand for high-level
programming models that can effectively map to them. Stream programming offers an
attractive way to expose coarse-grained parallelism, as streaming applications (image,
video, DSP, etc.) are naturally represented by independent filters that communicate over
explicit data channels. In this paper, we demonstrate an end-to-end stream compiler that
attains robust multicore performance in the face of varying application characteristics. As …
As multicore architectures enter the mainstream, there is a pressing demand for high-level programming models that can effectively map to them. Stream programming offers an attractive way to expose coarse-grained parallelism, as streaming applications (image, video, DSP, etc.) are naturally represented by independent filters that communicate over explicit data channels.In this paper, we demonstrate an end-to-end stream compiler that attains robust multicore performance in the face of varying application characteristics. As benchmarks exhibit different amounts of task, data, and pipeline parallelism, we exploit all types of parallelism in a unified manner in order to achieve this generality. Our compiler, which maps from the StreamIt language to the 16-core Raw architecture, attains a 11.2x mean speedup over a single-core baseline, and a 1.84x speedup over our previous work.
ACM Digital Library
以上显示的是最相近的搜索结果。 查看全部搜索结果