Loading...
Please wait, while we are loading the content...
Similar Documents
Buffer-space efficient and deadlock-free scheduling of stream applications on multi-core architectures (2010)
| Content Provider | CiteSeerX |
|---|---|
| Author | Park, Jongsoo Dally, William J. |
| Description | We present a scheduling algorithm of stream programs for multi-core architectures called team scheduling. Compared to previous multi-core stream scheduling algorithms, team scheduling achieves 1) similar synchronization overhead, 2) coverage of a larger class of applications, 3) better control over buffer space, 4) deadlock-free feedback loops, and 5) lower latency. We compare team scheduling to the latest stream scheduling algorithm, sgms, by evaluating 14 applications on a multi-core architecture with 16 cores. Team scheduling successfully targets applications that cannot be validly scheduled by sgms due to excessive buffer requirement or deadlocks in feedback loops (e.g., gsm and w-cdma). For applications that can be validly scheduled by sgms, team scheduling shows on average 37 % higher throughput within the same buffer space constraints. |
| File Format | |
| Language | English |
| Publisher Date | 2010-01-01 |
| Publisher Institution | in Proc. of the 22nd ACM Symp. on Parallelism in Algorithms and Architectures |
| Access Restriction | Open |
| Subject Keyword | Similar Synchronization Overhead Feedback Loop Deadlock-free Scheduling Stream Program Multi-core Architecture Team Scheduling Stream Application Previous Multi-core Stream Buffer-space Efficient Buffer Space Constraint Excessive Buffer Requirement Deadlock-free Feedback Loop Target Application Team Scheduling Show Scheduling Algorithm |
| Content Type | Text |
| Resource Type | Article |
