Exploiting coarse-grained task, data, and pipeline parallelism in stream programs
Michael I. Gordon, William Thies, Saman P. Amarasinghe · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · 2006
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.
Cited by 512 works. doi:10.1145/1168857.1168877
Authors
References
- Lecture Notes in Computer Science 1205
- Brook for GPUs
- Introduction to the Theory of Computation
- Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing
- Niagara: A 32-Way Multithreaded Sparc Processor
- Baring it all to software: Raw machines
- The Raw microprocessor: a computational fabric for software circuits and general-purpose programs
- Cg
- Static scheduling algorithms for allocating directed task graphs to multiprocessors
- StreamIt: A Language for Streaming Applications