Phased Scheduling of Stream Programs流程序的分阶段调度.pptVIP

Phased Schedulingof Stream Programs Michal Karczmarek, William Thies and Saman Amarasinghe MIT LCS Streaming Application Domain Based on audio, video and data streams Increasingly prevalent Embedded systems Cell phones, handheld computers, etc. Desktop applications Streaming media Software radio Real-time encryption High-performance servers Software Routers (ex. Click) Cell phone base stations HDTV editing consoles Properties of Stream Programs A large (possibly infinite) amount of data Limited lifespan of each data item Little processing of each data item A regular, static computation pattern Stream program structure is relatively constant A lot of opportunities for compiler optimizations StreamIt Language Streaming Language from MIT LCS Similar to Synchronous Data Flow (SDF) Provides hierarchy structure Four Structures: Filter Pipeline SplitJoin FeedbackLoop All Structures have Single-Input Channel Single-Output Channel Filters allow ‘peeking’ – looking at items which are not consumed Our Contributions New scheduling technique called Phased Scheduling Small buffer sizes for hierarchical programs Fine grained control over schedule size vs buffer size tradeoff Allows for separate compilation by always avoiding deadlock Performs initialization for peeking Filters Overview General Stream Concepts StreamIt Details Program Steady State and Initialization Single Appearance and Pull Scheduling Phased Scheduling Minimal Latency Results Related Work and Conclusion Stream Programs Consist of Filters and Channels Filters perform computation Channels act as FIFO queues for data between Filters Filters Execute a work function which: Consumes data from their input Produces data to their output Filters consume and produce constant amount of data on every execution of the work function Rates are known at compilation time Filter executions are atomic Stream Program Schedule Describes the order in which filters are executed Needs to manage grossly mismatched rates between filt